LNS Meta-heuristics applied to the Periodic Traveling Salesman Problem

Vol 57, 2025 - 340784
Complete Articles (CA)
Favorite this paper
How to cite this paper?
Abstract

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. 

Share your ideas or questions with the authors!

Did you know that the greatest stimulus in scientific and cultural development is curiosity? Leave your questions or suggestions to the author!

Sign in to interact

Have a question or suggestion? Share your feedback with the authors!

Institutions
  • 1 Universidade Federal da Paraíba
Track
  • MH – Metaheurístics
Keywords
Periodic Traveling Salesman Problem
Meta-heuristics
Combinatorial Optimization