asexual_reproduction.m

遗传算法

clear;clc;

GAInitial;
fi(1,BOAT_NUM) = 0;
max(1,MAX_GEN) = 0;
GenerateBoat;

for g = 1:MAX_GEN
    
        PickLocation;
        PickIndividual;               
        A = L + range;
        PickIndividual;               
        B = L + range;
        C = Fitness(A,ROWER,boat);
        
        D = Fitness(B,ROWER,boat);
        
        if C > D
            parent1 = A;
        else parent1 = B;
        end
              
        As_Mutation;
        PickIndividual;
        replacement = L + range;
        for i = 1:ROWER
            boat(replacement,i) = child(1,i);
        end
        for n = 1:BOAT_NUM
            fi(1,n) = Fitness(n,ROWER,boat);
        end
        max(1,g) = fi(1,1);
        for n = 2:BOAT_NUM
            if fi(1,n) > max(1,g)
                max(1,g) = fi(1,n);
            end
        end

           
end
b = 1:MAX_GEN;
figure,plot(b,max);
xlabel('generation');
ylabel('the maximum fitness');
clear a;
clear i;