Multi-tour Set Traveling Salesman Problem in Planning Power Transmission Line Inspection
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F21%3A00350921" target="_blank" >RIV/68407700:21230/21:00350921 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1109/LRA.2021.3091695" target="_blank" >https://doi.org/10.1109/LRA.2021.3091695</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/LRA.2021.3091695" target="_blank" >10.1109/LRA.2021.3091695</a>
Alternative languages
Result language
angličtina
Original language name
Multi-tour Set Traveling Salesman Problem in Planning Power Transmission Line Inspection
Original language description
This paper 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.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/GA19-20238S" target="_blank" >GA19-20238S: Multi-Robot Persistent Monitoring of Dynamic Environments</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2021
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
IEEE Robotics and Automation Letters
ISSN
2377-3766
e-ISSN
2377-3766
Volume of the periodical
6
Issue of the periodical within the volume
4
Country of publishing house
US - UNITED STATES
Number of pages
8
Pages from-to
6196-6203
UT code for WoS article
000673511700002
EID of the result in the Scopus database
2-s2.0-85110761428