asexual_reproduction.m

遗传算法

clear;clc;

GAInitial;

fi(1,BOAT_NUM) = 0;
maxFitnessEachRun(1,Run_Time) = 0;

for q = 1:Run_Time
    GenerateBoat;
    for k = 1:MAX_GEN
        As_Tournament_Best;
        As_Mutation;
        As_Tournament_Worst;
            for i = 1:ROWER
                boat(min,i) = boat(max,i);
            end        
            
          if k == MAX_GEN
            for n = 1:BOAT_NUM
                fi(1,n) = Fitness(n,ROWER,boat);
            end
            maxFitnessEachRun(1,q) = fi(1,1);
            for n = 2:BOAT_NUM
                 if maxFitnessEachRun(1,q) < fi(1,n)
                     maxFitnessEachRun(1,q) = fi(1,n);
                 end
            end
          end 
    end
end
a = 1:Run_Time;
  plot(a,maxFitnessEachRun);
  xlabel('running times');
  ylabel('the best fitness');
clear a;
clear i;