MARQUES, Guillaume; SADYKOV, Ruslan; DESCHAMPS, Jean-Christophe; DUPAS, Rémy

doi:10.1016/j.cor.2019.104833

Métadonnées

Licence d’utilisation du document

MARQUES, Guillaume
Laboratoire de l'intégration, du matériau au système [IMS]
Reformulations based algorithms for Combinatorial Optimization [Realopt]

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

DESCHAMPS, Jean-Christophe
Laboratoire de l'intégration, du matériau au système [IMS]

Langue

Article de revue

Ce document a été publié dans

Computers and Operations Research. 2020, vol. 114, p. 104833

Elsevier

Résumé en anglais

In the paper, we propose a branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem in which delivery of products from a depot to customers is performed using intermediate depots called satellites. Our algorithm incorporates significant improvements recently proposed in the literature for the standard capacitated vehicle routing problem such as bucket graph based labeling algorithm for the pricing problem, automatic stabilization, limited memory rank-1 cuts, and strong branching. In addition, we make some specific problem contributions. First, we introduce a new route based formulation for the problem which does not use variables to determine product flows in satellites. Second, we introduce a new branching strategy which significantly decreases the size of the branch-and-bound tree. Third, we introduce a new family of satellite supply inequalities, and we empirically show that it improves the quality of the dual bound at the root node of the branch-and-bound tree. Finally, extensive numerical experiments reveal that our algorithm can solve to optimality all literature instances with up to 200 customers and 10 satellites for the first time and thus double the size of instances which could be solved to optimality.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche