Solving the Capacitated Vehicle Routing Problem and the Split Delivery Using GRASP Metaheuristic

This paper presents two GRASP metaheuristic algorithms for the vehicle routing problem, considering the capacity and shared demand of the customers. In this paper the solution obtained is compared with a greedy solution and two hybrid solutions (greedy and random). The results obtained show that the GRASP algorithm obtains a better quality solution for this kind of problem.

[1]  Christian Prins,et al.  A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.

[2]  M. Fischetti,et al.  A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs , 1994, Oper. Res..

[3]  Gérard Cornuéjols,et al.  The traveling salesman problem on a graph and some related integer polyhedra , 1985, Math. Program..

[4]  Beatrice M. Ombuki-Berman,et al.  Using Genetic Algorithms for Multi-depot Vehicle Routing , 2009, Bio-inspired Algorithms for the Vehicle Routing Problem.

[5]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[6]  Maurício Resende,et al.  GRASP: Greedy Randomized Adaptive Search Procedures , 2003 .

[7]  Athanasios Migdalas,et al.  Annotated bibliography in vehicle routing , 2007, Oper. Res..

[8]  R. H. Mole,et al.  A Sequential Route-building Algorithm Employing a Generalised Savings Criterion , 1976 .

[9]  Martin Desrochers,et al.  A new heuristic for the fleet size and mix vehicle routing problem , 1991, Comput. Oper. Res..

[10]  Bezalel Gavish,et al.  Parallel Savings Based Heuristics for the Delivery Problem , 1991, Oper. Res..

[11]  Gilbert Laporte,et al.  An exact algorithm for the asymmetrical capacitated vehicle routing problem , 1986, Networks.

[12]  Giovanni Rinaldi,et al.  The graphical relaxation: A new framework for the symmetric traveling salesman polytope , 1993, Math. Program..

[13]  Alfredo Olivera.  Heurísticas para problemas de ruteo de vehículos , 2004 .

[14]  Gábor Nagy,et al.  A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries , 2008, J. Comb. Optim..

[15]  Hylton Boothroyd.  Operational Research '90 , 1992 .

[16]  Lin Wei Dong,et al.  Ant Colony Optimization for VRP and Mail Delivery Problems , 2006, 2006 4th IEEE International Conference on Industrial Informatics.

[17]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[18]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[19]  Marshall L. Fisher,et al.  Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees , 1994, Oper. Res..