On this page you could find benchmark sets used in our study of Vehicle Routing Problem with Dynamic Requests (the files are created according to the format proposed by Montemanni et al. (2009))
Below we present the values of the best known results for the 21 literature benchmark sets. 19 of the best results were found by our algorithm ContDVRP (its earliear version has been 2-Phase Multi-swarm Particle Swarm Optimization (2MPSO)). For those results we present also the solutions in form of a picture and a time table for the vehicles.
Also, for all the benchmarks, graphical representation of the requests’ spatial, temporal and sizes distributions is given.
The code and the binary files of the ContDVRP (with the settings for a standard number of fitness function evaluations may be found here)
|tai75c||UNKNOWN TO US||1406.27|
|tai75d||UNKNOWN TO US||1342.26|