PESSOA, Artur; SADYKOV, Ruslan; UCHOA, Eduardo; VANDERBECK, François

doi:10.1007/s10107-020-01523-z

Métadonnées

Afficher la notice complète

Licence d’utilisation du document

PESSOA, Artur
Universidade Federal Fluminense [Rio de Janeiro] [UFF]

SADYKOV, Ruslan
Reformulations based algorithms for Combinatorial Optimization [Realopt]

UCHOA, Eduardo
Universidade Federal Fluminense [Rio de Janeiro] [UFF]

Langue

Article de revue

Ce document a été publié dans

Mathematical Programming. 2020, vol. 183, p. 483-523

Springer Verlag

Résumé en anglais

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.< Réduire

Mots clés en anglais

Routing

Column generation

Integer programming

Métadonnées

Partager cette publication !

Licence d’utilisation du document

A Generic Exact Solver for Vehicle Routing and Related Problems

Langue

Ce document a été publié dans

Résumé en anglais

Mots clés en anglais

URI

DOI

Origine

Unités de recherche