(完整版)遺傳算法求解函數(shù)最大值(matlab)

1、遺傳算法求解函數(shù)F(x1,x2)=100*(xL2-x2廠2+(1-x1廠2;的最大值(MATLAB)%GenericAlgorithmforfunctionf(x1,x2)optimum(最大值)clearall;closeall;%ParametersSize=80;G=100;CodeL=10;umax=2.048;umin=-2.048;E=round(rand(Size,2*CodeL);%InitialCode%MainProgramfork=1:1:Gtime(k)=k;fors=1:1:Sizem=E(s,:);y1=0;y2=0;%Uncodingm1=m(1:1:CodeL

2、);fori=1:1:CodeLyl=yl+ml(i)*2人(i-1);endxl=(umax-umin)*yl/l023+umin;m2=m(CodeL+l:l:2*CodeL);fori=l:l:CodeLy2=y2+m2(i)*2A(i-1);endx2=(umax-umin)*y2/1023+umin;F(s)=100*(x1A2-x2)A2+(1-x1)A2;endJi=1./(F+1);%*Step1:EvaluateBestJ*BestJ(k)=min(Ji);fi=F;%FitnessFunctionOderfi,Indexfi=sort(fi);Bestfi=Oderfi(S

3、ize);BestS=E(Indexfi(Size),:);max(fi)%Arrangingfismalltobigger%LetBestfi=max(fi)%LetBestS=E(m),mistheIndexfibelongtobfi(k)=Bestfi;%*Step2:SelectandReproductOperation*fi_sum=sum(fi);fi_Size=(Oderfi/fi_sum)*Size;fi_S=floor(fi_Size);%SelectingBiggerfivalue(取整)kk=1;fori=1:1:Sizeforj=1:1:fi_S(i)%Selectan

4、dReproduceTempE(kk,:)=E(Indexfi(i),:);kk=kk+1;endend%kkisusedtoreproduce%*Step3:CrossoverOperation*pc=0.60;n=ceil(20*rand);fori=1:2:(Size-1)temp=rand;ifpctemp%CrossoverConditionforj=n:1:20TempE(i,j)=E(i+1,j);TempE(i+1,j)=E(i,j);endendendTempE(Size,:)=BestS;E=TempE;%*Step4:MutationOperation*%pm=0.001

5、;%pm=0.001-1:1:Size*(0.001)/Size;%Biggerfi,smallerPm%pm=0.0;%Nomutationpm=0.1;%Bigmutationfori=1:1:Sizeforj=1:1:2*CodeLtemp=rand;%MutationConditionifTempE(i,j)=0TempE(i,j)=1;elseTempE(i,j)=0;endendendend%GuaranteeTempPop(30,:)isthecodebelongtothebestindividual(max(fi)TempE(Size,:)=BestS;E=TempE;endMax_Value=BestfiBestSx1x2figure(1);plot(time,BestJ);xlabel(Times);ylabel(BestJ);figure(2);plot(time,bfi);xlabel(times);ylabel(BestF);轐行絨果口H104444.2 I43.8 -3.6 343.2 -32.8 -2.6 -:a102D3040GO7D9D1DDTimes-4104.4i1iiiiii4.243.B3.63.43.232.82.6iiiiiiii