遗传算法Matlab源代码.docx

1、遗传算法Matlab源代码function X,MaxFval,BestPop,Trace=fga(FUN,bounds,MaxEranum,PopSize,options,pCross,pMutation,pInversion)% X,MaxFval,BestPop,Trace=fga(FUN,bounds,MaxEranum,PopSize,options,pCross,pMutation,pInversion)% Finds a maximum of a function of several variables.% fga solves problems of the form: %

2、max F(X) subject to: LB = X = UB (LB=bounds(:,1),UB=bounds(:,2) % X - 最优个体对应自变量值% MaxFval - 最优个体对应函数值% BestPop - 最优的群体即为最优的染色体群% Trace - 每代最佳个体所对应的目标函数值% FUN - 目标函数% bounds - 自变量范围% MaxEranum - 种群的代数,取50-500(默认200)% PopSize - 每一代种群的规模；此可取50-200(默认100)% pCross - 交叉概率,一般取0.5-0.85之间较好(默认0.8)% pMutation

3、 - 初始变异概率,一般取0.05-0.2之间较好(默认0.1)% pInversion - 倒位概率,一般取0.050.3之间较好(默认0.2)% options - 1*2矩阵,options(1)=0二进制编码(默认0),option(1)=0十进制编码,option(2)设定求解精度(默认1e-4)T1=clock;%检验初始参数if nargin0) error(数据输入错误,请重新输入:);end% 定义全局变量global m n NewPop children1 children2 VarNum% 初始化种群和变量precision = options(2);bits = ce

