基于MATLAB的混合型蚁群算法求解旅行商问题  

Hybrid approach based on Ant Colony System for solving traveling salesman problem

作　　者：尹晓峰[1] 刘春煌[1] 

机构地区：[1]铁道科学研究院电子计算技术研究所,北京100081

出　　处：《铁路计算机应用》2005年第9期4-7,共4页Railway Computer Application

摘　　要：蚁群算法是受自然界中蚁群搜索食物行为启发而提出的一种智能优化算法,通过介绍蚁群觅食过程中基于信息素的最短路径的搜索策略,给出基于MATLAB的蚁群算法在旅行商问题中的应用,针对蚁群算法存在的过早收敛问题,加入2-opt方法对问题求解进行局部优化。计算机仿真结果表明,这种混合型蚁群算法对求解旅行商问题有较好的改进效果。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.

关 键 词：旅行商问题 组合优化 蚁群算法 改进 

分 类 号：U29-39[交通运输工程—交通运输规划与管理]