value.asv

来自「解决背包问题 自动求解最大价值 利益最大化问题」· ASV 代码 · 共 28 行

function [pop,d]=value(p)
[row,column]=size(p);
m=coords(p);
mid=zeros(1,row);
for i=1:row
    for j=1:column-1
        mid(i)=mid(i)+sqrt((m(i,2*j-1)-m(i,2*j+1))^2+(m(i,2*j)-m(i,2*j+2))^2);
    end
    mid(i)=mid(i)+sqrt((m(i,1)-m(i,71))^2+(m(i,2)-m(i,72))^2);
end
mid
for j=1:row-1
    for i=1:row-j
        if mid(i)<mid(i+1)
            mit=m(i+1);
            mid(i+1)=mid(i);
            mid(i)=mit;
            
            mitt=p(i+1,:);
            p(i+1,:)=p(i,:);
            p(i,:)=mitt;
        end
    end
    mid
    
end
pop=p;
d=mid;