| 求解TSP问题的拟人算法 |
| |
| 引用本文： | 吴军,李建,胡永泉.求解TSP问题的拟人算法[J].计算机系统应用,2011,20(4):248-250,244. |
| |
| 作者姓名： | 吴军 李建 胡永泉 |
| |
| 作者单位： | 西南石油大学,计算机科学学院,成都,610500 |
| |
| 摘 要： | 基于贪心算法提出了一种改进的求解旅行商问题(TSP)的拟人算法.该算法采用邻域定义,主要思想是:给定一个所有城市的全排列,依此全排列的指挥用贪心算法生成一个回路.通过城市交换和城市序列平移,在当前的邻域中搜索比它更好的解,如能找到如此的解,则使之成为新的当前解,然后重复上述过程.在搜索的过程中,采取跳坑策略以跳出局部最...
|
| 关 键 词： | 旅行商问题 拟人算法 邻域搜索 子序列平移 跳坑策略 |
| 收稿时间： | 2010/7/29 0:00:00 |
| 修稿时间： | 2010/9/10 0:00:00 |
Personification Algorithm for Traveling Salesman Problem |
| |
| WU Jun,LI Jian and HU Yong-Quan.Personification Algorithm for Traveling Salesman Problem[J].Computer Systems& Applications,2011,20(4):248-250,244. |
| |
| Authors: | WU Jun LI Jian and HU Yong-Quan |
| |
| Affiliation: | WU Jun,LI Jian,HU Yong-Quan(School of Computer Science,Southwest Petroleum University of China,Chengdu 610500,China) |
| |
| Abstract: | In this paper,a personification algorithm for solving the Traveling Salesman Problem(TSP) is proposed,which is based on original greedy algorithm.The algorithm adopts neighborhood definition,the main idea is that to give a full array of all cities,and so full array of command to generate a loop with a greedy algorithm.Through the city exchange and Sub-sequence migration,it generates a better solution in the current neighborhood search.If the solution is found,it becomes the new current solution.Then,repeat ... |
| |
| Keywords: | TSP personification algorithm local search sub-sequence migration off-trap strategy |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机系统应用》浏览原始摘要信息 |
|
点击此处可从《计算机系统应用》下载全文 |
|
