I am looking for a TSP lib that would provide good heuristics and possibly instances of the Vehicle routing problem. Which one would you recommend?
Hi Patricia, you can go thru the following research papers on VRP -
1. KOLEN, A., RINNOOY KAN, A. and TRIENEKENS, H. 1986. Vehicle Routing with Time Windows. Operations Res. Vol. 35, No. 2, March-April 1987.
2. SOLOMON, M. 1987. Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Res. Vol. 35, No. 2, March-April 1987.
3. BAKER, E. 1983. An Exact Algorithm for the Time-Constrained Traveling Salesman Problem. Operations. Res. 31, pp 938-945.
4. CLARKE, G. and WRIGHT J. 1964. Scheduling of Vehicles from a Central Depot to a Number of Delivery Points. Operations. Res. Vol. 12, No. 4, pp 568-581.
Hi Patricia, I think that the most important library for TSP and VRP is TSPLIB. Unfortunately libraries only have sets of instances, good heuristics are not provided.
http://www.computational-logistics.org/orlib/
Our website provides many instances for the VRP and its variants.
TSPLIB is also useful: http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/
and ORLIB : http://people.brunel.ac.uk/~mastjjb/jeb/info.html
Hi Patricia,
Take a look at the Concorde website http://www.math.uwaterloo.ca/tsp/concorde.html.
The information they provide is usually up-to-date.
Dear Patricia,
an interesting site that you can visit to find vehicle routing problem instances (but not for the Travelling Salesman Problem) is the following:
http://neo.lcc.uma.es/vrp/vehicle-routing-problem/
I think it is very useful!
Dear Patricia,
Take a look at these sites.
http://www.vrp-rep.org/
http://w1.cirrelt.ca/~vidalt/en/VRP-resources.html
http://vrp.atd-lab.inf.puc-rio.br/index.php/en/
http://www.bernabe.dorronsoro.es/vrp/
I think they will help you..
Hello,
Here is also a link to some data sets. I hope it helps.
http://neo.lcc.uma.es/vrp/vrp-instances/capacitated-vrp-with-time-windows-instances/
I think the VRPH library is works well:
https://projects.coin-or.org/VRPH.
Lars Mönch
hello Ehsan, i have also referred the same library. while referring to various instance, i come across discrepancy in the solution cost that has been shown in the library and obtained cost. for example the instance A-n39-K5 the given solution cost is 822. i have been obtaining the cost to be 769.4 only. i am considering only the euclidean distance starting from depot moving through all clients in the route and coming back to the depot. thus the cost for all routes have been added up. please tell if there is some additional cost that i am missing or some weights are to be there in finding the cost. please provide with the mathematical expression so that things become clear
For the classical capacitated vehicle routing problem (CVRP), I recommend relying on this library which is constantly updated with the best solutions and allows to print them:
http://vrp.atd-lab.inf.puc-rio.br/index.php/en/
For other problem variants, you can consult the VRP Rep:
http://www.vrp-rep.org/
I also maintain several links towards instances and source codes here:
https://w1.cirrelt.ca/~vidalt/en/VRP-resources.html
- Badges
- Science topic
- Similar topics
- Mathematical Sciences
- Graphs