Multi-Tour Set Traveling Salesman Problem in Planning Power Transmission Line Inspection
| Autor: | Nekovář, František, Faigl, Jan, Saska, Martin |
|---|---|
| Rok vydání: | 2023 |
| Předmět: | |
| Zdroj: | IEEE Robotics and Automation Letters, vol. 6, no. 4, pp. 6196-6203, Oct. 2021 |
| Druh dokumentu: | Working Paper |
| DOI: | 10.1109/LRA.2021.3091695 |
| Popis: | 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. Comment: Copyright 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works |
| Databáze: | arXiv |
| Externí odkaz: |
|