This paper was published through Galoá and has a deposited DOI. To cite this paper, use one of the standards below:
In case you are one of the co-authors and want to register this paper in your Lattes, use the following code: doi > 10.59254/sbpo-2026-232968
If you've NEVER registered a DOI in your Lattes, check our tutorial!The Traveling Salesperson Problem with Neighborhoods (TSPN) in non-convex polygonal domains is a highly complex routing challenge that couples combinatorial sequencing with continuous path optimization. As exact geometric evaluations dominate the search cost, traditional approaches struggle to scale. To address this bottleneck, we propose a GPU-accelerated bi-level architecture that strictly decouples macroscopic topological exploration from continuous trajectory refinement. A Max-Min Ant System (MMAS) drives the combinatorial search, guided by a dynamic heuristic derived from a massive, GPU-computed intersection oracle. The exact continuous micro-routes are then recovered via a Dynamic Programming (DP) decoder and refined by a computationally lightweight topological local search. Furthermore, we present a large-scale public benchmark, with instances of up to 2,000 irregular polygons. Computational experiments demonstrate that the proposed framework balances exact geometric feasibility and scalability, reducing average route costs by 20.8% compared to constructive baselines.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
Views per month
Galoá count, excluding known robots. Updated on 30/09/2026.
With nearly 200,000 papers published, Galoá empowers scholars to share and discover cutting-edge research through our streamlined and accessible academic publishing platform.
Learn more about our products:
This proceedings is identified by a DOI , for use in citations or bibliographic references. Attention: this is not a DOI for the paper and as such cannot be used in Lattes to identify a particular work.
Check the link "How to cite" in the paper's page, to see how to properly cite the paper