1、遺傳算法程序（一）: 說(shuō)明: fga.m 為遺傳算法的主程序; 采用二進(jìn)制 Gray 編碼,采用基于輪盤(pán)賭法的非線性排名選擇, 均勻交叉,變異操作,而且還引入了倒位操作! function [BestPop,Trace]=fga(FUN,LB,UB,eranum,popsize,pCross,pMutation,pInversion,options) % [BestPop,Trace]=fmaxga(FUN,LB,UB,eranum,

2、popsize,pcross,pmutation) % Finds a maximum of a function of several variables. % fmaxga solves problems of the form: % max F(X) subject to: LB 0) error('數(shù)據(jù)輸入錯(cuò)誤,請(qǐng)重新輸入(LB1 時(shí),b(i)=mod(a(i-1)+a(i),2) %其中原二進(jìn)制串:a(1

3、)a(2)...a(n),Gray 串:b(1)b(2)...b(n) initpop(i,:)=pop(1:end-1); end initpop(popsize,:)=ones(1,len);%The whole one encoding individual %解碼 function [fval] = b2f(bval,bounds,bits) % fval - 表征各變量的十進(jìn)制數(shù) % bval - 表征各變量的二進(jìn)制

4、編碼串 % bounds - 各變量的取值范圍 % bits - 各變量的二進(jìn)制編碼長(zhǎng)度 scale=(bounds(:,2)-bounds(:,1))'./(2.^bits-1); %The range of the variables numV=size(bounds,1); cs=[0 cumsum(bits)]; for i=1:numV a=bval((cs(i)+1):cs(i+1)); fval(i)=sum