Is there a universally accepted set of benchmarks for the Dynamic Vehicle Routing Problem (DVRP) like there are ones for the Traveling Salesman Problem and the Vehicle Routing Problem?
I'm interested in Capacitated DVRP and DVRP with Time Windows.
I know Kilby et al. (1998) proposed 21 problems based on VRP benchmarks, but I'm looking for more examples.
For me, http://www.cs.strath.ac.uk/ apes/apedata.html is not available. I think you can create your own set of instances to test your proposed algorithms.
Supposedly, there is a website by Pankratz and Krypczyk with an updated list of publicly available instance sets for dynamic vehicle routing problems, cited as "Pankratz, G. and Krypczyk, V. (2009). Benchmark data sets for dynamic vehicle routing problems" but the link provided in papers doesn't seem to work (http://www.fernuni-hagen.de/WINF/inhalte/benchmark_data.htm)
- Badges
- Science topic
- Similar topics
- Mathematical Sciences
- Graphs