COVRP solutions
The Capacitated Open Vehicle Routing Problem (COVRP) is the open version of the Capacitated Vehicle Routing Problem (CVRP). In the COVRP, each route begins at the depot and ends at a customer.
In the recent paper "A Branch-and-Cut Algorithm for the Capacitated Open Vehicle Routing Problem", by A.N. Letchford, J. Lysgaard, and R.W. Eglese, we presented the first exact optimization algorithm for the COVRP. Our paper can be downloaded here. Using this algorithm, we were able to solve to optimality the open version of a number of well-known CVRP instances, taken from www.branchandcut.org/VRP/data/.
The tables below contain for each solved instance a link to a text file showing the optimal solution. An explanation of the file format, the convention used for calculation of distances, and the file naming convention, can be obtained by clicking here.
A list of references to papers on heuristics for the COVRP is given after the tables.
A instances
| A-32-5 | A-33-5 | A-33-6 | A-34-5 | A-36-5 |
| A-37-5 | A-37-6 | A-38-5 | A-39-5 | A-39-6 |
| A-44-7 | A-45-6 | A-45-7 | A-46-7 | A-48-7 |
| A-53-7 | A-54-7 | A-55-9 | A-62-8 | A-65-9 |
| A-69-9 |
B instances
| B-31-5 | B-34-5 | B-35-5 | B-38-6 | B-39-5 |
| B-41-6 | B-43-6 | B-44-7 | B-45-5 | B-45-6 |
| B-50-7 | B-51-7 | B-52-7 | B-56-7 | B-57-7 |
| B-63-10 | B-64-9 | B-66-9 | B-68-9 |
E, F and M instances
P instances
| P-16-8 | P-19-2 | P-20-2 | P-21-2 | P-22-2 |
| P-22-8 | P-23-8 | P-40-5 | P-45-5 | P-50-7 |
| P-50-10 | P-55-7 | P-55-8 | P-55-10 | P-60-10 |
| P-65-10 | P-76-4 | P-76-5 | P-101-4 |
Bibliography
Last update: March 22, 2007