Benchmark MDVRP
This benchmark is based on the instances defined by:
Cordeau, J.-F., Gendreau, M. and Laporte, G. (1997), A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks, 30: 105–119.
Instances and best-known solutions are collected from http://neo.lcc.uma.es/vrp/vrp-instances/multiple-depot-vrp-instances/.
| config file | remark | inst | computer | Ø time [sec] | Ø result | Ø Δ best* [in %] | details |
|---|---|---|---|---|---|---|---|
 |
extensive search | P01-12 | 2.26 GHz Intel Core 2 Duo | 47.22 | 1894.76 | 2.98 |  |
| PR01-10 | 119.48 | 1941.37 | 2.24 | |
|||
|
greedy search | P01-12 | 17.85 | 1951.98 | 6.09 | |
|
| PR01-10 | 35.89 | 2045.39 | 7.72 | |
|||
|
2 seconds search | P01-12 | 2.05 | 2174.94 | 18.21 | |
|
| PR01-10 | 2.09 | 2365.01 | 24.55 | |
Loading and using one of the above algorithms is as simple as taking the following two steps:
- Download config-file (open config-file in Browser (just click on config-icon), right click 'Raw' and save target as) and
- Code
VehicleRoutingAlgorithm vra = VehicleRoutingAlgorithms.readAndCreateAlgorithm(yourProblem,"yourPath/downloadedConfigFile.xml")
If you do not know yet how to set up a problem and run an algorithm, please visit Simple Example.
Did you find a better configuration? Report it and you will find yourself in the tables above.