2549. A Periodic Vehicle Routing Problem with Delivery Workers and Service Choice
Invited abstract in session TB-56: Multi-Period Vehicle Routing Problems, stream Vehicle Routing and Logistics.
Tuesday, 10:30-12:00Room: Liberty 1.11
Authors (first author is the speaker)
| 1. | Antonia Ilabaca
|
| School of Industrial Engineering, Pontificia Universidad Católica de Valparaíso | |
| 2. | Germán Paredes-Belmar
|
| School of Industrial Engineering, Pontificia Universidad Católica de Valparaíso | |
| 3. | Giovanni Campuzano
|
| Department of Maritime and Transport Technology, Delft University of Technology |
Abstract
Urban logistics is increasingly challenged by the growing demand for e-commerce, traffic congestion, and sustainability concerns. Efficient last-mile delivery is crucial for reducing operational costs, enhancing service levels, and minimizing environmental impact. This study examines a real-world distribution issue based on a food delivery company in Viña del Mar, Chile, where vehicle capacity, work shifts, and urban accessibility restrictions limit deliveries. We extend the Periodic Vehicle Routing Problem with Service Choice by incorporating multiple delivery workers who complete the final segment of deliveries on foot from designated parking locations. To optimize the weekly distribution schedule, we propose an integer linear programming formulation and develop a Two-Step Black Widow Optimizer to effectively solve large-scale instances. Preliminary results indicate that our approach significantly reduces total distribution time while improving coordination between vehicles and delivery workers.
Keywords
- Vehicle Routing
- Logistics
- Metaheuristics
Status: accepted
Back to the list of papers