資源簡介
并行自適應(yīng)克隆選擇算法 在FbgFunc.m中設(shè)置目標函數(shù)和優(yōu)化參數(shù) 在CloneySelection.m中設(shè)置參數(shù)取值范圍及其他算法參數(shù) 本算法在基本克隆選擇算法的基礎(chǔ)上增加自適應(yīng)和并行功能計算效率比基本克隆選擇算法高。 附帶論文為本人為第一作者撰寫的，論文中有一部分內(nèi)容介紹該算法流程。 對該算法有任何疑問可以通過dxbsoccer@163.com聯(lián)系我。 目前該算法暫時是無約束優(yōu)化，歡迎大家試用并提出寶貴意見。
(Parallel adaptive clonal selection algorithm It was added parallel computing and adaptive
代碼片段和文件信息
%PACS算法?并行自適應(yīng)克隆選擇算法
%By?dxb?201501013
clear;
clc;
parpool（6）;
%%%%%%%%%%%%%%%%%%%%%%%%%%%初始化%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
bound?=?[0?1;0?1;0?30;?0?50;?0?30];?????????%變量取值范圍
MAXGEN?=?200;???????????????????????????????%迭代次數(shù)
nc?=?80;????????????????????????????????????%克隆規(guī)模?大于種群數(shù)量
pm?=?0.5;???????????????????????????????????%抗體變異概率
popSize?=?40;???????????????????????????????%種群規(guī)模
numVar?=?5;?????????????????????????????????%變量個數(shù)
d?=?4;??????????????????????????????????????%替換抗體數(shù)量
newBorn?=?20;???????????????????????????????%隨機生成新子代
Fs?=?20;????????????????????????????????????%選擇池大小
[poprng]?=?initializeCS（popSize?bound）;???%隨機生成初始總?cè)?br/>TG?=?rng/30;????????????????????????????????%變異系數(shù)??????????3sigma
pop?=?getFbg（pop?popSize）;?????????????????%獲取親合度
pop??屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件???????2614??2015-01-14?02:24??pcsa\CloneySelection.m
?????文件????????827??2015-01-07?21:01??pcsa\FbgFunc.m
?????文件????1839983??2016-06-12?10:46??pcsa\Fractional-order?control?of?active?suspension?actuator?ba
?????文件???????4034??2015-01-14?00:57??pcsa\geneOps3.m
?????文件????????685??2014-08-13?13:10??pcsa\getFbb.m
?????文件????????922??2014-09-19?10:15??pcsa\getFbb2.m
?????文件????????673??2015-01-14?00:49??pcsa\getFbg.m
?????文件????????951??2015-01-14?01:17??pcsa\getFbgb.m
?????文件???????1376??2014-08-07?12:30??pcsa\initializeCS.m
?????文件????????379??2016-07-27?16:07??pcsa\Readme.txt
?????目錄??????????0??2016-07-27?16:00??pcsa
-----------?---------??----------?-----??----
??????????????1852444????????????????????11
評論
共有 條評論