CVRP instances
| Main Author: | Salazar-Gonzalez, Juan-Jose |
|---|---|
| Other Authors: | Letchford, Adam |
| Format: | Dataset |
| Terbitan: |
Mendeley
, 2018
|
| Subjects: | |
| Online Access: |
https:/data.mendeley.com/datasets/kcc52cw4zs |
Daftar Isi:
- Here are the 240 instances for the "Capacitated Vehicle Routing Problem" used in the article "The Capacitated Vehicle Routing Problem: Stronger Bounds in Pseudo-Polynomial Time", written by Adam Letchord and Juan-Jose Salazar-Gonzalez, and published in "European Journal of Operational Research" 2018. https://doi.org/10.1016/j.ejor.2018.06.002 Each instance has 15 customers and 1 depot, and is in a text file following the TSPLIB95 format for CVRP instances. There are instances with asymmetric (A) and with symmetric (S) distances, with unit demands (U) and with general demands (G). The U instances have vehicle capacity in {4,6,8} and the G instances have vehicle capacity in {100,150,200}.