Optimization Online


The robust vehicle routing problem with time windows: compact formulation and branch-price-and-cut method

Pedro Munari (munari***at***dep.ufscar.br)
Alfredo Moreno (alfredmorenoarteaga***at***gmail.com)
Jonathan De La Vega (jdlvmartinez***at***gmail.com)
Douglas Alem (douglas.alem***at***ed.ac.uk)
Jacek Gondzio (J.Gondzio***at***ed.ac.uk)
Reinaldo Morabito (morabito***at***ufscar.br)

Abstract: We address the robust vehicle routing problem with time windows (RVRPTW) under customer demand and travel time uncertainties. As presented thus far in the literature, robust counterparts of standard formulations have challenged general-purpose optimization solvers and specialized branch-and-cut methods. Hence, optimal solutions have been reported for small-scale instances only. Additionally, although the most successful methods for solving many variants of vehicle routing problems are based on the column generation technique, the RVRPTW has never been addressed by this type of method. In this paper, we introduce a novel robust counterpart model based on the well-known budgeted uncertainty set, which has advantageous features in comparison to other formulations and presents better overall performance when solved by commercial solvers. This model results from incorporating dynamic programming recursive equations into a standard deterministic formulation and does not require the classical dualization scheme typically used in robust optimization. In addition, we propose a branch-price-and-cut method based on a set partitioning formulation of the problem, which relies on a robust resource constrained elementary shortest path problem to generate routes that are robust regarding both vehicle capacity and customer time windows. Computational experiments using Solomons's instances show that the proposed approach is effective and able to obtain robust solutions within a reasonable running time. The results of an extensive Monte Carlo simulation indicate the relevance of obtaining robust routes for a more reliable decision-making process in real-life settings.

Keywords: vehicle routing; time windows; robust optimization; polyhedral-interval uncertainty; compact model; branch-price-and-cut

Category 1: Applications -- OR and Management Sciences

Category 2: Applications -- OR and Management Sciences (Transportation )

Category 3: Robust Optimization

Citation: Munari, P.; Moreno, A.; De La Vega, J.; Alem, D.; Gondzio, J.; Morabito, R. The robust vehicle routing problem with time windows: compact formulation and branch-price-and-cut method . Transportation Science, v. 53 (4), p. 1043-1066, 2019. (https://doi.org/10.1287/trsc.2018.0886)

Download: [PDF]

Entry Submitted: 02/20/2018
Entry Accepted: 02/20/2018
Entry Last Modified: 05/23/2020

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society