資源簡介
量子粒子群優化算法,采用matlab編程,可實現快速優化多維函數,不易陷入局部最優值
代碼片段和文件信息
popsize=20;
MAXITER=1000;
dimension=30;
irange_l=15;
irange_r=30;
xmax=100;
sum1=0;
sum2=0;
mean=0;
st=0;
runno=10;
data1=zeros(runnoMAXITER);
for?run=1:runno
T=cputime;
x=(irange_r-?irange_l)*rand(popsizedimension1)?+?irange_l;
pbest=x;
gbest=zeros(1dimension);
for?i=1:popsize
????f_x(i)=f2(x(i:));
????f_pbest(i)=f_x(i);
end
???
???
????g=min(find(f_pbest==min(f_pbest(1:popsize))));
????gbest=pbest(g:);
???
????f_gbest=f_pbest(g);
MINIUM=f_pbest(g);
for?t=1:MAXITER
??
????beta=(1-0.5)*(MAXITER-t)/MAXITER+0.5;
????mbest=sum(pbest)/popsize;
???????
?for?i=1:popsize??
????????fi=rand(1dimension);
????????p=fi.*pbest(i:)+(1-fi).*gbest;
????????u=rand(1dimension);
????????b=beta*(mbes
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件???????1534??2007-12-13?21:29??QPSO\QPSO.m
?????目錄??????????0??2011-04-02?19:17??QPSO
-----------?---------??----------?-----??----
?????????????????1534????????????????????2
評論
共有 條評論