4、il(log2(bounds(:,2)-bounds(:,1) ./ precision);%由设定精度划分区间VarNum = size(bounds,1);Pop = InitPop(PopSize,bounds,bits,options);%初始化种群m,n = size(Pop);fit = zeros(1,m);NewPop = zeros(m,n);children1 = zeros(1,n);children2 = zeros(1,n);pm0 = pMutation;BestPop = zeros(MaxEranum,n);%分配初始解空间BestPop,TraceTrace

5、= zeros(1,MaxEranum);Lb = ones(PopSize,1)*bounds(:,1);Ub = ones(PopSize,1)*bounds(:,2);%二进制编码采用多点交叉和均匀交叉，并逐步增大均匀交叉概率%浮点编码采用离散交叉（前期）、算术交叉（中期）、AEA重组（后期）OptsCrossOver = ones(1,MaxEranum)*options(1);. round(unidrnd(2*(MaxEranum-1:MaxEranum)/MaxEranum);%浮点编码时采用两种自适应变异和一种随机变异（自适应变异发生概率为随机变异发生的2倍）OptsMutat

6、ion = ones(1,MaxEranum)*options(1);unidrnd(5,1,MaxEranum);if options(1)=3 D=zeros(n); CityPosition=bounds; D = sqrt(CityPosition(:, ones(1,n) - CityPosition(:, ones(1,n).2 +. (CityPosition(:,2*ones(1,n) - CityPosition(:,2*ones(1,n).2 );end%=% 进化主程序 %=eranum = 1;H=waitbar(0,Please wait.);while(eranum

7、0,1 ,Pop-(Pop-Lb)./(Ub-Lb) end switch round(unifrnd(0,eranum/MaxEranum)%进化前期尽量使用实行锦标赛选择，后期逐步增大非线性排名选择 case 0 selectpop=TournamentSelect(Pop,fit,bits);%锦标赛选择 case 1 selectpop=NonlinearRankSelect(Pop,fit,bits);%非线性排名选择 end CrossOverPop=CrossOver(selectpop,pCross,OptsCrossOver(eranum,:);%交叉 MutationPop

8、=Mutation(CrossOverPop,fit,pMutation,VarNum,OptsMutation(eranum,:); %变异 InversionPop=Inversion(MutationPop,pInversion);%倒位 %更新种群 if options(1)=1 Pop=Lb+InversionPop.*(Ub-Lb);%还原Pop else Pop=InversionPop; end pMutation=pm0+(eranum3)*(pCross/2-pm0)/(eranum4); %逐步增大变异率至1/2交叉率 percent=num2str(round(100*

9、eranum/MaxEranum); waitbar(eranum/MaxEranum,H,Evolution complete ,percent,%); eranum=eranum+1;endclose(H);% 格式化输出进化结果和解的变化情况t=1:MaxEranum;plot(t,Trace,t,Meanfit);legend(解的变化,种群的变化);title(函数优化的遗传算法);xlabel(进化世代数);ylabel(每一代最优适应度);MaxFval,MaxFvalIn=max(Trace);if options(1)=1|options(1)=3 X=BestPop(Max

10、FvalIn,:);elseif options(1)=0 X=b2f(BestPop(MaxFvalIn,:),bounds,bits);endhold on; plot(MaxFvalIn,MaxFval,*);text(MaxFvalIn+5,MaxFval,FMAX= num2str(MaxFval);str1=sprintf( Best generation:n %dnn Best X:n %snn MaxFvaln %fn,. MaxFvalIn,num2str(X),MaxFval);disp(str1);% -计时T2=clock;elapsed_time=T2-T1;if e

11、lapsed_time(6)0 elapsed_time(6)=elapsed_time(6)+60; elapsed_time(5)=elapsed_time(5)-1;endif elapsed_time(5)1时,b(i)=mod(a(i-1)+a(i),2) %其中原二进制串:a(1)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 individualelse for i=1:popsize initpo

12、p(i,:)=randperm(numVars);%为Tsp问题初始化种群 endend% - 二进制串解码 -function fval = b2f(bval,bounds,bits)% fval - 表征各变量的十进制数% bval - 表征各变量的二进制编码串% bounds - 各变量的取值范围% bits - 各变量的二进制编码长度scale=(bounds(:,2)-bounds(:,1)./(2.bits-1); %The range of the variablesnumV=size(bounds,1);cs=0 cumsum(bits); for i=1:numV a=bva

13、l(cs(i)+1):cs(i+1); fval(i)=sum(2.(size(a,2)-1:-1:0).*a)*scale(i)+bounds(i,1);end% - 选择操作 -% 采用基于轮盘赌法的非线性排名选择% 各个体成员按适应值从大到小分配选择概率：% P(i)=(q/1-(1-q)n)*(1-q)i, 其中 P(0)P(1).P(n), sum(P(i)=1function NewPop=NonlinearRankSelect(OldPop,fit,bits)global m n NewPopfit=fit;selectprob=fit/sum(fit);%计算各个体相对适应度(

14、0,1)q=max(selectprob);%选择最优的概率x=zeros(m,2);x(:,1)=m:-1:1;y x(:,2)=sort(selectprob);r=q/(1-(1-q)m);%标准分布基值newfit(x(:,2)=r*(1-q).(x(:,1)-1);%生成选择概率newfit=0 cumsum(newfit);%计算各选择概率之和rNums=rand(m,1);newIn=1;while(newInnewfit),:); newIn=newIn+1;end% - 锦标赛选择(含精英选择) -function NewPop=TournamentSelect(OldPop

15、,fit,bits)global m n NewPopnum=floor(m./2.(1:10);num(find(num=0)=;L=length(num);a=sum(num);b=m-a;PopIn=1;while(PopIn1 NewPop(sum(num)+1):(sum(num)+b-1),:)=OldPop(unidrnd(m,1,b-1),:); end GlobalMaxfit,I=max(fit);%保留每一代中最佳个体 NewPop(end,:)=OldPop(I,:); % - 交叉操作 -function NewPop=CrossOver(OldPop,pCross,

16、opts)global m n NewPop r=rand(1,m);y1=find(r=pCross);len=length(y1);if len=1|(len2&mod(len,2)=1)%如果用来进行交叉的染色体的条数为奇数，将其调整为偶数 y2(length(y2)+1)=y1(len); y1(len)=;endi=0;if length(y1)=2 if opts(1)=1%浮点编码交叉 while(i1%discret crossover Points=sort(unidrnd(n,1,2); NewPop(y1(i+1),Points(1):Points(2)=OldPop(y

17、1(i+2),Points(1):Points(2); NewPop(y1(i+2),Points(1):Points(2)=OldPop(y1(i+1),Points(1):Points(2); elseif opts(2)=1%arithmetical crossover Points=round(unifrnd(0,pCross,1,n); CrossPoints=find(Points=1); r=rand(1,length(CrossPoints); NewPop(y1(i+1),CrossPoints)=r.*OldPop(y1(i+1),CrossPoints)+(1-r).*O

18、ldPop(y1(i+2),CrossPoints); NewPop(y1(i+2),CrossPoints)=r.*OldPop(y1(i+2),CrossPoints)+(1-r).*OldPop(y1(i+1),CrossPoints); else %AEA recombination Points=round(unifrnd(0,pCross,1,n); CrossPoints=find(Points=1); v=unidrnd(4,1,2); NewPop(y1(i+1),CrossPoints)=(floor(10v(1)*OldPop(y1(i+1),CrossPoints)+.

19、 10v(1)*OldPop(y1(i+2),CrossPoints)-floor(10v(1)*OldPop(y1(i+2),CrossPoints)/10v(1); NewPop(y1(i+2),CrossPoints)=(floor(10v(2)*OldPop(y1(i+2),CrossPoints)+. 10v(2)*OldPop(y1(i+1),CrossPoints)-floor(10v(2)*OldPop(y1(i+1),CrossPoints)/10v(2); end i=i+2; end elseif opts(1)=0%二进制编码交叉 while(i=length(y1)-

20、2) if opts(2)=0 NewPop(y1(i+1),:),NewPop(y1(i+2),:)=EqualCrossOver(OldPop(y1(i+1),:),OldPop(y1(i+2),:); else NewPop(y1(i+1),:),NewPop(y1(i+2),:)=MultiPointCross(OldPop(y1(i+1),:),OldPop(y1(i+2),:); end i=i+2; end else %Tsp问题次序杂交 for i=0:2:length(y1)-2 xPoints=sort(unidrnd(n,1,2); NewPop(y1(i+1) y1(i

21、+2),xPoints(1):xPoints(2)=OldPop(y1(i+2) y1(i+1),xPoints(1):xPoints(2); %NewPop(y1(i+2),xPoints(1):xPoints(2)=OldPop(y1(i+1),xPoints(1):xPoints(2); temp=OldPop(y1(i+1),xPoints(2)+1:n) OldPop(y1(i+1),1:xPoints(2); for del1i=xPoints(1):xPoints(2) temp(find(temp=OldPop(y1(i+2),del1i)=; end NewPop(y1(i+

22、1),(xPoints(2)+1):n)=temp(1:(n-xPoints(2); NewPop(y1(i+1),1:(xPoints(1)-1)=temp(n-xPoints(2)+1):end); temp=OldPop(y1(i+2),xPoints(2)+1:n) OldPop(y1(i+2),1:xPoints(2); for del2i=xPoints(1):xPoints(2) temp(find(temp=OldPop(y1(i+1),del2i)=; end NewPop(y1(i+2),(xPoints(2)+1):n)=temp(1:(n-xPoints(2); NewPop(y1(i+2),1:(xPoints(1)-1)=temp(n-xPoints(2)+1):end); end endendNewPop(y2