提出一种新的求解旅行商问题的混合遗传算法。该混合遗传算法充分利用2-opt和3-opt局部搜索能力,有效地弥补了具有较强全局搜索能力的遗传算法在局部搜索方面表现出来的缺陷。实验结果表明,该混合算法性能显著优于遗传算法。
In this paper, a new hybrid genetic algorithm is proposed for the traveling salesman problem. The hybrid algorithm takes full advantage of 2-opt and 3-opt algorithms to improve the ability of local search of the genetic algorithm. Case studies of the numerical simulations are given to demonstrate that the performance of the hybrid algorithm is significantly better than that of the genetic algorithm.