遗传算法求解函数最大值(matlab)

遗传算法求解函数F(x1，x2)=100 *(x1 2-x2)2(1-x1)2；的最大值(MATLAB)% generic algorithm for function f(x1，x2) optimal(最大值)Clear allClose all%ParametersSize=80G=100CodeL=10Umax=2.048uman=-2.048；e=round(rand(size，2 * codel)；%Initial Code% main程序For k=1:1:Gtime(k)=k；For s=1:1:SizeM=E(s，)；y1=0；y2=0；%Uncodingm1=m1=m(1:1: codel)；For i=1:1:CodeLy1=y1 m1(I)* 2(I-1)；Endx1=(umax-umin)* y1/1023 umin；m2=m(codel 1336013602 * codel)；For i=1:1:CodeLy2=y2 m2(I)* 2(I-1)；Endx2=(umax-umin)* y2/1023 umin；f(s)=100 *(x1 2-x2)2(1-x1)2；EndJi=1。/(F 1)；% * * * * step 1 : evaluate best j * * *BestJ(k)=min(Ji)；fi=F；%Fitness FunctionOderfi，index fi=sort(fi)；% arrangging fi small to biggerbestfi=oder fi(Size)；%Let Bestfi=max(fi)BestS=E(Indexfi(Size)，)；% let bests=e (m)，m is the index fi belong to max (fi)bfi(k)=best fi；% * * * * step 2 : select and re product operation * * *fi _ sum=sum(fi)；fi _ Size=(oder fi/fi _ sum)* Size；fi _ S=floor(fi _ Size)；%Selecting Bigger fi value(全部)kk=1；For i=1:1:Sizefor j=133601360 fi _ s(I)% select and reproduceTempe (kk，)=e(索引fi (I)，)；kk=kk 1；%kk is used to reproduceEndEnd% * * * * * * * step 3 3360 cross ver operation * * * * * * * * * *Pc=0.60n=ceil(20 * rand)；for Isize-1)Temp=randIf pctemp %Crossover ConditionFor j=n :136TempE(i，j)=E(i 1，j)；TempE(i 1，j)=E(i，j)；EndEndEndTempE(Size，)=BestS；E=TempE% * * * * * * * step 43360 mutation operation * * * * * * * * * * * * * * * * * * * *% pm=0.001% pm=0.001-133601360 size*(0.001)/size；%Bigger fi，smaller Pm% pm=0.0%No mutationPm=0.1%Big mutationFor i=1:1:SizeFor j=1:13602 * codelTemp=randIf pmtemp %Mutation ConditionIf TempE(i，j)=0TempE(i，j)=1；ElseTempE(i，j)=0；EndEndEndEnd% guarantee temppop (30，)is the code belong to the best individual(max(fi)TempE(Size，)=BestS；E=TempEEndMax_Value=Bestfi贝茨X1X2figure(1)；Plot(time，BestJ)；xlabel(Times)；ylabel(Best J)；figure(2)；Plot(时间，bfi)；xlabel(times)；ylab