clc;clear
%% 下載數(shù)據(jù)
% 加工數(shù)據(jù)包括加工時間，加工機器，機器數(shù)，各機器權(quán)重，工件數(shù)，各工件對應(yīng)的工序數(shù)
load data operation_time operation_machine num_machine machine_weight num_job num_op

%% 基本參數(shù)
MAXGEN = 200;               % 最大迭代次數(shù)
Ps = 0.8;                   % 選擇率
Pc = 0.7;                   % 交叉率
Pm = 0.3;                   % 變異率
sizepop = 200;              % 個體數(shù)目
e = 0.5;                    % 目標值權(quán)重
trace = zeros(2,MAXGEN);

%% ===========================種群初始化============================
total_op_num=sum(num_op);
chroms=initialization(num_op,num_job,total_op_num,sizepop,operation_machine,operation_time);
[Z,~,~]=fitness(chroms,num_machine,e,num_job,num_op);

%% ============================迭代過程=============================
for gen=1:MAXGEN
    fprintf('當前迭代次數(shù)：'),disp(gen)
    % 輪盤賭選擇
    chroms_new=selection(chroms,Z,Ps);
    % 交叉操作
    chroms_new=crossover(chroms_new,Pc,total_op_num,num_job,num_op);
    % 變異操作
    chroms_new=mutation(chroms_new,total_op_num,Pm,num_machine,e,num_job,num_op,operation_machine,operation_time);
    % 計算選擇交叉變異后個體的適應(yīng)度
    [Z_new,~,~]=fitness(chroms_new,num_machine,e,num_job,num_op);
    % 根據(jù)適應(yīng)度在原種群和遺傳操作后的種群中選出sizepop個更優(yōu)個體
    [chroms,Z,chrom_best]=update_chroms(chroms,chroms_new,Z,Z_new,sizepop);
    % 記錄每代的最優(yōu)適應(yīng)度與平均適應(yīng)度
    trace(1, gen)=Z(1);       
    trace(2, gen)=mean(Z);  
    % 更新全局最優(yōu)適應(yīng)度
    if gen==1 || MinVal>trace(1,gen)
        MinVal=trace(1,gen);
function [Z,machine_weight,pvals] = fitness(chroms,num_machine,e,num_job,num_op)
sizepop=size(chroms,1);
pvals=cell(1,sizepop);
Z1=zeros(1,sizepop);
Z2=Z1;
total_op_num=sum(num_op);  % 總工序數(shù)
for k=1:sizepop
    chrom=chroms(k,:);
    machine=zeros(1,num_machine);  % 記錄各機器變化時間
    job=zeros(1,num_job);  % 記錄各工件變化時間
    machine_time=zeros(1,num_machine);  % 計算各機器的實際加工時間
    pval=zeros(2,total_op_num);  % 記錄各工序開始和結(jié)束時間
    for i=1:total_op_num
        % 機器時間大于工件時間
        if machine(chrom(total_op_num+i))>=job(chrom(i))
            pval(1,i)=machine(chrom(total_op_num+i));  % 記錄工件開始時間
            machine(chrom(total_op_num+i))=machine(chrom(total_op_num+i))+chrom(total_op_num*2+i);
            job(chrom(i))=machine(chrom(total_op_num+i));
            pval(2,i)=machine(chrom(total_op_num+i));  % 記錄工件結(jié)束時間
            % 機器時間小于工件時間
        else
            pval(1,i)=job(chrom(i));
            job(chrom(i))=job(chrom(i))+chrom(total_op_num*2+i);
            machine(chrom(total_op_num+i))=job(chrom(i));
            pval(2,i)=job(chrom(i));
        end
        machine_time(chrom(total_op_num+i))=machine_time(chrom(total_op_num+i))+chrom(total_op_num*2+i);
    end
    Z1(k)=max(machine);  % 最大機器時間值，對應(yīng)makespan
    % machine_weight=machine_time/sum(machine_time);  % 計算各機器的負荷
    machine_weight=machine_time;
    Z2(k)=max(machine_weight)-min(machine_weight);
    pvals{k}=pval;
end
% min_makespan=min(Z1);%所有染色體的makespan最優(yōu)值
% max_makespan=max(Z1);
% min_weight=min(Z2);%負載最優(yōu)值
% max_weight=max(Z2);
% Z=e*((Z1-min_makespan)./(max_makespan-min_makespan))+(1-e)*((Z2-min_weight)./(max_weight-min_weight));%計算適應(yīng)度
Z=e*Z1+(1-e)*Z2;

function [ chroms_new] = crossover(chroms,Pc,total_op_num,num_job,num_op)
size_chrom=size(chroms,1);  % 染色體數(shù)
chroms_new=chroms;
%% 面向工序碼的交叉操作
for i=1:2:size_chrom-1 
    if Pc>rand
        % 父代染色體
        parent1=chroms(i,:);
        parent2=chroms(i+1,:);
        Job=randperm(num_job);
        % 將工件隨機分成兩個集合
        J1=Job(1:round(num_job/2));
        J2=Job(length(J1)+1:end);
        % 子代染色體
        child1=parent1;
        child2=parent2;
        op_p1=[];
        op_p2=[];
        for j=1:length(J2)
            %找出父代中J2片段對應(yīng)的位置
            op_p1=[op_p1,find(parent1(1:total_op_num)==J2(j))];
            op_p2=[op_p2,find(parent2(1:total_op_num)==J2(j))];
        end
        op_s1=sort(op_p1);
        op_s2=sort(op_p2);
        % 子代1交換J2片段的基因，機器碼對應(yīng)位置的基因，工時碼對應(yīng)位置的基因
        child1(op_s1)=parent2(op_s2);
        child1(total_op_num+op_s1)=parent2(total_op_num+op_s2);
        child1(total_op_num*2+op_s1)=parent2(total_op_num*2+op_s2);
        % 子代2同理
        child2(op_s2)=parent1(op_s1);
        child2(total_op_num+op_s2)=parent1(total_op_num+op_s1);
        child2(total_op_num*2+op_s2)=parent1(total_op_num*2+op_s1);
        chroms_new(i,:)=child1;
        chroms_new(i+1,:)=child2;
    end
end
%% 面向機器碼的交叉操作
for k=1:2:size_chrom-1
    if Pc>rand
        parent1=chroms_new(k,:);
        parent2=chroms_new(k+1,:);
        child1=parent1;
        child2=parent2;
        % 隨機產(chǎn)生與染色體長度相等的0,1序列
        rand0_1=randi([0,1],1,total_op_num);
        for n=1:num_job
            ind_0=find(rand0_1(num_op(n)*(n-1)+1:num_op(n)*n)==0);
            if ~isempty(ind_0)
                temp1=find(parent1(1:total_op_num)==n);
                temp2=find(parent2(1:total_op_num)==n);
                child1(total_op_num+temp1(ind_0))=parent2(total_op_num+temp2(ind_0));
                child2(total_op_num+temp2(ind_0))=parent1(total_op_num+temp1(ind_0));
                child1(total_op_num*2+temp1(ind_0))=parent2(total_op_num*2+temp2(ind_0));
                child2(total_op_num*2+temp2(ind_0))=parent1(total_op_num*2+temp1(ind_0));
            end
        end
        chroms_new(k,:)=child1;
        chroms_new(k+1,:)=child2;
    end
end
end