資源簡介
遺傳算法求解目標分配問題的代碼,感覺挺有用的,希望能夠幫助到有需要的朋友
代碼片段和文件信息
clc;
clear?all;
NIND=80;????????
MAXGEN=100;
GGAP=0.9
trace=zeros(MAXGEN2);
baseV=crtbase(158);
Chrom=crtbp(NINDbaseV)+ones(NIND15);??????????%初始種群
gen=0;
ObjV=targetalloc(Chrom);?????????????????%%計算初始種群函數值
INSR=0.9;
SUBPOP=4;
MIGR=0.7;
MIGGEN=50;
x=0;
y=0;
while??gen ????FitnV=ranking(-ObjV[21]SUBPOP);
????E_F=sum(FitnV)./NIND;?????????????????%種群的平均適應度
????for?i=1:NIND
????????if?(FitnV(i)>E_F)
????????????x=x+1;
????????elseif?(FitnV(i) ????????????y=y+1;
????????end
????end
????Pc=1/(1+exp((x/NIND)*(x/y)))+0.5
????Pm=abs(1/(1+exp((-x/NIND)*(x/y)))-0.92)
????
????%SelCh=select(‘sus‘ChromFitnVGGAP);%選擇
????SelCh=select(‘sus‘ChromFitnVGGAPSUBPOP)
????%SelCh=recombin(‘xovmp‘SelChPc);??%交叉?
????SelCh=recombin(‘xovmp‘SelChPc
?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件???????1242??2011-06-07?20:49??目標分配問題\GAmain.m
?????文件????????816??2012-03-08?21:15??目標分配問題\targetalloc.m
?????文件???????1637??2012-03-20?16:41??目標分配問題\fangfashiyan.m
?????目錄??????????0??2011-08-18?20:58??目標分配問題
-----------?---------??----------?-----??----
?????????????????3695????????????????????4
評論
共有 條評論