fitness.m

基本的粒子群算法十分清晰 便于理解 适合初学者学习应用

function result=fitness(x,D,n,m)

TC=[0.1,0.01,0.04,0.05,0.2,0.15,0.15,0.12,0.16,0.02];
PA=[0.1,0.01,0.04,0.05,0.2,0.15,0.15,0.12,0.16,0.02];
S=[0.1,0.01,0.04,0.05,0.2,0.15,0.15,0.12,0.16,0.02;
0.1,0.01,0.04,0.05,0.2,0.15,0.15,0.12,0.16,0.02;
0.1,0.01,0.04,0.05,0.2,0.15,0.15,0.12,0.16,0.02;
0.1,0.01,0.04,0.05,0.2,0.15,0.15,0.12,0.16,0.02;
0.1,0.01,0.04,0.05,0.2,0.15,0.15,0.12,0.16,0.02;
0.1,0.01,0.04,0.05,0.2,0.15,0.15,0.12,0.16,0.02;
0.1,0.01,0.04,0.05,0.2,0.15,0.15,0.12,0.16,0.02;
0.1,0.01,0.04,0.05,0.2,0.15,0.15,0.12,0.16,0.02;
0.1,0.01,0.04,0.05,0.2,0.15,0.15,0.12,0.16,0.02;
0.1,0.01,0.04,0.05,0.2,0.15,0.15,0.12,0.16,0.02]

sum=zeros(m);

for k=1:m
    for i=1:n
        sum(k)=sum(k)+TC(i)*S(i,k)/PA(k);
    end
end

min = sum(1);

for j=1:m;
    if(min>sum(j))
        min=sum(j);
    end
end

result=min;