keepbest.m

来自「一个一群算法求解TSP问题的很好的粒子」· M 代码 · 共 39 行

%保优函数
%==================================
%第一种群保优
min_dis=min(adapt_A(:));

if min_dis<everbest_A
    min_pos=find(min_dis==adapt_A(:));
    best_individual_A=tobu_A(min_pos,:);
    everbest_A=min_dis;
end

adapt_best_A(G)=everbest_A;


%==================================
%第二种群保优
min_dis=min(adapt_B(:));

if min_dis<everbest_B
    min_pos=find(min_dis==adapt_B(:));
    best_individual_B=tobu_B(min_pos,:);
    everbest_B=min_dis;
end

adapt_best_B(G)=everbest_B;

if everbest_A<everbest_B
    everbest=everbest_A;
    best_individual=best_individual_A;
else
    everbest=everbest_B;
    best_individual=best_individual_B;
end

if adapt_best_A(G)<adapt_best_B(G)
    adapt_best(G)=adapt_best_A(G);
else
    adapt_best(G)=adapt_best_B(G);
end