Making a Complete Mess and Getting Away with it: Traveling Salesperson Problems with Circle Placement Variants
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866912073121792000 |
|---|---|
| author | Woller, David Mansouri, Masoumeh Kulich, Miroslav |
| author_facet | Woller, David Mansouri, Masoumeh Kulich, Miroslav |
| contents | This paper 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2410_08627 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Making a Complete Mess and Getting Away with it: Traveling Salesperson Problems with Circle Placement Variants Woller, David Mansouri, Masoumeh Kulich, Miroslav Robotics This paper 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. |
| title | Making a Complete Mess and Getting Away with it: Traveling Salesperson Problems with Circle Placement Variants |
| topic | Robotics |
| url | https://arxiv.org/abs/2410.08627 |