Making a Complete Mess and Getting Away With It: Traveling Salesperson Problems With Circle Placement Variants
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21730%2F24%3A00376738" target="_blank" >RIV/68407700:21730/24:00376738 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1109/LRA.2024.3445817" target="_blank" >https://doi.org/10.1109/LRA.2024.3445817</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/LRA.2024.3445817" target="_blank" >10.1109/LRA.2024.3445817</a>
Alternative languages
Result language
angličtina
Original language name
Making a Complete Mess and Getting Away With It: Traveling Salesperson Problems With Circle Placement Variants
Original language description
This letter explores a variation of the Traveling Salesperson Problem, where the agent places a circular obstacle next to each node once it visits it. Referred to as the Traveling Salesperson Problem with Circle Placement (TSP-CP), the aim is to maximize the obstacle radius for which a valid closed tour exists and then minimize the tour cost. The TSP-CP finds relevance in various real-world applications, such as harvesting, quarrying, and open-pit mining. We propose several novel solvers to address the TSP-CP, its variant tailored for Dubins vehicles, and a crucial subproblem known as the Traveling Salesperson Problem on self-deleting graphs (TSP-SD). Our extensive experimental results show that the proposed solvers outperform the current state-of-the-art on related problems in solution quality.
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/EH22_008%2F0004590" target="_blank" >EH22_008/0004590: Robotics and advanced industrial production</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach
Others
Publication year
2024
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
9
Issue of the periodical within the volume
10
Country of publishing house
US - UNITED STATES
Number of pages
8
Pages from-to
8555-8562
UT code for WoS article
001303441600006
EID of the result in the Scopus database
2-s2.0-85201784076