evalf_f.m

遗传算法的实型表示实现

function [result,P]=evalF_f(gr,n,upbound,downbound)
[m,n]=size(gr);
for i=1:m
tmp_dec=gr(i,:);
%question 1
    result(i)=sum(tmp_dec.^2);
%question 2
%    result(i)=100*(tmp_dec(1)^2-tmp_dec(2))^2+(1-tmp_dec(1))^2;
%question 3
%   result(i)=sum(fix(tmp_dec));
%question 4
%   result(i)=4+tmp_dec(1)^2+tmp_dec(2)^2-8*cos(2*pi*tmp_dec(1))-8*cos(2*pi*tmp_dec(2));
end
if min(result)<=0
tmp_result=1./(result-min(result)+1);
else
tmp_result=1./result;
end
P=tmp_result./sum(tmp_result);