main.m

来自「GA for single machin problem」· M 代码 · 共 64 行

clc
clear 

load sample4

tic

CR=input('Enter the Crossover rate [0-1]\n');
MR=input('Enter the Mutation rate [0-1]\n');
N=input('Enter the number of Iteration\n');

%k=number of jobs
PS=round(k/2);

pop=init(PS,k);

n=1;

while n<=N 
    
    eng=energy(k,s,A,sj,pop);
    %!!!!!!!!!!
    
    Lbfit(n)= ??????
    Lbsol(n)=????????
    
    newpop=roulette( pop,eng );
    cr_newpop = cross(CR,newpop);
    mu_newpop = mut(MR,cr_newpop);

    n=n+1;
    pop=mu_newpop;
end

Iteration=n-1
Time=toc
hold off
%bestsol=Lbsol(find(bestfit(n-1)==min(bestfit(n-1))),:);
Gbfit= ??????;%%maxinum Lbfit
Gbsol= ?????;%%Lbsol coresponding to Gbfit

uppers=Lbfit(:,3);
middles=Lbfit(:,2);
lowers=Lbfit(:,1);

%%%OUTPUTS
plot(uppers,'R'),hold on
plot(middles,'B'),hold on
plot(lowers,'G'),hold on
xlabel('generation')
ylabel('Makespan')
legend('upper number','middle number', 'lower number')
OptimalMakespan=Gbfit
DefuzzifiedGbfit=???
Optimalsolution=decoderesp(s,sj,Gbsol)
Jobsequences=Gbsol