管道铺设问题的改进蚁群算法

Solving pipe laying problem with improving ant colony algorithm

首先把管道铺设问题转化为旅行商问题,然后利用蚁群算法来求解此问题。算法的分析和仿真实验表明,利用了城市间距离信息的改进蚁群算法是一种简单有效的算法。

Pipe laying problem is translated into traveling salesman problem(TSP)firstly,then the Ant Colony Algorithm(ACA) is used to solve the TSP.By analysis and simulation,it is proved that improving Ant Colony Algorithm,which makes use of the information of distance between cities,is a simple and effective algorithm.