decode.m

采用遗传算法对于加工问题的排序,使其最快.

function [init,cc]=decode(a,machine_total,job_total,pop_size)
for m=1:pop_size
    for k=1:job_total*(ceil(log2(job_total))+1)
    x=rand;
        if x<a(m,k)^2
           c(:,k)=1;
        else 
           c(:,k)=0;
        end
    end
    cc(m,:)=c;
    C(c==1)='1';
    C(c==0)='0';
    D=reshape(C,ceil(log2(job_total))+1,job_total);
    DD=D';
    for i=1:job_total
        e(i,:)=bin2dec(DD(i,:));
    end
    ee=e';
    [xs,idx]=sort(ee);
    [ys,idy]=sort(idx);
    init(m,:)=idy;
end