createpopulation.m

来自「遗传算法在路由优化中的应用:多服务质量的最小路径的算法.」· M 代码 · 共 26 行

function [codeRodeList,codeLength,population]=createPopulation(populationNum,vs,vd,tuoputu)

n=size(tuoputu,1);  % n为网络中的结点数
k=1;
for i=1:n
    for j=1:n
         if (tuoputu{i,j}~=0) 
               codeRodeList{1,k}=[i,j]; % codeRodeList为编码链路列表
               k=k+1;
               if (i==vd)|(j==vs) % 去掉业务量流入了源节点或流出了目的节点的链路,
                   k=k-1;
               end
         end
     end
end 
codeRodeList{1,1}=[1,6];
codeRodeList{1,2}=[1,2];

codeLength=k-1;   % codeLength为编码长度
population=round(rand(populationNum,codeLength));  % population为随机产生的初始群体
%population(1,:)=[1 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ];
%population(2,:)=[0 1 1 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 ];
%population(3,:)=[1 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ];