This letter concerns optimal power transmission line inspection formulated as
a proposed generalization of the traveling salesman problem for a multi-route
one-depot scenario. The problem is formulated for an inspection vehicle with a
limited travel budget. Therefore, the solution can be composed of multiple runs
to provide full coverage of the given power lines. Besides, the solution
indicates how many vehicles can perform the inspection in a single run. The
optimal solution of the problem is solved by the proposed Integer Linear
Programming (ILP) formulation, which is, however, very computationally
demanding. Therefore, the computational requirements are addressed by the
combinatorial metaheuristic. The employed greedy randomized adaptive search
procedure is significantly less demanding while providing competitive solutions
and scales better with the problem size than the ILP-based approach. The
proposed formulation and algorithms are demonstrated in a real-world scenario
to inspect power line segments at the electrical substation.

针对一个多路径单仓库场景下的检测车辆，提出了一种最优的输电线检测方法，该方法以旅行商问题为基础，运用了整数线性规划和组合元启发式算法。该方法在电力变电站进行了验证。