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

Artur Alves Pessoa (1) , Michael Poss (2) , Ruslan Sadykov (3) , François Vanderbeck (3)

1 UFF - Universidade Federal Fluminense [Rio de Janeiro]
2 MAORE - Methods, Algorithms for Operations REsearch
3 Realopt - Reformulations based algorithms for Combinatorial Optimization

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.

Mots clés: capacity inequalities; local search History :; branch-cut-and-price; local search; robust optimization; branch-and-cut-and-price

Domaines: Recherche opérationnelle [math.OC]

Artur Alves Pessoa, Michael Poss, Ruslan Sadykov, François Vanderbeck. Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty. [Research Report] Cadernos do LOGIS 2018-1, Universidade Federal Fluminense. 2018. ⟨hal-01958184v3⟩