Linear Formulations for the Vehicle Routing Problem with Synchronization Constraints
- Authors: López-Aguilar E.1, Boyer V.1, Salazar-Aguilar M.A.1, Sbihi M.2
-
Affiliations:
- Graduate Program in Systems Engineering, UANL
- ENAC
- Issue: Vol 57, No 3 (2018)
- Pages: 453-462
- Section: Systems Analysis and Operations Research
- URL: https://journals.rcsi.science/1064-2307/article/view/220135
- DOI: https://doi.org/10.1134/S106423071803005X
- ID: 220135
Cite item
Abstract
This paper studies a vehicle routing problem with synchronization constraints and time windows. In this problem, a subset of nodes requires more than one vehicle to satisfy its demand simultaneously. We propose three new mixed integer linear formulations for this problem and we evaluate their efficiency over a large set of instances taken from the literature. The computational results reveal that the proposed linear formulations allow solving larger instances in a shorter computational time than the ones previously proposed in the literature.
About the authors
E. López-Aguilar
Graduate Program in Systems Engineering, UANL
Author for correspondence.
Email: eduardo.lopezag@uanl.edu.mx
Mexico, San Nicolás de los Garza
V. Boyer
Graduate Program in Systems Engineering, UANL
Email: eduardo.lopezag@uanl.edu.mx
Mexico, San Nicolás de los Garza
M. A. Salazar-Aguilar
Graduate Program in Systems Engineering, UANL
Email: eduardo.lopezag@uanl.edu.mx
Mexico, San Nicolás de los Garza
M. Sbihi
ENAC
Email: eduardo.lopezag@uanl.edu.mx
France, Toulouse