Vehicle Routing Problem

The Vehicle Routing Problem (VRP) is a classic problem in combinatorial optimization. The problem is to find the shortest route that visits each node in a graph exactly once and returns to the starting node.

Data and Resources

Cite this as

Bharathan Balaji, Jordan Bell-Masterson, Enes Bilgin, Andreas Damianou, Pablo Moreno Garcia, Arpit Jain, Runfei Luo, Alvaro Maggiar, Balakrishnan Narayanaswamy, Chun Ye (2024). Dataset: Vehicle Routing Problem. https://doi.org/10.57702/46hz02kq

DOI retrieved: December 3, 2024

Additional Info

Field Value
Created December 3, 2024
Last update December 3, 2024
Defined In https://doi.org/10.48550/arXiv.1911.10641
Citation
  • https://doi.org/10.48550/arXiv.2310.18264
Author Bharathan Balaji
More Authors
Jordan Bell-Masterson
Enes Bilgin
Andreas Damianou
Pablo Moreno Garcia
Arpit Jain
Runfei Luo
Alvaro Maggiar
Balakrishnan Narayanaswamy
Chun Ye
Homepage https://github.com/awslabs/or-rl-benchmarks