论文标题
遗传算法中的组合跨界运营商的新机制用于解决旅行推销员问题
New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem
论文作者
论文摘要
旅行推销员问题（TSP）在计算领域是众所周知的。有许多研究可以改善用于解决TSP的遗传算法。在本文中，我们提出了两个新的跨界运算符和新型跨界算法的机制，用于求解TSP的遗传算法。我们在TSP-LIB的TSP实例上进行了实验，并将所提出的算法的结果与使用MSCX的遗传算法（GA）进行了比较。实验结果表明，我们提出的算法在最小值中使用MSCX（平均成本值）优于GA。
Traveling salesman problem (TSP) is a well-known in computing field. There are many researches to improve the genetic algorithm for solving TSP. In this paper, we propose two new crossover operators and new mechanism of combination crossover operators in genetic algorithm for solving TSP. We experimented on TSP instances from TSP-Lib and compared the results of proposed algorithm with genetic algorithm (GA), which used MSCX. Experimental results show that, our proposed algorithm is better than the GA using MSCX on the min, mean cost values.
