qcompeteselect.asv

经典遗传算法

%选择算子
%f为适应度, q为选择参数
function y=qCompeteSelect(f,n)
m=size(f,1);
q=floor(m/2);
number=zeros(m,1);
%for i=1:m
%    r=randperm(m);
%    number(i)=sum(f(i)>f(r(1:q)));
%end
r=floor(m*rand(m,q))+1;
sum(f(:,ones(1,q))>f(r));
[ans,index]=sort(number);
y=index(m-n+1:end);