fahanshu.zip_fahanshu_罚函数_罚函数法

function m=fahanshu clc;clear; m=1; fitness=@(x,m) f(x,m); N=50; n=2; x1min=-1000; x1max=1000; x2min=-1000; x2max=1000; xmin=[x1min x2min]; xmax=[x1max x2max]; vmax=[(x1max-x1min)/100 (x2max-x2min)/100]; vmin=[-(x1max-x1min)/100 -(x2max-x2min)/100]; c1=2; c2=2; iter_max=500; wmax=0.9; wmin=0.4; % backup-particles for j=1:n bx(:,j)=xmin(j)+(xmax(j)-xmin(j))*rand(N,1); bv(:,j)=vmin(j)+(vmax(j)-vmin(j))*rand(N,1); end for j=1:n x(:,j)=xmin(j)+(xmax(j)-xmin(j))*rand(N,1); v(:,j)=vmin(j)+(vmax(j)-vmin(j))*rand(N,1); end pbest=x; for i=1:N f(i,:)=fitness(pbest(i,:),m); end [fbest,index]=min(f); gbest=pbest(index,:); for iter=1:iter_max w=wmax-(wmax-wmin)*iter/iter_max; for i=1:N v(i,:)=w*v(i,:)+c1*rand*(pbest(i,:)-x(i,:))+c2*rand*(gbest-x(i,:)); end for i=1:N for j=1:n if v(i,j)>vmax(j) v(i,j)=vmax(j); end if v(i,j)<vmin(j) v(i,j)=vmin(j); end end end for i=1:N a=1;k=0; fnew=100; fold=1; while (abs(fnew-fold)<100)&&(k<=50) fold=fitness(x(i,:),m); x(i,:)=x(i,:)+a*v(i,:); fnew=fitness(x(i,:),m); if fnew<fold a=a*2; else a=-a/4; end k=k+1; end end for i=1:N for j=1:n if x(i,j)>xmax(j) x(i,j)=xmax(j); end if x(i,j)<xmin(j) x(i,j)=xmin(j); end end end for i=1:N if fitness(x(i,:),m)<fitness(pbest(i,:),m) pbest(i,:)=x(i,:); end if fitness(pbest(i,:),m)<fitness(gbest,m) gbest=pbest(i,:); end end g(iter)=fitness(gbest,m); m=m*1.5; end gbest y=min(g) p=(1:1:iter_max); plot(p,g) function y=f(x,m) h=x(1)-6; y=x(1)^2+x(2)^2-x(1)*x(2)-10*x(1)-4*x(2)+60+m*h^2;