Linear Formulations for the Vehicle Routing Problem with Synchronization Constraints - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Izvestia Rossiiskoi Akademii Nauk.Teoriya i Systemy Upravleniya / Journal of Computer and Systems Sciences International Année : 2018

Linear Formulations for the Vehicle Routing Problem with Synchronization Constraints

(1) , (1) , (1) , (2)
1
2

Résumé

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.
Fichier non déposé

Dates et versions

hal-01826116 , version 1 (29-06-2018)

Identifiants

Citer

E. López-Aguilar, V. Boyer, M. Salazar-Aguilar, Mohammed Sbihi. Linear Formulations for the Vehicle Routing Problem with Synchronization Constraints. Izvestia Rossiiskoi Akademii Nauk.Teoriya i Systemy Upravleniya / Journal of Computer and Systems Sciences International, 2018, 57 (3), pp. 453-462. ⟨10.1134/S106423071803005X⟩. ⟨hal-01826116⟩
60 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook Twitter LinkedIn More