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 existing VRP algorithms: ng-path relaxation, rank-1 cuts with limited memory, path enumeration, and rounded capacity cuts; all generalized through the new concept of ``packing set''. This concept is also used to derive a 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 specific algorithms. Even some non-VRPs, like bin packing, vector packing and generalized assignment, can be modeled and effectively solved.
Citation
@techreport{PSUV2019, Author = {Artur Pessoa and Ruslan Sadykov and Eduardo Uchoa and Fran\c{c}ois Vanderbeck}, Title = {A Generic Exact Solver for Vehicle Routing and Related Problems}, Institution = {Cadernos do LOGIS-UFF}, Address = {Niter{\'o}i, Brazil}, Number = {L-2019-2}, pages = {38}, month = {June}, Year = {2019} }
Article
View A Generic Exact Solver for Vehicle Routing and Related Problems