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 |
| ctrlnum |
0.17632-kcc52cw4zs.1 |
|---|---|
| fullrecord |
<?xml version="1.0"?>
<dc><creator>Salazar-Gonzalez, Juan-Jose</creator><title>CVRP instances</title><publisher>Mendeley</publisher><description>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}.</description><subject>Combinatorial Optimization</subject><subject>Vehicle Routing Problem</subject><subject>Integer Programming</subject><contributor>Letchford, Adam</contributor><type>Other:Dataset</type><identifier>10.17632/kcc52cw4zs.1</identifier><rights>Creative Commons Attribution 4.0 International</rights><rights>http://creativecommons.org/licenses/by/4.0</rights><relation>https:/data.mendeley.com/datasets/kcc52cw4zs</relation><date>2018-06-16T08:56:36Z</date><recordID>0.17632-kcc52cw4zs.1</recordID></dc>
|
| format |
Other:Dataset Other |
| author |
Salazar-Gonzalez, Juan-Jose |
| author2 |
Letchford, Adam |
| title |
CVRP instances |
| publisher |
Mendeley |
| publishDate |
2018 |
| topic |
Combinatorial Optimization Vehicle Routing Problem Integer Programming |
| url |
https:/data.mendeley.com/datasets/kcc52cw4zs |
| contents |
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}. |
| id |
IOS7969.0.17632-kcc52cw4zs.1 |
| institution |
Universitas Islam Indragiri |
| affiliation |
onesearch.perpusnas.go.id |
| institution_id |
804 |
| institution_type |
library:university library |
| library |
Teknologi Pangan UNISI |
| library_id |
2816 |
| collection |
Artikel mulono |
| repository_id |
7969 |
| city |
INDRAGIRI HILIR |
| province |
RIAU |
| shared_to_ipusnas_str |
1 |
| repoId |
IOS7969 |
| first_indexed |
2020-04-08T08:18:09Z |
| last_indexed |
2020-04-08T08:18:09Z |
| recordtype |
dc |
| _version_ |
1686587421816258560 |
| score |
17.538404 |