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.

中文翻译：

---

输电线路巡检规划中的多环旅行商问题

这封信涉及最优输电线路检查，该检查被表述为多路线单站场景的旅行商问题的建议概括。该问题是针对旅行预算有限的检查车辆制定的。因此，该解决方案可以由多次运行组成，以提供给定电力线的完全覆盖。此外，该解决方案会指示在一次运行中可以执行多少车辆检查。该问题的最佳解决方案是通过建议的整数线性规划 (ILP) 公式解决的，但是，该公式对计算的要求非常高。因此，计算要求由组合元启发式解决。与基于 ILP 的方法相比，所采用的贪婪随机自适应搜索程序的要求明显较低，同时提供了具有竞争力的解决方案，并且可以更好地扩展问题规模。所提出的公式和算法在实际场景中进行了演示，以检查变电站的电力线段。