Advertisement

Journal of Heuristics

, Volume 12, Issue 1–2, pp 55–72 | Cite as

Path relinking for the vehicle routing problem

  • Sin C. Ho
  • Michel Gendreau
Article

Abstract

This paper describes a tabu search heuristic with path relinking for the vehicle routing problem. Tabu search is a local search method that explores the solution space more thoroughly than other local search based methods by overcoming local optima. Path relinking is a method to integrate intensification and diversification in the search. It explores paths that connect previously found elite solutions. Computational results show that tabu search with path relinking is superior to pure tabu search on the vehicle routing problem.

Keywords

Vehicle routing Tabu search Path relinking 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aiex, R.M., S. Binato, and M.G.C. Resende. (2003). “Parallel GRASP with Path-Relinking for Job Shop Scheduling.” Parallel Computing 29(4), 393–430.CrossRefMathSciNetGoogle Scholar
  2. Aiex, R.M., M.G.C. Resende, P.M. Pardalos, and G. Toraldo. (2005). “GRASP with Path-Relinking for the Three-Index Assignment Problem,” INFORMS Journal on Computing 17(2), 224–247.CrossRefMathSciNetGoogle Scholar
  3. Alfa, A.S., S.S. Heragu, and M. Chen. (1991). “A 3-opt Based Simulated Annealing Algorithm for Vehicle Routing Problems.” Computers & Industrial Engineering 21(1–4), 635–639.Google Scholar
  4. Berger, J. and M. Barkaoui. (2003). “A New Hybrid Genetic Algorithm for the Capacitated Vehicle Routing Problem.” Journal of the Operational Research Society 54(12), 1254–1262.CrossRefGoogle Scholar
  5. Bullnheimer, B., R.F. Hartl, and C. Strauss. (1998). “Applying the Ant System to the Vehicle Routing Problem.” In S. Voss, S. Martello, I. H. Osman, and C. Roucairol, (eds.), Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization, Boston: Kluwer, pp. 109–120.Google Scholar
  6. Bullnheimer, B., R.F. Hartl, and C. Strauss. (1999). “An Improved Ant System for the Vehicle Routing Problem.” Annals of Operations Research 89, 319–328.CrossRefMathSciNetGoogle Scholar
  7. Christofides, N. and S. Eilon. (1969). “An Algorithm for the Vehicle Dispatching Problem.” Operational Research Quarterly 20(3), 309–318.Google Scholar
  8. Christofdes, N., A. Mingozzi, and P. Toth. (1979). “The Vehicle Routing Problem.” In N. Christofdes, A. Mingozzi, P. Toth, and C. Sandi (eds.) Combinatorial Optimization, Wiley, Chichester, pp. 315–338.Google Scholar
  9. Cordeau, J.-F., M. Gendreau, A. Hertz, G. Laporte, and J.-S. Sormany. (2005). New Heuristics for the Vehicle Routing Problem. In A. Langevin and D. Riopel, (eds.), Logistics Systems: Design and Optimization. Boston: Kluwer.Google Scholar
  10. Cordeau, J.-F. and G. Laporte. (2004). Tabu Search Heuristics for the Vehicle Routing Problem. In C. Rego and B. Alidaee, (eds.), Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search. Boston: Kluwer, pp. 145–163.Google Scholar
  11. Cordeau, J.-F., G. Laporte, and A. Mercier. (2001). “A Unifed Tabu Search Heuristic for Vehicle Routing Problems with Time Windows.” Journal of the Operational Research Society 52(8), 928–936.Google Scholar
  12. Dongarra, J.J. (2004). Performance of Various Computers using Standard Linear Equations Software, Technical Report CS-89-85, Computer Science Department, University of Tennessee, Knoxville, TN.Google Scholar
  13. Ergun, Ö., J.B. Orlin, and A. Steele-Feldman. (2003). “Creating very Large Scale Neighborhoods out of Smaller ones by Compounding Moves: A Study on the Vehicle Routing Problem.” Technical report, Massachusetts Institute of Technology.Google Scholar
  14. Gendreau, M., A. Hertz, and G. Laporte. (1994). “A Tabu Search Heuristic for the Vehicle Routing Problem.” Management Science 40(10), 1276–1290.Google Scholar
  15. Gendreau, M., G. Laporte, and J.-Y. Potvin. (2002). Metaheuristics for the capacitated VRP, In P. Toth and D. Vigo (eds.), The Vehicle Routing Problem, SIAM Society for Industrial and Applied Mathematics, Philadelphia, pp. 129–154.Google Scholar
  16. Ghamlouche, I., T.G. Crainic, and M. Gendreau. (2004). “Path Relinking, Cycle-Based Neighbourhoods and Capacitated Multicommodity Network Design.” Annals of Operations Research 131(1-4), 109–133.CrossRefMathSciNetGoogle Scholar
  17. Glover, F. (1986). “Future Paths for Integer Programming and Links to Artificial Intelligence.” Computers & Operations Research13(5), 533–549.MATHMathSciNetGoogle Scholar
  18. Glover, F. (1997). “Tabu Search and Adaptive Memory Programming—Advances, Applications and Challenges.” in R. S. Barr, R. V. Helgason, and J. L. Kennington (eds.), Interfaces in Computer Science and Operations Research. Boston: Kluwer, pp. 1–75.Google Scholar
  19. Glover, F. (1998). “A Template for Scatter Search and Path Relinking,” in J.-K. Hao, E. Lutton, E. Ronald, M. Schoenauer and D. Snyers (eds), “Artificial Evolution.” Vol. 1363 of Lecture Notes in Computer Science, Springer, Berlin, pp. 13–54.Google Scholar
  20. Glover, F. and M. Laguna. (1993). Tabu search, In C. R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems. Oxford: Blackwell Scientific Publishing, pp. 70–150.Google Scholar
  21. Glover, F., M. Laguna, and R. Martí. (2000). “Fundamentals of Scatter Search and Path Relinking.” Control and Cybernetics 39(3), 653–684.Google Scholar
  22. Golden, B. L., E.A. Wasil, J.P. Kelly, and I.-M. Chao. (1998). Metaheuristics in Vehicle Routing, In T. G. Crainic and G. Laporte, eds, Fleet Management and Logistics. Boston: Kluwer, pp. 33-56.Google Scholar
  23. Kawamura, H., M. Yamamoto, T. Mitamura, K. Suzuki, and A. Ohuchi. (1998). “Cooperative Search on Pheromone Communication for Vehicle Routing problems.” IEEE Transactions on Fundamentals E81-A, 1089–1096.Google Scholar
  24. Laguna, M. and V.A. Armentano. (2005). Lessons from applying and experimenting with scatter search, In C. Rego and B. Alidaee, (eds.), Adaptive Memory and Evolution: Tabu Search and Scatter Search. Kluwer, Norwell, pp. 229–246.Google Scholar
  25. Li, F., B. Golden, and E. Wasil. (2005). “Very Large-scale Vehicle Routing: New test problems, algorithms, and results.” Computers & Operations Research 32(5), 1165–1179.Google Scholar
  26. Mester, D. and O. Bräysy. (2005). “Active Guided Evolution Strategies for the Large Scale Vehicle Routing Problems with Time Windows.” Computers & Operations Research 32(6), 1593–1614.CrossRefGoogle Scholar
  27. Oliveira, C. A., P.M. Pardalos, and M.G. Resende. (2004). GRASP with path-relinking for the quadratic assignment problem, In C. C. Ribeiro and S. L. Martins (eds.), Efficient and Experimental Algorithms. Vol. 3059 of Lecture Notes in Computer Science,Springer-Verlag, Berlin, pp. 356–368.Google Scholar
  28. Osman, I. H. (1993). “Metastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem.” Annals of Operations Research 41(1-4), 421–151.MATHGoogle Scholar
  29. Prins, C. (2004). “A Simple and Effective Evolutionary Algorithm for the Vehicle Routing Problem.” Computers & Operations Research 31(12), 1985–2002.CrossRefMATHMathSciNetGoogle Scholar
  30. Rego, C. (1998). “A Subpath Ejection Method for the Vehicle Routing Problem.” Management Science44(10), 1447-1459.MATHGoogle Scholar
  31. Rego, C. and C. Roucairol. (1996), “A Parallel Tabu Search Algorithm using Ejection Chains for the Vehicle Routing Problem,” In I. H. Osman and J. P. Kelly (eds), Meta-Heuristics: Theory and Applications, Boston: Kluwer, MA, pp. 661–675.Google Scholar
  32. Reimann, M. (2004). “Private Communication”.Google Scholar
  33. Reimann, M., K. Doerner, and R.F. Hartl. (2004). “D-Ants: Savings Based Ants Divide and Conquer the Vehicle Routing Problem.” Computers & Operations Research 31(4), 563–591.CrossRefGoogle Scholar
  34. Resende, M.G.C. and C.C. Ribeiro. (2003). “A GRASP with Path-relinking for Private Virtual Circuit Routing.” Networks 41(2), 104–114.CrossRefMathSciNetGoogle Scholar
  35. Rochat, Y. and É.D. Taillard. (1995). “Probabilistic Diversification and Intensification in Local Search for Vehicle Routing.” Journal of Heuristics 1(1), 147–167.Google Scholar
  36. Souza, M. C., C. Duhamel, and C.C. Ribeiro. (2003). “A GRASP Heuristic for the Capacitated Minimum Spanning tree Problem using a Memory-Based Local Search Strategy,” In M. G. C. Resende and J. P. Sousa, (eds.), Metaheuristics: Computer Decision-Making. Boston: Kluwer Academic Publishers, pp. 627–658.Google Scholar
  37. Taillard, É.D. (1993). “Parallel Iterative Search Methods for Vehicle Routing Problems.” Networks 23(8), 661–673.MATHGoogle Scholar
  38. Tarantilis, C. D. (2005). “Solving the Vehicle Routing Problem with Adaptive Memory Programming Methodology.” Computers & Operations Research32(9), 2309–2327.CrossRefMATHMathSciNetGoogle Scholar
  39. Toth, P. and D. Vigo. (2003). “The Granular Tabu Search and its Application to the Vehicle-Routing Problem.” Journal on Computing 15(4), 333–346.MathSciNetGoogle Scholar
  40. Toth, P. and D. Vigo, (eds.), (2002). The Vehicle Routing Problem, SIAM Society for Industrial and Applied Mathematics, Philadelphia.Google Scholar
  41. Xu, J. and J.P. Kelly. (1996). “A Network flow-based Tabu Search Heuristic for the Vehicle Routing Problem.” Transportation Science 30(4), 379–393.Google Scholar

Copyright information

© Springer Science + Business Media, Inc. 2006

Authors and Affiliations

  1. 1.Department of InformaticsUniversity of BergenBergenNorway
  2. 2.Centre de recherche sur les transports and Département d'informatique et de recherche opérationnelleUniversité de MontréalCanada

Personalised recommendations