基于改进鱼群算法在管道最优抢修路径的研究

Study of the Optimal Maintenance Path Based on Improved Artificial Fish Swarm Algorithm in Pipeline

当油气管道发生安全事故时,为保证在最短的时间内达到事故现场,需选择最优的抢维修路径。文中提出了一种新型的最优路径计算方法——鱼群算法,并针对其在搜索空间、收敛性以及寻求最优解等方面存在的不足,提出了改进鱼群算法。结合实际工程案例,对鱼群算法和改进鱼群算法在相同循环次数下寻求最短路径做了对比,结果显示改进的鱼群算法成功率高、收敛快,具有一定的应用价值。

In the pipeline safety accidents, choosing the best repair path of rob can ensure the first-aid repair equipment and personnel in the first time arrived on the scene of an accident, in order to minimize the loss caused by accidents. Now the optimal path calculation method is a lot, but many of the algorithms have shortcomings, so this paper provides an optimal path calculation method--fish swarm algorithm. This artificial fish-swarm algorithm cannot make it easy to enlarge the search space,but makes it easy to fall into a local optimal solution. By aiming at the disadvantages, an improved artificial fish-swarm algorithm based on the actual situation was proposed. The algorithm has a faster speed in convergence and than the fish swarm algorithm,more capable of finding a global optimal solution. Through case analyses, this method has certain feasibility.