Abstract
In order to ensure the normal operation of the power system, it is an essential concern for optimizing inspection path based on limited human and material resources. Despite a wide body of literatures for path planning, however, a framework to optimize grouping and inspection path with minimum number of inspection teams is still lacking. Given the target transmission lines and constrained work hours for each inspector, we study the theoretical solution of the minimum number of inspection teams for task assignment. Furthermore, we develop an improved k-means algorithm, and combine with heuristic intelligent algorithms, such as ant colony algorithm and simulated annealing algorithm, we put forward a universal framework for optimizing grouping and inspection path with minimum number of inspection teams. By applying our framework to both synthetic transmission line and the real transmission lines in Jinhua city, the results verify the theoretical solution of the minimum number of inspection teams. In addition, experimental results demonstrate that our framework can provide quasi-optimal inspection paths and balance work hours for each team. By comparison of the results with different algorithms, we find that the simulated annealing algorithm works the best. Our work paves a new way to solve the vehicle routing problem, travelling salesman problem and some other related problems.
Highlights
Transmission line is the backbone of power grid, where the safe and reliable operation is crucial to national economic development and social livelihood
As work hours of workday for individual is limited, we study the theoretical solution of the minimum number of inspection teams for fulfilling the inspection task
As the inspection time of each pylon and the corresponding transmission line connected to the pylon, tins, is assumed to be equal, in Fig. 3 (d), we present the cumulative travel times ttcruam of each inspection step on quasi-optimal inspection paths with the three algorithms
Summary
Transmission line is the backbone of power grid, where the safe and reliable operation is crucial to national economic development and social livelihood. Optimal inspection path planning refers to the shortest distance or time of inspecting all the target pylons and transmission lines starting from a certain location, under the condition that each pylon can be visited only once and the inspector(s) must return to the origin. It belongs to the classic travelling salesman problem (TSP) or vehicle routing problem (VRP) in combinatorial optimization, and it is NP-hard [9], [10].
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
