int1.m

来自「本程序为遗传算法源程序」· M 代码 · 共 17 行

function [pop,ff]=INT1(num,bounds)
%[pop,ff]=INTinti(num,bounds)
%num      种群数
%bounds   边界约束

n=size(bounds,1);                    %矩阵bounds的行数,既每个样本子码数
L=bounds(:,2)-bounds(:,1);           %bounds(:,2)是边界最大值，bounds(:,1)边界最小
p=rand(num,n);
for i=1:num
    p(i,:)=p(i,:).*L'; 
    pop(i,:)= p(i,:)+bounds(:,1)';
    ff(i)=myfun(pop(i,:),size(bounds,1));
end