A branch-cut-and-price approach for the single-trip and multi-trip two-echelon vehicle routing problem with time windows - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Transportation Science Année : 2022

A branch-cut-and-price approach for the single-trip and multi-trip two-echelon vehicle routing problem with time windows

Résumé

The paper studies the two-echelon capacitated vehicle routing problem with time windows, in which delivery of freight from depots to customers is performed using intermediate facilities called satellites. We consider the variant of the problem with precedence constraints for unloading and loading freight at satellites. In this variant allows for storage and consolidation of freight at satellites. Thus, the total transportation cost may decrease in comparison with the alternative variant with exact freight synchronization at satellites. We suggest a mixed integer programming formulation for the problem with an exponential number of route variables and an exponential number of precedence constraints which link first-echelon and second-echelon routes. Routes at the second echelon connecting satellites and clients may consist of multiple trips and visit several satellites. A branch-cut-and-price algorithm is proposed to solve efficiently the problem. This is the first exact algorithm in the literature for the multi-trip variant of the problem. We also present a post-processing procedure to check whether the solution can be transformed to avoid freight consolidation and storage without increasing its transportation cost. It is shown that all single-trip literature instances solved to optimality admit optimal solutions of the same cost for both variants of the problem either with precedence constraints or with exact synchronization constraints. Experimental results reveal that our algorithm can be used to solve these instances significantly faster than another recent approach proposed in the literature.
Fichier principal
Vignette du fichier
main-final-clear.pdf (481.29 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03139799 , version 1 (12-02-2021)
hal-03139799 , version 2 (14-12-2022)

Identifiants

Citer

Guillaume Marques, Ruslan Sadykov, Jean-Christophe Deschamps, Rémy Dupas. A branch-cut-and-price approach for the single-trip and multi-trip two-echelon vehicle routing problem with time windows. Transportation Science, 2022, 56 (6), pp.1598-1617. ⟨10.1287/trsc.2022.1136⟩. ⟨hal-03139799v2⟩
261 Consultations
594 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More