| 求解TSP和MTSP的混合遗传算法 |
| |
| 引用本文： | 金升平.求解TSP和MTSP的混合遗传算法[J].武汉理工大学学报(交通科学与工程版),2002,26(6):839-842. |
| |
| 作者姓名： | 金升平 |
| |
| 作者单位： | 武汉理工大学理学院,武汉,430063 |
| |
| 摘 要： | 许多应用涉及多推销员问题（MTSP），已有许多启发式算法求解TSP的最优或近似最优路线，但研究MTSP的算法并不多，结合启发式算法和遗传算法，设计了求解TSP和MTSP的混合遗传算法，数字实例说明了该算法的有效性。
|
| 关 键 词： | TSP MTSP 混合遗传算法 推销员问题 最优化 遗传算法 逐次改进法 |
A Hybrid Genetic Algorithm to Solve TSP and MTSP |
| |
| Abstract.A Hybrid Genetic Algorithm to Solve TSP and MTSP[J].journal of wuhan university of technology(transportation science&engineering),2002,26(6):839-842. |
| |
| Authors: | Abstract |
| |
| Abstract: | Many applications are involved with multiple salesmen each of whom visits a subgroup cities and returns the same starting city. The total length of all subtours is required to be minimum. This is called Multiple Traveling Salesmen Problem (MTSP). There are various heuristic methods to obtain optimal or near-optimal solutions for the TSP problem. But to the Multiple Traveling Salesmen Problem, there are not much approaches to solve MTSP. In this paper, a hybrid genetic algorithm to solve TSP and MTSP is presented. This algorithm combines GA and heuristics. Numerical experiments show that the new algorithm is very efficient and effective. |
| |
| Keywords: | TSP optimization genetic algorithm 2opt |
| 本文献已被 维普 万方数据 等数据库收录！ |
