roulette.m

来自「研究多年的遗传算法代码!与大家共享!能实现最优化算法!」· M 代码 · 共 31 行

M
31
字号
function[newPop] = roulette(oldPop,options)
%roulette is the traditional selection function with the probability of
%surviving equal to the fittness of i / sum of the fittness of all individuals
%
%function[newPop] = roulette(oldPop,options)
%newPop  - the new population selected from the oldPop
%oldPop  - the current population
%options - options [gen]

%Get the parameters of the population
numVars = size(oldPop,2);
numSols = size(oldPop,1);

%Generate the relative probabilites of selection
totalFit = sum(oldPop(:,numVars));
prob=oldPop(:,numVars) / totalFit; 
prob=cumsum(prob);

rNums=sort(rand(numSols,1)); 		%Generate random numbers

%Select individuals from the oldPop to the new
fitIn=1;newIn=1;
while newIn<=numSols
  if(rNums(newIn)<prob(fitIn))
    newPop(newIn,:) = oldPop(fitIn,:);
    newIn = newIn+1;
  else
    fitIn = fitIn + 1;
  end
end

⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?