|
|||||
|
|
| 多旅行商问题研究综述 | |
| 引用本文： | 俞庆生,林冬梅,王东. 多旅行商问题研究综述[J]. 价值工程, 2012, 31(2): 166-168 |
| 作者姓名： | 俞庆生 林冬梅 王东 |
| 作者单位： | 1. 佛山职业技术学院,佛山,528137 2. 佛山科学技术学院信息与教育技术中心,佛山,528137 3. 佛山科学技术学院,佛山,528137 |
| 基金项目： | 广东省科技计划项目，广东省自然科学基金 |
| 摘 要： | 多旅行商问题是经典旅行商问题的一种泛化,加上某些特定的附加条件,则能够演化成一些较现实的问题,因而具有较高的理论研究和应用价值。在多旅行商问题中,一个任务由多位旅行商共同完成,其问题的求解难度较经典旅行商问题更大,用于经典旅行商问题求解的方法或策略不能简单地应用于多旅行商问题的求解,有关该问题的研究成果远比经典旅行商问题少,本文针对目前有关多旅行商问题的研究进展情况进行综述。 |
| 关 键 词： | 多旅行商问题 精确计算 启发式算法 元启发式算法 |
An Overview of Multiple Traveling Salesman Problem |
|
| Yu Qingsheng , Lin Dongmei , Wang Dong. An Overview of Multiple Traveling Salesman Problem[J]. Value Engineering, 2012, 31(2): 166-168 | |
| Authors: | Yu Qingsheng Lin Dongmei Wang Dong |
| Affiliation: | ① Yu Qingsheng;② Lin Dongmei;③ Wang Dong(①Foshan Polytechnic,Foshan 528137,China;②Center of Information and Education Technology,Foshan University,Foshan 528137,China; ③Foshan University,Foshan 528137,China) |
| Abstract: | Multiple traveling salesman problem is a generalization of classic traveling salesman problem.It could be converted to real problems while appending some specific constraints,so the problem has high value of the theoretical research and application.A task will be completed by multiple traveling salesman together in multiple traveling salesman problem,therefore the problem is more difficult than the classic one.Those methods or strategies used to the classic one could not be applied to the problem after being updated simply.The achievements for the problem are less than the classic one.In this paper,the research progress of the problem will be overviewed. |
| Keywords: | multiple traveling salesman problem exact algorithm heuristic algorithm meta-heuristic algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ | |