A robust optimization approach for the capacitated vehicle routing problem with demand uncertainty

278 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A concise guide to existing and emerging vehicle routing problem variants (2019, background): “A wide range of VRP variants arising from the addition of time restrictions were surveyed in Vidal et al. (2015). Time constraints can arise as customer- or self-imposed time windows for deliveries (Solomon 1987, Agatz et al.”
Robust Multi-period Fleet Allocation Models for Bike-Sharing Systems (2016, background): “following two types of weight set, which are often adopted in the literature (e.g., BenTal and Nemirovski 1999; Sungur et al. 2008; Yao et al. 2009).”
Recent advances in robust optimization: An overview (2014, unknown): “The capacitated vehicle routing problem with demand uncertainty is studied in Sungur (2007) and Sungur et al. (2008), and the robust traveling salesman problem with interval data in Montemanni et al. (2007).”
The Stochastic Vehicle Routing Problem for Minimum Unmet Demand (2009, methodology): “The robust optimization approach, introduced by Ben-Tal and Nemirovski [2] and more recently extended to integer programming [8] and VRP [43], requires that the solution satisfy the constraints with uncertain parameters for all possible values in the uncertainty set U .”