| 基于蚂蚁算法的混合方法求解旅行商问题 |
| |
| 引用本文： | 黄岚,王康平,周春光,原媛,庞巍. 基于蚂蚁算法的混合方法求解旅行商问题[J]. 吉林大学学报(理学版), 2002, 40(4): 369-373 |
| |
| 作者姓名： | 黄岚 王康平 周春光 原媛 庞巍 |
| |
| 作者单位： | 吉林大学计算机科学与技术学院,长春,130012 |
| |
| 基金项目： | 国家自然科学基金(批准号:60175024),教育部"符号计算与知识工程"重点实验室资助基金. |
| |
| 摘 要： | 通过介绍蚂蚁觅食过程中最短路径的搜索策略,给出蚂蚁算法在旅行商问题中的应用,并加入3-opt方法和去交叉策略对问题求解进行局部优化.实验结果证明了其有效性.
|
| 关 键 词： | 蚂蚁算法 旅行商问题 组合优化 |
| 文章编号： | 1671-5489(2002)04-0369-05 |
| 收稿时间： | 2002-04-19 |
| 修稿时间： | 2002-04-19 |
Hybrid Approach Based on Ant Algorithm for Solving Traveling Salesman Problem |
| |
| HUANG Lan,WANG Kang-ping,ZHOU Chun-guang,YUAN Yuan,PANG Wei. Hybrid Approach Based on Ant Algorithm for Solving Traveling Salesman Problem[J]. Journal of Jilin University: Sci Ed, 2002, 40(4): 369-373 |
| |
| Authors: | HUANG Lan WANG Kang-ping ZHOU Chun-guang YUAN Yuan PANG Wei |
| |
| Affiliation: | College of Computer Science and Technology , Jilin University , Changchun 130012 , China |
| |
| Abstract: | In the present paper the authors introduce an ant algorithm , a distributed algorithm for the solution of combinatorial optimization problems which has been inspired by the observation of real colonies of ants. Then the authors apply a hybrid approach of ant algorithm with 3-opt and cross-removing to the traveling salesman problem (TSP). The results show that it is able to find good solutions quickly. |
| |
| Keywords: | ant algorithm traveling salesman problem combinatorial optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息 |
|
点击此处可从《吉林大学学报(理学版)》下载全文 |
