| 基于MATLAB的混合型蚁群算法求解旅行商问题 |
| |
| 引用本文： | 尹晓峰,刘春煌.基于MATLAB的混合型蚁群算法求解旅行商问题[J].铁路计算机应用,2005,14(9):4-7. |
| |
| 作者姓名： | 尹晓峰 刘春煌 |
| |
| 作者单位： | 铁道科学研究院,电子计算技术研究所,北京,100081 |
| |
| 摘 要： | 蚁群算法是受自然界中蚁群搜索食物行为启发而提出的一种智能优化算法,通过介绍蚁群觅食过程中基于信息素的最短路径的搜索策略,给出基于MATLAB的蚁群算法在旅行商问题中的应用,针对蚁群算法存在的过早收敛问题,加入2-opt方法对问题求解进行局部优化.计算机仿真结果表明,这种混合型蚁群算法对求解旅行商问题有较好的改进效果.
|
| 关 键 词： | 旅行商问题 组合优化 蚁群算法 改进 |
| 文章编号： | 1005-8451(2005)09-0004-04 |
| 收稿时间： | 2005-01-06 |
| 修稿时间： | 2005年1月6日 |
Hybrid approach based on Ant Colony System for solving traveling salesman problem |
| |
| YIN Xiao-feng,LIU Chun-huang.Hybrid approach based on Ant Colony System for solving traveling salesman problem[J].Railway Computer Application,2005,14(9):4-7. |
| |
| Authors: | YIN Xiao-feng LIU Chun-huang |
| |
| Institution: | Institute of Computing Technology, China Academy of Railways Sciences, Beijing 100081, China |
| |
| Abstract: | Ant algorithms have been inspired by the behavior of real ant colonies, in particular, by their foraging behavlor. It was introduced the main idea of this distributed algorithm which was the indirect eommtminatinn of ants based on pheromone trails, proposed codes written in MATLAB. Computer simulation showd that apply a hybrid approach of ant algorithm with 2-opt could efficiently find better minimum beyond premature convergence for traveling salesman problem. |
| |
| Keywords: | traveling salesman problem combinatorial optimization ant colony algorithm improvement |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《铁路计算机应用》浏览原始摘要信息 |
| 点击此处可从《铁路计算机应用》下载免费的PDF全文 |
