Searching optimal rush repair path of power lines based on improved max-min ant colony algorithm
基于改进的最大最小蚁群算法求解电力线路最佳抢修路径

The optimal rush repair path of power lines is a traffic road which costs the least time from the location of materials to location of fault. The max-min ant colony algorithm improved the premature stagnation brought by the basic ant colony algorithm, is suitable for solving large-scale problem. However, it still had some shortcomings such as slowly convergence rate and the poor quality of results. Based on the shortcoming of the max-min ant colony algorithm, this paper proposed an improved max-min ant colony algorithm to solve the optimal rush repair path. Segmented function for choosing state transition rule was introduced in the improved algorithm, as well as noising method for local search and the variation thought and A* algorithm for generating the neighborhood of the current solution. The simulation tests prove that the improved max-min ant colony is superior to any other improved ant colony algorithm in solving the optimal rush repair path of power lines, and analyze the impact of parameters in noising method on quality of solution.