Comparison between instances to solve the 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.

[1]  Tong Zhen,et al.  A Hybrid Metaheuristic Algorithm for the Multi-depot Vehicle Routing Problem with Time Windows , 2009, 2009 International Conference on Networks Security, Wireless Communications and Trusted Computing.

[2]  Thibaut Vidal,et al.  A memetic algorithm for the Multi Trip Vehicle Routing Problem , 2014, Eur. J. Oper. Res..

[3]  Chengming Qi.  An Ant Colony Algorithm with Stochastic Local Search for the VRP , 2008, 2008 3rd International Conference on Innovative Computing Information and Control.

[4]  Geng-Sheng Wang,et al.  An Improved Ant Colony Algorithm for VRP Problem , 2010, 2010 Third International Symposium on Intelligent Information Technology and Security Informatics.

[5]  Majid Yousefikhoshbakht,et al.  Solving the vehicle routing problem by a hybrid meta-heuristic algorithm , 2012 .

[6]  Giovanni Rinaldi,et al.  Computational results with a branch and cut code for the capacitated vehicle routing problem , 1998 .

[7]  Zixia Chen.  An Improved Ant Algorithm for VRP with the Shortest Delivery Time In Distribution Center , 2007, Third International Conference on Natural Computation (ICNC 2007).

[8]  Mohammad R. Akbarzadeh-Totonchi,et al.  Intelligent water drops a new optimization algorithm for solving the Vehicle Routing Problem , 2010, 2010 IEEE International Conference on Systems, Man and Cybernetics.

[9]  Jacques Teghem,et al.  A hybrid grouping genetic algorithm for the inventory routing problem with multi-tours of the vehicle , 2010, Int. J. Comb. Optim. Probl. Informatics.

[10]  Bruce L. Golden,et al.  The open vehicle routing problem: Algorithms, large-scale test problems, and computational results , 2007, Comput. Oper. Res..

[11]  Philip Kilby,et al.  Vehicle Routing Problem with Time Windows , 2004 .