A Generic Exact Solver for Vehicle Routing and Related Problems - Plateforme Fédérative pour la Recherche en Informatique et Mathématiques Access content directly
Journal Articles Mathematical Programming Year : 2020

A Generic Exact Solver for Vehicle Routing and Related Problems


Major advances were recently obtained in the exact solution of Vehicle Routing Problems (VRPs). Sophisticated Branch-Cut-and-Price (BCP) algorithms for some of the most classical VRP variants now solve many instances with up to a few hundreds of customers. However , adapting and reimplementing those successful algorithms for other variants can be a very demanding task. This work proposes a BCP solver for a generic model that encompasses a wide class of VRPs. It incorporates the key elements found in the best recent VRP algorithms: ng-path relaxation, rank-1 cuts with limited memory, and route enumeration; all generalized through the new concept of "packing set". This concept is also used to derive a new branch rule based on accumulated resource consumption and to generalize the Ryan and Foster branch rule. Extensive experiments on several variants show that the generic solver has an excellent overall performance, in many problems being better than the best existing specific algorithms. Even some non-VRPs, like bin packing, vector packing and generalized assignment, can be modeled and effectively solved.
Fichier principal
Vignette du fichier
manuscript-clear.pdf (488 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-02178171 , version 1 (09-07-2019)
hal-02178171 , version 2 (03-11-2020)



Artur Alves Pessoa, Ruslan Sadykov, Eduardo Uchoa, François Vanderbeck. A Generic Exact Solver for Vehicle Routing and Related Problems. Mathematical Programming, 2020, 183, pp.483-523. ⟨10.1007/s10107-020-01523-z⟩. ⟨hal-02178171v2⟩
306 View
1712 Download



Gmail Facebook Twitter LinkedIn More