Combining probabilistic algorithms, Constraint Programming and Lagrangian Relaxation to solve the Vehicle Routing Problem

Annals of Mathematics and Artificial Intelligence

Volumn 62, Issue 3-4, 2011, Pages 299-315

  Guimarans, Daniel ^a   Herrero, Rosa ^a   Riera, Daniel ^b   Juan, Angel A ^b   Ramos, Juan José ^a  

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

^b UNIVERSITAT OBERTA DE CATALUNYA   (Spain)

Author keywords

Hybrid algorithms; Probabilistic algorithms; Variable Neighborhood Search; Vehicle Routing Problem

Indexed keywords

EID: 84856551493     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10472-011-9261-y     Document Type: Review

References (49)

1. Alba, E., Dorronsoro, B.: A hybrid cellular genetic algorithm for the capacitated vehicle routing problem. In: Abraham, A., Grosan, C., Pedrycz, W. (eds.) Engineering Evolutionary Intelligent Systems (Studies in Computational Intelligence, 82), pp. 379-422. Springer, New York (2008).
2. Altinel, I., Oncan, T.: A new enhancement of the Clarke and Wright savings heuristic for the capacitated vehicle routing problem. J. Oper. Res. Soc. 56, 954-961 (2005).
3. Apt, K., Wallace, M.: Constraint Logic Programming using ECLiPSe. Cambridge University Press, Cambridge (2007).
4. Berger, J., Barkaoui, M.: A hybrid genetic algorithm for the capacitated vehicle routing problem. In: Cantó-Paz, E. (ed.) Proceedings of the International Genetic and Evolutionary Computation Conference, Chicago, IL, USA, pp. 646-656. Springer, New York (1996).
5. Boschetti, M., Maniezzo, V.: Benders decomposition, Lagrangean Relaxation and metaheuristic design. Journal of Heuristics 15, 283-312 (2009).
6. Buxey, G.: The Vehicle Scheduling Problem and Monte Carlo Simulation. J. Oper. Res. Soc. 30, 563-573 (1979).
7. Christofides, N., Mingozzi, A., Toth, P.: The Vehicle Routing Problem. In: Combinatorial Optimization, pp. 315-338. Wiley (1979).
8. Clarke, G., Wright, J.: Scheduling of vehicles from a central depot to a number of delivering points. Oper. Res. 12, 568-581 (1964).
9. Cordeau, J., Laporte, G., Savelsbergh, M., Vigo, D.: Vehicle routing. In: Barnhart, C., Laporte, G. (eds.) Handbook in Operations Research and Management Science, vol. 14, pp. 367-428. Elsevier, Amsterdam (2007).
10. Dantzig, G., Ramser, J.: The truck dispatching problem. Manage. Sci. 6, 80-91 (1959).
11. Faulin, J., Juan, A. A.: The algacea-1 method for the capacitated Vehicle Routing Problem. Int. Trans. Oper. Res. 15, 1-23 (2008).
12. Faulin, J., Gilibert, M., Juan, A. A., Ruiz, R., Vilajosana, X.: Sr-1: a simulation-based algorithm for the capacitated Vehicle Routing Problem. In: Proceedings of the 2008 Winter Simulation Conference (2008).
13. Feo, T., Resende, M.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109-133 (1995).
14. Fernández, P., García, L., Mayado, A., Sanchís, J.: A real delivery problem dealt with Monte Carlo techniques. Top 8, 57-71 (2000).
15. Festa, P., Resende, M.: An annotated bibliography of grasp-part I: algorithms. Int. Trans. Oper. Res. 16, 1-24 (2009).
16. Fisher, M.: The Lagrangean Relaxation method for solving integer programming problems. Manage. Sci. 27, 1-18 (1981).
17. Gaskell, T.: Bases for the vehicle fleet scheduling. Oper. Res. Q. 18, 281-295 (1967).
18. Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the Vehicle Routing Problem. Manage. Sci. 40, 1276-1290 (1994).
19. Guimarans, D., Herrero, R., Riera, D., Juan, A., Ramos, J.: Combining Constraint Programming, Lagrangian Relaxation and probabilistic algorithms to solve the Vehicle Routing Problem. In: Proceedings of the 17th RCRA International Workshop. Bologna, Italy (2010).
20. Guimarans, D., Herrero, R., Ramos, J., Padrón, S.: Solving vehicle routing problems using Constraint Programming and Lagrangean Relaxation in a metaheuristics framework. Int. J. Inf. Syst. Supply Chain Manage. 4(2), 61-81 (2011).
21. Hansen, P., Mladenovic, N.: A tutorial on variable neighborhood search. Tech. Rep. G-2003-46, Groupe d'Études et de Recherche en Analyse des Décisions (GERAD), Montreal, Canada. URL http://www.gerad.ca/fichiers/cahiers/G-2003-46.pdf (2003).
22. Hasle, G., Kloster, O.: Industrial vehicle routing. In: Hasle, G., Lie, K., Quak, E.: (eds.) Geometric Modelling, Numerical Simulation, and Optimization, pp. 397-435. Springer, Berlin (2007).
23. Held, M., Karp, R.: The travelling salesman problem and minimum spanning trees: part II. Math. Program. 1, 6-25 (1971).
24. Herrero, R., Ramos, J., Guimarans, D.: Lagrangean metaheuristic for the travelling salesman problem. In: Extended Abstracts of Operational Research Conference 52. Royal Holloway, University of London (2010).
25. Jin Ai, T., Kachitvichyanukul, V.: Particle swarm optimization and two solution representations for solving the capacitated Vehicle Routing Problem. Comput. Ind. Eng. 56, 380-387 (2009).
26. Juan, A., Faulin, J., Jorba, J., Grasman, S., Barrios, B.: Sr-2: a hybrid intelligent algorithm for the Vehicle Routing Problem. In: Proceedings of the 8th International Conference on Hybrid Intelligent Systems, pp. 78-83. IEEE Computer Society, Barcelona (2008).
27. Juan, A., Faulin, J., Ruiz, R., Barrios, B., Gilibert, M., Vilajosana, X.: Using oriented random search to provide a set of alternative solutions to the capacitated vehicle routing problem. In: Operations Research and Cyber-Infrastructure, pp. 331-346 (2009).
28. Juan, A., Faulin, J., Jorba, J., Riera, D., Masip, D., Barrios, B.: On the use of Monte Carlo Simulation, cache and splitting techniques to improve the Clarke and Wright savings heuristics. J. Oper. Res. Soc. 62, 1085-1097 (2011).
29. Juan, A., Faulin, J., Ruiz, R., Barrios, B., Caballe, S.: The SR-GCWS hybrid algorithm for solving the capacitated Vehicle Routing Problem. Appl. Soft Comput. 10(1), 215-224 (2010).
30. Laporte, G.: What you should know about the vehicle routing problem. Nav. Res. Logist. 54, 811-819 (2007).
31. Law, A.: Simulation Modeling & Analysis. McGraw-Hill, New York (2007).
32. Lin, S., Lee, Z., Ying, K., Lee, C.: Applying hybrid meta-heuristics for capacitated vehicle routing problem. Expert Syst. Appl. 2(36), 1505-1512 (2009).
33. Mester, D., Bräysy, O.: Active-guided evolution strategies for the large-scale capacitated Vehicle Routing Problems. Comput. Oper. Res. 34, 2964-2975 (2007).
34. Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097-1100 (1997).
35. Nagata, Y.: Edge assembly crossover for the capacitated Vehicle Routing Problem. Lect. Notes Comp. Sci. 4446, 142-153 (2007).
36. Prins, C.: A simple and effective evolutionary algorithm for the Vehicle Routing Problem. Comput. Oper. Res. 31, 1985-2002 (2004).
37. Reinelt, G.: The Traveling Salesman: computational solutions for TSP applications. Lecture Notes in Computer Science, vol. 840 (1994).
38. Resende, M.: Metaheuristic hybridization with Greedy Randomized Adaptive Search Procedures. In: Tutorials in Operations Research, pp. 295-319 (2008).
39. Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming. Elsevier, Amsterdam (2006).
40. Rousseau, L., Gendreau, M., Pesant, G.: Using constraint-based operators to solve the Vehicle Routing Problem with time windows. Journal of Heuristics 8, 43-58 (2002).
41. Savelsbergh, M.: Local search in routing problems with time windows. Ann. Oper. Res. 4, 285-305 (1985).
42. Savelsbergh, M.: Computer Aided Routing. Tech. rep., Centrum voor Wiskunde en Informatica (1988).
43. Taillard, E.: Parallel iterative search methods for vehicle routing problems. Networks 23, 661-673 (1993).
44. Tarantilis, C., Kiranoudis, C.: Boneroute: an adaptative memory-based method for effective fleet management. Ann. Oper. Res. 115, 227-241 (2002).
45. Toth, P., Vigo, D.: The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications. SIAM, Philadelphia (2002).
46. Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle routing problem. INFORMS J. Comput. 15, 333-346 (2003).
47. Yurtkuran, A., Emel, E.: A new hybrid electromagnetism-like algorithm for capacitated routing problems. Expert Syst. Appl. 37(4), 3427-3433 (2010). doi: 10. 1016/j. eswa. 2009. 10. 005.
48. Zachariadis, E., Kiranoudis, C.: A strategy for reducing the computational complexity of local search-based methods for the Vehicle Routing Problem. Comput. Oper. Res. 37, 2089-2105 (2010).
49. Zamani, R., Lau, S.: Embedding learning capability in Lagrangean Relaxation: an application to the travelling salesman problem. Eur. J. Oper. Res. 201(1), 82-88 (2010).