?? smpso_f1_0.m
字號:
x5(1)=-3.0;
end
if x5(2)>5.8
x5(2)=5.8;
end
if x5(2)<4.1
x5(2)=4.1;
end
fx5=21.5+x5(1)*sin(4.0*pi*x5(1))+x5(2)*sin(20.0*pi*x5(2));
else
x5=x4+0.5*(x5-x4);
if x5(1)>12.1,
x5(1)=12.1;
end
if x5(1)<-3.0,
x5(1)=-3.0;
end
if x5(2)>5.8
x5(2)=5.8;
end
if x5(2)<4.1
x5(2)=4.1;
end
fx5=21.5+x5(1)*sin(4.0*pi*x5(1))+x5(2)*sin(20.0*pi*x5(2));
end
end
end
x3=x2; x2=x1; % 新的單純形頂點
if fx5>=fx4
x1=x5;
else
x1=x4;
end
end
clear x5; clear fx5; clear kzxs;
if fx4<=fx1 % 不壓縮也不擴張
if fx4>=fx2
x3=x2; x2=x4; x1=x1; % 新的單純形頂點
end
end
if fx4<fx2 % 壓縮
if fx4>=fx3
xa=x4; fxa=fx4;
else
xa=x3; fxa=fx3;
end
x6=(x1+x2)/2+0.7*(xa-(x1+x2)/2);
if x6(1)>12.1,
x6(1)=12.1;
end
if x6(1)<-3.0,
x6(1)=-3.0;
end
if x6(2)>5.8
x6(2)=5.8;
end
if x6(2)<4.1
x6(2)=4.1;
end
fx6=21.5+x6(1)*sin(4.0*pi*x6(1))+x6(2)*sin(20.0*pi*x6(2));
if fx6>=fxa
x3=x6; x2=x2; x1=x1; % 壓縮
else
x7=x2+(x1-x2)/2; % 收縮
x8=x3+(x1-x3)/2;
x1=x1; x2=x7; x3=x8;
end
end
clear xa; clear fxa; clear x6; clear fx6; clear x7; clear x8;
end
% iter=iter+1;
gbestchangecounter=2;
[OderF,IndexF]=sort(fit); % 從小到大排列適應(yīng)值
popul(:,IndexF(1))=x1; % 將單純形法搜索后的頂點回代給PSO
popul(:,IndexF(2))=x2;
popul(:,IndexF(3))=x3;
clear OderF; clear IndexF;
fx(1)=21.5+x1(1)*sin(4.0*pi*x1(1))+x1(2)*sin(20.0*pi*x1(2));
fx(2)=21.5+x2(1)*sin(4.0*pi*x2(1))+x2(2)*sin(20.0*pi*x2(2));
fx(3)=21.5+x3(1)*sin(4.0*pi*x3(1))+x3(2)*sin(20.0*pi*x3(2));
x(:,1)=x1; x(:,2)=x2; x(:,3)=x3;
[OderF,IndexF]=sort(fx);
gbestfittemp=OderF(3);
if gbestfittemp>=gbestfit
gbestfit=gbestfittemp;
gbestpos=x(:,IndexF(3));
end
clear OderF; clear IndexF; clear fx; clear x; clear gbestfittemp;
clear x1; clear x2; clear x3; clear x4; clear fx1; clear fx2;
clear fx3; clear fx4;
end
end
smPSOgbestfit(iii)=gbestfit; % 需要保留
% 爬山微粒群算法求解結(jié)束
%**********************************************************************
clear gbestpos; clear gbestfit; clear ibestfit; clear ibestpos;
clear bestpart; clear g; clear popul; clear vel; clear fit;
% *************************************************************************
% 微粒群優(yōu)化算法求解----基本PSO
% *************************************************************************
% 初始參數(shù)
PopSize0=PopSize; % 微粒個數(shù)
puopul(1,:)=rand(1,PopSize0)*(12.1+3.0)-3.0; % 位置初始化
puopul(2,:)=rand(1,PopSize0)*(5.8-4.1)+4.1; % 位置初始化
vell=rand(dim,PopSize0); % 速度初始化
for i=1:PopSize0, % 計算適應(yīng)值
fitt(i)=21.5+puopul(1,i)*sin(4.0*pi*puopul(1,i))+puopul(2,i)*sin(20.0*pi*puopul(2,i));
end
% 將各微粒的位置設(shè)置為當(dāng)前各微粒最好的位置
ibestpos=puopul; % 個體最好位置初始化
ibestfit=fitt; % 各個體的適應(yīng)值
% 找出全局最好的初始微粒
[bestpart,g]=max(fitt); % 找全局最好的適應(yīng)值
gbestfit=bestpart; % 全局最好的適應(yīng)值
gbestpos=puopul(:,g); % 全局最好的適應(yīng)值對應(yīng)的個體
% 迭代開始/主程序開始運行
iter=0;
while (iter<MaxIt), % 迭代開始
iter=iter+1;
w=maxw-iter*(maxw-minw)/MaxIt; % 當(dāng)前步所用的慣性權(quán)值
for i=1:PopSize0, % 將全局最好的適應(yīng)值對應(yīng)的個體展開（若不展開來，沒法相減）
A(:,i)=gbestpos;
end
R1=rand(dim,PopSize0); R2=rand(dim,PopSize0);
vell=0.8*(w*vell+c1*R1.*(ibestpos-puopul)+c2*R2.*(A-puopul)); % 速度迭代計算
puopul=puopul+vell; % 位置迭代計算
clear A; clear R1; clear R2;
% 位置限幅處理
for i=1:PopSize0
if puopul(1,i)>12.1, % 限幅處理
puopul(1,i)=12.1;
end
if puopul(1,i)<-3.0,
puopul(1,i)=-3.0;
end
if puopul(2,i)>5.8
puopul(2,i)=5.8;
end
if puopul(2,i)<4.1
puopul(2,i)=4.1;
end
end
% 各微粒的適應(yīng)值計算
for i=1:PopSize0, % 適應(yīng)值計算
fitt(i)=21.5+puopul(1,i)*sin(4.0*pi*puopul(1,i))+puopul(2,i)*sin(20.0*pi*puopul(2,i));
end
% 更新個體歷史最好位置
for i=1:PopSize0,
if fitt(i)>ibestfit(i),
ibestfit(i)=fitt(i);
ibestpos(:,i)=puopul(:,i);
end
end
% 更新全局歷史最好位置
[bestpart,g]=max(fitt);
if bestpart>gbestfit;
gbestfit=bestpart;
gbestpos=puopul(:,g);
end
end
PSOgbestfit(iii)=gbestfit; % 輸出全局歷史最好適應(yīng)值（最優(yōu)f1值）
% 基本PSO求解結(jié)束
%**************************************************************************
clear gbestpos; clear gbestfit; clear ibestfit; clear ibestpos; clear i;
clear bestpart; clear g; clear puopul; clear vell; clear fitt;
%************************************************************************
% 單純形搜索－－－－基本sm
%**********************************************************************
x(1,:)=rand(1,3)*(12.1+3.0)-3.0; % 變量位置初始化
x(2,:)=rand(1,3)*(5.8-4.1)+4.1;
x1=x(:,1); % 選單純形的頂點
x2=x(:,2);
x3=x(:,3);
gbestfit=-100; % 附初始最好值
for tempii=1:MaxIt % 進行單純形法搜索
% 按最優(yōu)次序x1,x2,x3排列
fx1=21.5+x1(1)*sin(4.0*pi*x1(1))+x1(2)*sin(20.0*pi*x1(2));
fx2=21.5+x2(1)*sin(4.0*pi*x2(1))+x2(2)*sin(20.0*pi*x2(2));
fx3=21.5+x3(1)*sin(4.0*pi*x3(1))+x3(2)*sin(20.0*pi*x3(2));
fx(1)=fx1; fx(2)=fx2; fx(3)=fx3;
x(:,1)=x1; x(:,2)=x2; x(:,3)=x3;
[OrderF,IndexF]=sort(fx);
x1=x(:,IndexF(3)); x2=x(:,IndexF(2)); x3=x(:,IndexF(1));
fx1=OrderF(3); fx2=OrderF(2); fx3=OrderF(1);
clear OrderF; clear IndexF; clear fx;
error=sqrt((x1(1)-x2(1))^2+(x1(2)-x2(2))^2);
if error<0.000001
x2(1)=rand(1,1)*(12.1+3.0)-3.0; % 位置初始化
x2(2)=rand(1,1)*(5.8-4.1)+4.1;
end
error=sqrt((x1(1)-x3(1))^2+(x1(2)-x3(2))^2);
if error<0.000001
x3(1)=rand(1,1)*(12.1+3.0)-3.0; % 位置初始化
x3(2)=rand(1,1)*(5.8-4.1)+4.1;
end
error=sqrt((x2(1)-x3(1))^2+(x2(2)-x3(2))^2);
if error<0.000001
x3(1)=rand(1,1)*(12.1+3.0)-3.0; % 位置初始化
x3(2)=rand(1,1)*(5.8-4.1)+4.1;
end
clear error;
% 按最優(yōu)次序x1,x2,x3再次排列
fx1=21.5+x1(1)*sin(4.0*pi*x1(1))+x1(2)*sin(20.0*pi*x1(2));
fx2=21.5+x2(1)*sin(4.0*pi*x2(1))+x2(2)*sin(20.0*pi*x2(2));
fx3=21.5+x3(1)*sin(4.0*pi*x3(1))+x3(2)*sin(20.0*pi*x3(2));
fx(1)=fx1; fx(2)=fx2; fx(3)=fx3;
x(:,1)=x1; x(:,2)=x2; x(:,3)=x3;
[OrderF,IndexF]=sort(fx);
x1=x(:,IndexF(3)); x2=x(:,IndexF(2)); x3=x(:,IndexF(1));
fx1=OrderF(3); fx2=OrderF(2); fx3=OrderF(1);
clear OrderF; clear IndexF; clear fx;
% 反射
x4=x1+x2-x3; % 反射
if x4(1)>12.1,
x4(1)=12.1;
end
if x4(1)<-3.0,
x4(1)=-3.0;
end
if x4(2)>5.8
x4(2)=5.8;
end
if x4(2)<4.1
x4(2)=4.1;
end
fx4=21.5+x4(1)*sin(4.0*pi*x4(1))+x4(2)*sin(20.0*pi*x4(2));
% 擴張
if fx4>fx1 % 擴張
x5=(x1+x2)/2+1.5*(x4-(x1+x2)/2);
if x5(1)>12.1,
x5(1)=12.1;
end
if x5(1)<-3.0,
x5(1)=-3.0;
end
if x5(2)>5.8
x5(2)=5.8;
end
if x5(2)<4.1
x5(2)=4.1;
end
fx5=21.5+x5(1)*sin(4.0*pi*x5(1))+x5(2)*sin(20.0*pi*x5(2));
x3=x2; x2=x1;
if fx5>=fx4
x1=x5;
else
x1=x4;
end
end
clear x5; clear fx5;
% 替代操作
if fx4<=fx1 % 不壓縮也不擴張
if fx4>=fx2
x3=x2; x2=x4; x1=x1;
end
end
% 壓縮與收縮
if fx4<fx2 % 壓縮
if fx4>fx3
xa=x4; fxa=fx4;
else
xa=x3; fxa=fx3;
end
x6=(x1+x2)/2+0.7*(xa-(x1+x2)/2);
if x6(1)>12.1,
x6(1)=12.1;
end
if x6(1)<-3.0,
x6(1)=-3.0;
end
if x6(2)>5.8
x6(2)=5.8;
end
if x6(2)<4.1
x6(2)=4.1;
end
fx6=21.5+x6(1)*sin(4.0*pi*x6(1))+x6(2)*sin(20.0*pi*x6(2));
if fx6>=fxa
x3=x6; x2=x2; x1=x1; % 壓縮
else
x7=x2+(x1-x2)/2; % 收縮
x8=x3+(x1-x3)/2;
x1=x1; x2=x7; x3=x8;
end
end
clear xa; clear fxa; clear x6; clear fx6; clear x7; clear x8;
% 本次搜索的最佳值
fx0(1)=21.5+x1(1)*sin(4.0*pi*x1(1))+x1(2)*sin(20.0*pi*x1(2));
fx0(2)=21.5+x2(1)*sin(4.0*pi*x2(1))+x2(2)*sin(20.0*pi*x2(2));
fx0(3)=21.5+x3(1)*sin(4.0*pi*x3(1))+x3(2)*sin(20.0*pi*x3(2));
[smbestpart,smg]=max(fx0);
if smbestpart>gbestfit
gbestfit=smbestpart;
end
clear smg;
end
smgbestfit(iii)=gbestfit;
clear x1; clear x2; clear x3; clear fx0; clear tempii; clear gbestfit;
end
% 顯示過程軌跡
figure;
plot(1:iii,smPSOgbestfit(1:iii),'-r',1:iii,PSOgbestfit(1:iii),'-.b',1:iii,smgbestfit(1:iii),'--g')
xlabel('迭代次數(shù)'); % 坐標(biāo)標(biāo)注
ylabel('每一步的最佳適應(yīng)值');
title('測試函數(shù)為f1的優(yōu)化結(jié)果圖：');
legend('smPSO','PSO','SM');
sortpso=sort(PSOgbestfit);
sortsmpso=sort(smPSOgbestfit);
sortsm=sort(smgbestfit);
meansmpso=mean(smPSOgbestfit);
meanpso=mean(PSOgbestfit);
meansm=mean(smgbestfit);
% save smPSO_F1;
?? 快捷鍵說明
復(fù)制代碼
Ctrl + C
搜索代碼
Ctrl + F
全屏模式
F11
切換主題
Ctrl + Shift + D
顯示快捷鍵
?
增大字號
Ctrl + =
減小字號
Ctrl + -