| 求解旅行商问题的整体优先算法 |
| |
| 引用本文： | 刘新刘任任侯经川. 求解旅行商问题的整体优先算法[J]. 计算机应用, 2007, 27(5): 1204-1207 |
| |
| 作者姓名： | 刘新刘任任侯经川 |
| |
| 作者单位： | 湘潭大学,信息工程学院,湖南,湘潭,411105;湘潭大学,管理学院,湖南,湘潭,411105 |
| |
| 基金项目： | 国家自然科学基金 , 湘潭大学科技计划项目 , 湘潭大学校科研和教改项目 |
| |
| 摘 要： | 针对欧几里德旅行商问题,提出了一种“整体优先”算法。该算法的基本思路是边构造边调整路径,在调整中采用了独创的逆向调整方法,避免算法陷入局部优化陷阱。理论分析和大量实验结果表明,该算法不仅时间复杂度和空间复杂度低,寻优能力也相当强,其综合性能超过目前的一些主流算法。
|
| 关 键 词： | 旅行商问题 整体优先算法 逆向调整 全局优化 |
| 文章编号： | 1001-9081（2007）05-1204-04 |
| 收稿时间： | 2006-10-30 |
| 修稿时间： | 2006-10-30 |
Whole-priority algorithm for traveling salesman problem |
| |
| LIU Xin,LIU Ren-ren,HOU Jing-chuan. Whole-priority algorithm for traveling salesman problem[J]. Journal of Computer Applications, 2007, 27(5): 1204-1207 |
| |
| Authors: | LIU Xin LIU Ren-ren HOU Jing-chuan |
| |
| Affiliation: | 1. College of Information Engineering, Xiangtan University, Xiangtan Hunan 411105, China; 2. School of Management, Xiangtan University, Xiangtan Hunan 411105, China |
| |
| Abstract: | To solve Euclid Traveling Salesman Problem(TSP),a new algorithm named wholepriority algorithm was proposed.The basic idea is "adjusting while constructing".During adjustment process,a creative method named reverse adjustment was adopted,to prevent the algorithm from being got in local optimization trap.Theoretical analysis and lots of experimental results indicate that the time complexity and space complexity of the algorithm are low,and its search-optimization ability is quite strong,whose comprehensive performance exceeds that of present major algorithms. |
| |
| Keywords: | Traveling Salesman Problem(TSP) whole-priority algorithm reverse adjustment global optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
