一种改进的蚁群算法求解最短路径问题  

An Improved Ant Colony Algorithm for the Shortest Path Problem

作　　者：毕军[1] 付梦印[1] 张宇河[1] 

机构地区：[1]北京理工大学自动控制系,北京100081

出　　处：《计算机工程与应用》2003年第3期107-109,共3页Computer Engineering and Applications

摘　　要：蚁群算法是一种新型的模拟进化算法,为求解复杂的组合优化问题提供了一种新的思路。该文应用蚁群算法求解最短路径问题,对算法的选择策略、局部搜索、信息量修改三方面进行改进,使算法不易陷入局部最优解,并且能较快地收敛到全局最优解。实验结果表明,改进方法是合理的、有效的。Ant colony system is a novel simulated evolutionary algorithm,which provides a new method for complicated combinatorial optimization problems.The algorithm is used for the shortest path problem.It is improved in three parts of selection strategy,local search,and information modification,so that it can not easily run into the local optimum and can converge at the global optimum.The results of experiment show that the improved algorithm is valid.

关 键 词：蚁群算法 最短路径问题 模拟进化算法 组合优化问题 随机搜索算法 计算机 

分 类 号：O224[理学—运筹学与控制论] TP301.6[理学—数学]