資源簡介
帶注釋的布谷鳥算法,清晰易懂,簡潔好用,可以更改適應度函數應用不同的場景。

代碼片段和文件信息
%這是CS算法的主函數先設置參數
n=20;
pa=0.25;
Lb=[-1?-5];?
Ub=[1?5];
time=100;????????????????%循環次數
%隨機初始解
for?i=1:n;
????nest(i:)=Lb+(Ub-Lb).*rand(size(Lb));
???%?fitness=fobj(nest(i:));
end
fitness=10^10*ones(n1);???????%初始適應度
[fminbestnestnestfitness]=get_best_nest(nestnestfitness);
N_iter=0;
for?t=1:time
????new_nest=get_cuckoos(nestbestnestLbUb);???
????[fnewbestnestfitness]=get_best_nest(nestnew_nestfitness);
????N_iter=N_iter+n;?
????new_nest=empty_nests(nestLbUbpa)?;??%隨機游走策略
????[fnewbestnestfitness]=get_best_nest(nestnew_nestfitness);
????N_iter=N_iter+n;
????if?fnew ????????fmin=fnew;
????????bestnest=best?;
????end
????yy(t)=fmin;
end?%%?End?of?iterations
disp(strcat(‘Total?number?of?iterations=‘num2str(N_iter)));
fmin
bestnest
plot(yy)
axis([0?100?0?0.09])
xlabel(‘Cuckoo?Iteraiton‘)
ylabel(‘fmin‘)
title(‘CS算法流程圖‘)
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????目錄???????????0??2018-06-24?13:29??CS_algorithm\
?????文件?????????947??2017-07-27?15:17??CS_algorithm\CS_main.m
?????文件?????????350??2017-07-26?20:25??CS_algorithm\empty_nests.m
?????文件?????????200??2017-07-27?15:16??CS_algorithm\fobj.m
?????文件?????????318??2017-07-26?20:20??CS_algorithm\get_best_nest.m
?????文件?????????452??2017-07-26?20:22??CS_algorithm\get_cuckoos.m
?????文件??????????59??2017-07-26?20:27??CS_algorithm\getH.m
?????文件??????????63??2017-07-26?20:28??CS_algorithm\getHeq.m
?????文件?????????525??2017-07-26?20:27??CS_algorithm\getnonlinear.m
?????文件?????????217??2017-07-26?20:26??CS_algorithm\simplebounds.m
- 上一篇:SevenZipSharp.dll
- 下一篇:8路遙測信號采編器的設計與實現
評論
共有 條評論