pso3.asv

粒子群优化算法pso

c1=2;
c2=2;
X(1,1)=0.4;
X(2,1)=0.44;
X(3,1)=0.45;
V(1,1)=1;
V(2,1)=1;
V(3,1)=1;
P(1,1)=0.7;
P(2,1)=0.68;
P(3,1)=0.73;
G=0.77*eye(10);
for j=1;10
    for i=1:3 
        V(i,j+1)=V(i,j)+c1*rand(1)*(P(i,j)-X(i,j))+c2*rand(1)*(G(i,i)-X(i,j));
        X(i,j+1)=X(i,j)+V(i,j); 
        if X(i,j+1)>=P(i,j)
            P(i,j+1)=X(i,j+1);
        else 
            P(i,j+1)=P(i,j);
        end
    end
    for i=1:3
        if G(i,i)>=P(i,j+1)
            G(i+1,i+1)=G(i,i);
    else 
        G(i+1,i+1)=P(i+1,j);
    end
end
j=1:10;
 plot(j,X(i,j))