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.
翻译：本信涉及最佳输电线路检查,这是为多路一站式的多站式情况拟订的旅行销售人员问题一般化建议拟订的。问题是为旅行预算有限的检查车辆拟订的。因此,解决办法可以由多运行组成,以全面覆盖给定的输电线路。此外,解决办法表明有多少车辆可以在单一运行中进行检查。问题的最佳解决办法是通过拟议的Integer线性规划(ILP)方案(ILP)来解决这个问题,但这种设计在计算上要求很高。因此,计算要求由组合体计量仪处理。采用贪婪的随机随机适应搜索程序,其难度要小得多,但提供比基于ILP的方法更具有竞争力的解决办法和比例。拟议的配方和算法在现实世界的情景中展示,以检查电站的电线段部分。
相关内容
微信扫码咨询专知VIP会员