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-232695
If you've NEVER registered a DOI in your Lattes, check our tutorial!This paper presents a meta-heuristic based on Large Neighborhood Search (LNS) for the resolution of the Periodic Traveling Salesman Problem (PTSP). The proposed solution combines strategies present in different literature papers that employ LNS in solving variants of the Vehicle Routing Problem, resulting in a new approach to PTSP. Computational experiments demonstrate that the developed solution has superior performance to the main heuristics elaborated for PTSP, being able to find new and better solutions for 12 classic instances of the literature.
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