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

Guillaume Marques 1, 2 Ruslan Sadykov 2 Jean-Christophe Deschamps 1 Rémy Dupas 1
2 Realopt - Reformulations based algorithms for Combinatorial Optimization
LaBRI - Laboratoire Bordelais de Recherche en Informatique, IMB - Institut de Mathématiques de Bordeaux, Inria Bordeaux - Sud-Ouest
Abstract : 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.
Document type :
Reports
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02112287
Contributor : Guillaume Marques <>
Submitted on : Friday, April 26, 2019 - 3:41:55 PM
Last modification on : Saturday, April 27, 2019 - 1:42:58 AM

File

A_branch_cut_and_price_algorit...
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02112287, version 1

Citation

Guillaume Marques, Ruslan Sadykov, Jean-Christophe Deschamps, Rémy Dupas. An improved branch-cut-and-price algorithm for the two-echelon capacitated vehicle routing problem. [Technical Report] Univ. Bordeaux; IMS Laboratory - University of Bordeaux - Bordeaux INP, France; Inria Bordeaux Sud-Ouest; IMB - Institut de Mathématiques de Bordeaux. 2019. ⟨hal-02112287⟩

Share

Metrics

Record views

137

Files downloads

183