%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
% BPSO and VPSO source codes version 1.0 %
% %
% Developed in MATLAB R2011b(7.13) %
% %
% Author and programmer: Seyedali Mirjalili %
% %
% e-Mail: ali.mirjalili@gmail.com %
% seyedali.mirjalili@griffithuni.edu.au %
% %
% Homepage: http://www.alimirjalili.com %
% %
% Main paper: S. Mirjalili and A. Lewis, "S-shaped versus %
% V-shaped transfer functions for binary Particle %
% Swarm Optimization," Swarm and Evolutionary %
% Computation, vol. 9, pp. 1-14, 2013. %
% %
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
function [gBest,gBestScore,ConvergenceCurve]=BPSO(noP,Max_iteration,BPSO_num,CostFunction,noV)
%Initial Parameters for PSO
w=2; %Inirtia weight
wMax=0.9; %Max inirtia weight
wMin=0.4; %Min inirtia weight
c1=2;
c2=2;
Vmax=6;
Velocity=zeros(noP,noV);%Velocity vector
Position=zeros(noP,noV);%Position vector
%////////Cognitive component/////////
pBestScore=zeros(noP);
pBest=zeros(noP,noV);
%////////////////////////////////////
%////////Social component///////////
gBestScore=inf;
gBest=zeros(1,noV);
%///////////////////////////////////
ConvergenceCurve=zeros(1,Max_iteration); %Convergence vector
%Initialization
for i=1:size(Position,1) % For each particle
for j=1:size(Position,2) % For each variable
if rand<=0.5
Position(i,j)=0;
else
Position(i,j)=1;
end
end
end
for i=1:noP
pBestScore(i)=inf;
end
for l=1:Max_iteration
%Calculate cost for each particle
for i=1:size(Position,1)
fitness=CostFunction(Position(i,:));
if(pBestScore(i)>fitness)
pBestScore(i)=fitness;
pBest(i,:)=Position(i,:);
end
if(gBestScore>fitness)
gBestScore=fitness;
gBest=Position(i,:);
end
end
%update the W of PSO
w=wMax-l*((wMax-wMin)/Max_iteration);
%Update the Velocity and Position of particles
for i=1:size(Position,1)
for j=1:size(Position,2)
%Equation (1)
Velocity(i,j)=w*Velocity(i,j)+c1*rand()*(pBest(i,j)-Position(i,j))+c2*rand()*(gBest(j)-Position(i,j));
if(Velocity(i,j)>Vmax)
Velocity(i,j)=Vmax;
end
if(Velocity(i,j)<-Vmax)
Velocity(i,j)=-Vmax;
end
if BPSO_num==1
s=1/(1+exp(-2*Velocity(i,j))); %S1 transfer function
end
if BPSO_num==2
s=1/(1+exp(-Velocity(i,j))); %S2 transfer function
end
if BPSO_num==3
s=1/(1+exp(-Velocity(i,j)/2)); %S3 transfer function
end
if BPSO_num==4
s=1/(1+exp(-Velocity(i,j)/3)); %S4 transfer function
end
if BPSO_num<=4 %S-shaped transfer functions
if rand<s % Equation (4) and (8)
Position(i,j)=1;
else
Position(i,j)=0;
end
end
if BPSO_num==5
s=abs(erf(((sqrt(pi)/2)*Velocity(i,j)))); %V1 transfer function
end
if BPSO_num==6
s=abs(tanh(Velocity(i,j))); %V2 transfer function
end
if BPSO_num==7
s=abs(Velocity(i,j)/sqrt((1+Velocity(i,j)^2))); %V3 transfer function
end
if BPSO_num==8
s=abs((2/pi)*atan((pi/2)*Velocity(i,j))); %V4 transfer function (VPSO)
end
if BPSO_num>4 && BPSO_num<=8 %V-shaped transfer functions
if rand<s %Equation (10)
Position(i,j)=~Position(i,j);
end
end
end
end
ConvergenceCurve(l)=gBestScore;
end
end
【粒子群算法】基于S形和V形传递函数的二进制粒子群优化算法BPSO附matlab代码.zip
版权申诉
138 浏览量
2024-01-23
09:56:31
上传
评论
收藏 101KB ZIP 举报
【粒子群算法】基于S形和V形传递函数的二进制粒子群优化算法BPSO附matlab代码.zip （7个子文件） 
MyCost.m 1KB
VPSO BPSO.m 5KB
1.png 19KB resuls.mat 2KB Main.m 2KB DrawConvergenceCurves.m 3KB VPSO.png 84KB资源评论
