Skip to Main content Skip to Navigation
Journal articles

A Generic Exact Solver for Vehicle Routing and Related Problems

Abstract : 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.
Document type :
Journal articles
Complete list of metadatas

Cited literature [86 references]  Display  Hide  Download

https://hal.inria.fr/hal-02178171
Contributor : Ruslan Sadykov <>
Submitted on : Tuesday, November 3, 2020 - 5:27:23 PM
Last modification on : Thursday, November 5, 2020 - 3:33:59 AM

File

manuscript-clear.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

14

Files downloads

95