考虑通行时间的大量变电站巡视路径两阶段规划

Two Stage Planning of Patrol Routes for a Large Number of Substations Considering Traffic Time

大量变电站站间巡视路径受地理条件和交通拥堵影响较大,针对其巡视路径规划问题,考虑实际工作场景先划分巡视范围给各个巡视小组,同时巡视路径应充分考虑通行时间的影响,建立了巡视范围划分模型和巡视线路模型,采用两阶段规划求解最优巡视路径。第一阶段基于通行时间最短采用改进K-Means算法将大量变电站划分给各个巡视小组,第二阶段对各个巡视小组的变电站基于多起点贪心算法生成最优巡视路径,并提出了提升算法寻优能力和效率的措施。算例结果表明所提算法具有较好的收敛性和寻优能力,以通行时间最短为目标将大幅节省巡视人员路程时间,具有较好的实用价值,能够有效减少变电站巡视人员每轮的通行时间,提高工作效率。

The patrol path between a large number of substation stations is greatly affected by geographical condi-tions and traffic congestion.Aiming at the problem of patrol path planning,considering that the patrol scope is first divided to each patrol group in practical work,and the patrol path should fully consider the influence of trav-el time,the patrol scope division model and the patrol line model are established,and then the two-stage plan-ning is used to solve the optimal patrol path.In the first stage,based on the shortest travel time,a large number of substations are divided into various inspection groups by using the improved K-Means algorithm.In the sec-ond stage,the substations of each inspection group are based on the multi-start greedy algorithm to generate the optimal inspection path,and the measures to improve the optimization ability and efficiency of the algorithm are proposed.The result of the example shows that the proposed algorithm has good convergence and optimization ability.Taking the shortest travel time as the goal will greatly save the distance time of the patrol personnel.It has good practical value and can effectively reduce the travel time of each round of the substation patrol person-nel and improve the work efficiency.