Multi-tour Set Traveling Salesman Problem in Planning Power Transmission Line Inspection

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Multi-tour Set Traveling Salesman Problem in Planning Power Transmission Line Inspection

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Multi-tour Set Traveling Salesman Problem in Planning Power Transmission Line Inspection

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

<a href="/cs/project/GA19-20238S" target="_blank" >GA19-20238S: Multi-robotické monitorování dynamických prostředí</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

IEEE Robotics and Automation Letters

ISSN

2377-3766

e-ISSN

2377-3766

Svazek periodika

6

Číslo periodika v rámci svazku

4

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

8

Strana od-do

6196-6203

Kód UT WoS článku

000673511700002

EID výsledku v databázi Scopus

2-s2.0-85110761428