A Bucket Graph Based Labelling Algorithm for Vehicle Routing - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Transportation Science Year : 2021

A Bucket Graph Based Labelling Algorithm for Vehicle Routing


We consider the Shortest Path Problem with Resource Constraints (SPPRC) arising as a subproblem in state-of-the-art Branch-Cut-and-Price algorithms for vehicle routing problems. We propose a variant of the bi-directional label correcting algorithm in which the labels are stored and extended according to the so-called bucket graph. Such organization of labels helps to decrease significantly the number of dominance checks and the running time of the algorithm. We also show how the forward/backward route symmetry can be exploited and how to eliminate arcs from the bucket graph using reduced costs. The proposed algorithm can be especially beneficial for vehicle routing instances with large vehicle capacity and/or with time window constraints. Computational experiments were performed on instances from the distance constrained vehicle routing problem, including multi-depot and site-dependent variants, on the vehicle routing problem with time windows, and on the "nightmare" instances of the heterogeneous fleet vehicle routing problem. Significant improvements over the best algorithms in the literature were achieved and many instances could be solved for the first time.
Fichier principal
Vignette du fichier
BucketGraph-final-clear.pdf (605.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02378624 , version 1 (25-11-2019)
hal-02378624 , version 2 (03-11-2020)



Ruslan Sadykov, Artur Alves Pessoa, Eduardo Uchoa. A Bucket Graph Based Labelling Algorithm for Vehicle Routing. Transportation Science, 2021, 55 (1), pp.4-28. ⟨10.1287/trsc.2020.0985⟩. ⟨hal-02378624v2⟩
118 View
992 Download



Gmail Facebook X LinkedIn More