You are here

Benchmarks for the Dynamic and Stochastic Vehicle Routing Problem with Time Windows

This page contains the benchmarks used in the paper A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW, Saint-Guillain et al., 2015 (available here).

Class 1 to class 4 instances are from paper Scenario-based planning for partially dynamic vehicle routing with stochastic customers, Bent & Van Hentenryck, 2004. Class 5 instances comes from Waiting and Relocation Strategies in Online Stochastic Vehicle Routing, Bent & Van Hentenryck, 2007. Class 6 instances have been introduced in A Multistage Stochastic Programming Approach to the Dynamic and Stochastic VRPTW (Saint-Guillain et al., 2015) in order to assess the efficiency of the GSA decision rule on fully dynamic instances.

AttachmentSize
Instance files for the DS-VRPTW212.57 KB