資源簡介
QPSO量子粒子群算法,QPSO LSSVM,SVM
代碼片段和文件信息
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*(mbest-x(i:));
????????v=-log(u);
????????y=p+((-1).^ceil(0.5+rand(1dimension))).*b.*v;
????????x(i:)=y;
????????x(i:)=sign(y).*min(abs(y)xmax);?
??????????
????????????f_x(i)=f2(x(i:));
????????????if?f_x(i) ????????????????pbest(i:)=x(i:);
????????????????f_pbest(i)=f_x(i);
????????????end
????????????if?f_pbest(i) ????????????????gbest=pbest(i:);
????????????????f_gbest=f_pbest(i);
????????????end????????????
????????????MINIUM=f_gbest;????????????????????
?end
????data1(runt)=MINIUM;
????if?MINIUM>1e-007
????????mean=t;
????end
??end
sum1=sum1+mean;??
sum2=sum2+MINIUM;
?%MINIUM
time=cputime-T;
st=st+time;
end
av1=sum1/10;??%輸出平均收驗代數
av2=sum2/10;??%輸出平均最優解
st/10??%就是最后anw輸出的解
????????
?
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件???????1534??2012-08-24?01:11??The?QPSO?.m
-----------?---------??----------?-----??----
?????????????????1534????????????????????1
評論
共有 條評論