基于改进蚁群算法的应急救援最优路径选择

Selection of Optimal Emergency Rescue Route Based on Improved Ant Colony Algorithm

蚁群算法最早成功应用于解决著名的旅行商问题(TSP),但基本蚁群算法在解决大型优化问题时,搜索时间长,易陷入局部最优解。针对基本蚁群算法的不足之处,对该算法的数学模型以及参数组合选择方法进行了改进研究,将改进后的蚁群算法应用于事故应急救援各受灾点救灾物资的配送问题中,取得了较好的运行结果。

Ant colony algorithm is first successfully applied to solve the famous traveling salesman problem （TSP）, but when using the basic ant colony algorithm to solve large - scale optimization problems, the search time is too long and it easily falls into local optimal solution. For these defieioncies of the basic ant colony algorithm, the mathematical model of this algorithm , as well as the methods of four parameters soleefion is improved. This improved ant colony algorithm is applied in seleefiou of optimal emergency rescue route among disaster area and distribution of relief supplies and better results have been achieved.