求解TSP和MTSP的混合遗传算法_英文_,Abstract:M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup cit ies and returns the same start ing city. The to tal length of all subtours is required to be m ini2 mum. Th is is called

Lin-Kernighan的R-Opt算法。主要思想是CLK，小规模的TSP可以在很短的时间内都到最优解。-Lin-Kernighan algorithm for the R-Opt. The main idea is CLK, small-scale TSP can be in a very short period of time have gone to the optimal solution.