Abstract
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.
Chapter PDF
Similar content being viewed by others
References
Prins, C.: A GRASP X Evolutionary Local Search Hybrid for the Vehicle Routing Problem. In: Bioinspired Algorithms for the Vehicle Routing Problem, vol. 1, p. 35 (2008)
Universidad de Málaga (2009), http://neo.lcc.uma.es/radi-aeb/WebVRP/
Marinakis, Y., Migdalas, A.: Operational Research 7(1), 27–46 (2007)
Laporte, G., Mercure, H., Nobert, Y.: An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16, 33–46 (1986)
Fischetti, M., Toth, P., Vigo, D.: A branch-and-bound algorithm for the capacitated vehicle routing problem on directed graphs. Operations Research 42, 846–859 (1994)
Fisher, M.L.: Optimal solution of vehicle routing problems using minimum k-trees. Operations Research 42, 626–642 (1994)
Cornuéjols, G., Fonlupt, J., Naddef, D.: The traveling salesman problem on a graph and some related integer polyhedra. Mathematical Programming 33, 1–27 (1985)
Naddef, D., Rinaldi, G.: The graphical relaxation: A new framework for the symetric traveling salesman polytope. Mathematical Programming 58, 53–88 (1993)
Toth, P., Vigo, D.: The Vehicle Routing Problem. Society of Industrial and Applied Mathematics (SIAM), Philadelphia (2002)
Claudio Contardo Vera: Formulación y solución de un problema de ruteo de vehículos con demanda variable en tiempo real, trasbordos y ventanas de tiempo. Universidad de Chile (2005)
Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581 (1964)
Desrochers, M., Verhoog, T.W.: A new heuristic for the fleet size and mix vehicle routing problem. Computers & OR 18, 263–274 (1991)
Altinkemer, K., Gavish, B.: Parallel Savings Based Heuristics for the Delivery Problem. Operations Research 39(3), 456–469 (1991)
Mole, R.H., Jameson, S.R.: A sequential route-building algorithm employing a generalized savings criterion. Operations Research Quarterly 27, 503–511 (1976)
Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. Wiley, Chichester (1979)
Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research 35 (1987)
Dong, L.W., Xiang, C.T.: Ant Colony Optimization for VRP and Mail Delivery Problems. In: 2006 IEEE International Conference on Industrial Informatics, pp. 1143–1148 (2006)
Ombuki-Berman, B., Hanshar, F.T.: Using Genetic Algorithms for Multi-depot Vehicle Routing. Studies in Computational Intelligence 161, 77–99 (2009)
Wassan, N.A., Wassan, A.H., Nagy, G.: A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries. Journal of Combinatorial Optimization 15(4) (2008)
Resende, M.G.C., Velarde, J.L.G.: GRASP: Greedy Randomized Adaptive Search Procedures. Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial 19, 61–76 (2003)
Olivera, A.: Heurísticas para Problemas de Ruteo de Vehículos. Instituto de Computación, Facultad de Ingeniería, Universidad de la República, Montevideo, Uruguay (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 IFIP International Federation for Information Processing
About this paper
Cite this paper
Suárez, J.G., Anticona, M.T. (2010). Solving the Capacitated Vehicle Routing Problem and the Split Delivery Using GRASP Metaheuristic. In: Bramer, M. (eds) Artificial Intelligence in Theory and Practice III. IFIP AI 2010. IFIP Advances in Information and Communication Technology, vol 331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15286-3_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-15286-3_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15285-6
Online ISBN: 978-3-642-15286-3
eBook Packages: Computer ScienceComputer Science (R0)