Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Operations Research Year : 2021

Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty

Abstract

We examine the robust counterpart of the classical Capacitated Vehicle Routing Problem (CVRP). We consider two types of uncertainty sets for the customer demands: the classical budget polytope introduced by Bertsimas and Sim (2003), and a partitioned budget polytope proposed by Gounaris et al. (2013). We show that using the set-partitioning formulation it is possible to reformulate our problem as a deterministic heterogeneous vehicle routing problem. Thus, many state-of-the-art techniques for exactly solving deterministic VRPs can be applied for the robust counterpart, and a modern branch-and-cut-and-price algorithm can be adapted to our setting by keeping the number of pricing subproblems strictly polynomial. More importantly, we introduce new techniques to significantly improve the efficiency of the algorithm. We present analytical conditions under which a pricing subproblem is infeasible. This result is general and can be applied to other combinatorial optimization problems with knapsack uncertainty. We also introduce robust capacity cuts which are provably stronger than the ones known in the literature. Finally, a fast iterated local search algorithm is proposed to obtain heuristic solutions for the problem. Using our branch-and-cut-and-price algorithm incorporating existing and new techniques, we are able to solve to optimality all but one open instances from the literature.
Fichier principal
Vignette du fichier
main_v7_plain.pdf (594.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01958184 , version 1 (17-12-2018)
hal-01958184 , version 2 (26-04-2019)
hal-01958184 , version 3 (28-01-2020)
hal-01958184 , version 4 (17-03-2020)

Identifiers

Cite

Artur Alves Pessoa, Michael Poss, François Vanderbeck, Ruslan Sadykov, Francois Vanderbeck. Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty. Operations Research, 2021, 69 (3), pp.739-754. ⟨10.1287/opre.2020.2035⟩. ⟨hal-01958184v4⟩
500 View
838 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More