Vehicle routing: Review of benchmark datasets
- 19 February 2021
- journal article
- review article
- Published by Taylor & Francis in Journal of the Operational Research Society
- Vol. 72 (8) , 1794-1807
Abstract
The Vehicle Routing Problem (VRP) was formally presented to the scientific literature in 1959 by Dantzig and Ramser (DOI:10.1287/mnsc.6.1.80). Sixty years on, the problem is still heavily researched, with hundreds of papers having been published addressing this problem and the many variants that now exist. Many datasets have been proposed to enable researchers to compare their algorithms using the same problem instances where either the best known solution is known or, in some cases, the optimal solution is known. In this survey paper, we provide a list of Vehicle Routing Problem datasets, categorized to enable researchers to have easy access to the problem(s) that are of interest. We also make some suggestions as to the type of datasets that might be useful in the future in order to provide the scientific community with even more challenging problems, which are suited to the problems that we face today. This paper, as well as providing a list of benchmarks, also provides a checkpoint for the scientific community so that other researchers have an opportunity of comparing the growth of VRP instances that are available.Keywords
This publication has 125 references indexed in Scilit:
- A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windowsComputers & Operations Research, 2013
- Vehicle routing with cross-dockingJournal of the Operational Research Society, 2009
- The vehicle routing problem: A taxonomic reviewComputers & Industrial Engineering, 2009
- Recent advances in vehicle routing exact algorithms4OR, 2007
- A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demandsOperations Research Letters, 2007
- A unified tabu search heuristic for vehicle routing problems with time windowsJournal of the Operational Research Society, 2001
- The fleet size and mix vehicle routing problem with time windowsJournal of the Operational Research Society, 1999
- A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxationsAnnals of Operations Research, 1995
- An exact algorithm for the asymmetrical capacitated vehicle routing problemNetworks, 1986
- A Survey of Local Delivery Vehicle Routing MethodologyJournal of the Operational Research Society, 1979