Comparison between instances to solve the CVRP

  • Edgar G. Cossio Franco Universidad Da Vinci, Universidad Enrique Díaz de León
  • José Alberto Hernández Aguilar Universidad Autónoma del Estado de Morelos
  • Alberto Ochoa-Zezzatti Universidad Autónoma de Ciudad Juárez
  • Julio César Ponce Gallegos Universidad Autónoma de Aguascalientes
Keywords: CVRP


The Vehicle Routing Problem or VRP is an approach represented by the problems that faces a vehicle to transport goods on a route (origin-destination) under a defined time and distance. An instance is a set of data prepared specifically in order for analysis and exploration (Column 1 indicates the number of nodes, usually the number 1 is the depot, column 2 is the x coordinate, column 3 is the y-coordinate, column 4 is the demand to be covered by the node) that it was done in MATLAB R2014a software which runs the algorithm VRP with capacities (CVRP), with the structure already mentioned. For their analysis was necessary to use instances obtained from NEO. This paper presents a comparative between instances to solve CVRP and determine which one offers the best solution.

How to Cite
Cossio Franco, E., Hernández Aguilar, J., Ochoa-Zezzatti, A., & Ponce Gallegos, J. (2018). Comparison between instances to solve the CVRP. International Journal of Combinatorial Optimization Problems and Informatics, 9(2), 41-54. Retrieved from