keepbest.m

用于解决TSP问题的蚁群算法

%保优函数

min_dis=min(adapt(:));

if min_dis<everbest
    min_pos=find(min_dis==adapt(:));
    best_individual=tobu(min_pos,:);
    everbest=min_dis;
end

adapt_best(G)=everbest;