cross.m

用简单遗传算法SGA实现的关于控制图的程序

function ret=Cross(pcross,lenchrom,chrom,sizepop,opts,pop)
% In this function,it fulfils a crossover among chromosomes
% pcorss    input  : probability of crossover
% lenchrom  input  : length of a chromosome
% chrom     input  : set of all chromosomes
% sizepop   input  : size of population
% opts      input  : tag for choosing method of crossover
% pop       input  : current serial number of generation and maximum gemeration
% ret       output : new set of chromosome
switch opts
    case 'simple'  % cross at single position
        for i=1:sizepop
            % select two children at random
            pick=rand(1,2);
            index=ceil(pick.*sizepop);
            while prod(pick)==0 | index(1)==index(2)
                pick=rand(1,2);
                index=ceil(pick.*sizepop);
            end
            % probability of crossover
            pick=rand;
            if pick>pcross
                continue;
            end
            % random position of crossover
            pick=rand;
            while pick==0
                pick=rand;
            end
            pos=ceil(pick.*sum(lenchrom));
            tail1=bitand(chrom(index(1)),2.^pos-1);
            tail2=bitand(chrom(index(2)),2.^pos-1);
            chrom(index(1))=chrom(index(1))-tail1+tail2;
            chrom(index(2))=chrom(index(2))-tail2+tail1;
        end
        ret=chrom;
    case 'uniform' % uniform cross
        for i=1:sizepop
            % select two children at random
            pick=rand(1,2);
            while prod(pick)==0
                pick=rand(1,2);
            end
            index=ceil(pick.*sizepop);
            % random position of crossover
            pick=rand;
            while pick==0
                pick=rand;
            end
            if pick>pcross
                continue;
            end
            % random position of crossover
            pick=rand;
            while pick==0
                pick=rand;
            end
            mask=2^ceil(pick*sum(lenchrom));
            chrom1=chrom(index(1));
            chrom2=chrom(index(2));
            for j=1:sum(lenchrom)
                v=bitget(mask,j);  % from lower  to higher bit
                if v==1
                    chrom1=bitset(chrom1,...
                        j,bitget(chrom(index(2)),j));
                    chrom2=bitset(chrom2,...
                        j,bitget(chrom(index(1)),j));
                end
            end
            chrom(index(1))=chrom1;
            chrom(index(2))=chrom2;
        end
        ret=chrom;
    case 'float'
        for i=1:sizepop
            flag=1;
            while(flag)
                % select two children at random
                pick=rand(1,2);
                while prod(pick)==0
                    pick=rand(1,2);
                end
                index=ceil(pick.*sizepop);
                % random position of crossover
                pick=rand;
                while pick==0
                    pick=rand;
                end
                if pick>pcross
                    continue;
                end
                % random position of crossover
                pick=rand;
                while pick==0
                    pick=rand;
                end
                pos=ceil(pick.*sum(lenchrom));
                pick=rand;
                v1=chrom(index(1),pos);
                v2=chrom(index(2),pos);
                nv1=pick*v2+(1-pick)*v1;
                nv2=pick*v1+(1-pick)*v2;
                chrom1=chrom(index(1),:);
                chrom2=chrom(index(2),:);
                chrom1(pos)=nv1;
                chrom2(pos)=nv2;
                if tiaojian(chrom1)&&tiaojian(chrom1)  % 判断交叉产生的参数是否符合条件
                    chrom(index(1),pos)=nv1;
                    chrom(index(2),pos)=nv2;
                    flag=0;
                end
            end
        end
        ret=chrom;
        ret(:,1)=fix(ret(:,1));
end