A Biased-Randomized Iterated Local Search with Round-Robin for the Periodic Vehicle Routing Problem
Gómez González, Juan Francisco (Universitat Politècnica de València)
Rodríguez Uguina, Antonio (Universitat Politècnica de València)
Panadero, Javier (Universitat Autònoma de Barcelona. Departament d'Arquitectura de Computadors i Sistemes Operatius)
Juan, Ángel A (Universitat Politècnica de València)
Universitat Autònoma de Barcelona

Data:	2025
Resum:	The periodic vehicle routing problem (PVRP) is a well-known challenge in real-life logistics, requiring the planning of vehicle routes over multiple days while enforcing visitation frequency constraints. Although numerous metaheuristic and exact methods have tackled various PVRP extensions, real-world settings call for additional features such as depot configurations, tight visitation frequency constraints, and heterogeneous fleets. In this paper, we present a two-phase biased-randomized algorithm that addresses these complexities. In the first phase, a round-robin assignment quickly generates feasible and promising solutions, ensuring each customer's frequency requirement is met across the multi-day horizon. The second phase refines these assignments via an iterative search procedure, improving route efficiency and reducing total operational costs. Extensive experimentation on standard PVRP benchmarks shows that our approach is able to generate solutions of comparable quality to established state-of-the-art algorithms in relatively low computational times and stands out in many instances, making it a practical choice for real life multi-day vehicle routing applications.
Ajuts:	Agencia Estatal de Investigación PID2022-138860NB-I00 Agencia Estatal de Investigación RED2022-134703-T European Commission 101092612
Drets:	Aquest document està subjecte a una llicència d'ús Creative Commons. Es permet la reproducció total o parcial, la distribució, la comunicació pública de l'obra i la creació d'obres derivades, fins i tot amb finalitats comercials, sempre i quan es reconegui l'autoria de l'obra original.
Llengua:	Anglès
Document:	Article ; recerca ; Versió publicada
Matèria:	Combinatorial optimization ; Local search ; Metaheuristics ; Periodic vehicle routing problem
Publicat a:	Mathematics, Vol. 13, Issue 15 (August 2025) , art. 2488, ISSN 2227-7390

DOI: 10.3390/math13152488

19 p, 1.1 MB

El registre apareix a les col·leccions:
Articles > Articles de recerca
Articles > Articles publicats