Skip to main content
SpringerLink
Log in
Book cover

Bio-inspired Algorithms for the Vehicle Routing Problem pp 35–53Cite as

A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem

  • Chapter

Part of the book series: Studies in Computational Intelligence ((SCI,volume 161))

Summary

This chapter proposes new VRP heuristics based on Iterated Local Search (ILS): a pure ILS, a version with several offspring solutions per generation, called Evolutionary Local Search or ELS, and hybrid forms GRASP×ILS and GRASP×ELS. These variants share three main features: a simple structure, an alternation between solutions encoded as giant tours and VRP solutions, and a fast local search based on a sequential decomposition of moves. The proposed methods are tested on the Christofides et al. (1979) and Golden et al. (1998) instances. Our best algorithm is the GRASP×ELS hybrid. On the first set, if only one run with the same parameters is allowed, it outperforms all recent heuristics except the AGES algorithm of Mester and Bräysy (2007). Only AGES and the SEPAS method of Tarantilis (2005) do better on the second set, but GRASP×ELS improves two best-known solutions. Our algorithm is also faster than most VRP metaheuristics.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   139.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   179.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barr, R.S., Golden, B.L., Kelly, J.P., Resende, M.G.C., Stewart Jr., W.R.: Designing and reporting on computational experiments with heuristic methods. Journal of Heuristics 1, 9–32 (1995)

    Article  MATH  Google Scholar 

  2. Beasley, J.E.: Route-first cluster-second methods for vehicle routing. Omega 11, 403–408 (1983)

    Article  Google Scholar 

  3. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315–338. Wiley, Chichester (1979)

    Google Scholar 

  4. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581 (1964)

    Google Scholar 

  5. Cordeau, J.F., Gendreau, M., Hertz, A., Laporte, G., Sormany, J.S.: New heuristics for the vehicle routing problem. In: Langevin, A., Riopel, D. (eds.) Logistic Systems: Design and Optimization, pp. 279–298. Wiley, Chichester (2005)

    Chapter  Google Scholar 

  6. Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)

    MATH  Google Scholar 

  7. Dongarra, J.J.: Performance of various computers using standard linear equations software. Technical Report CS-89-85, Computer Science Department, University of Tennessee (2006)

    Google Scholar 

  8. Ergun, O., Orlin, J.B., Steele-Feldman, A.: 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 (2003)

    Google Scholar 

  9. Feo, T.A., Bard, J.: Flight scheduling and maintenance base planning. Management Science 35, 1415–1432 (1989)

    Article  MathSciNet  Google Scholar 

  10. Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. Journal of Global Optimization 6, 109–133 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  11. Fukasawa, R., Lysgaard, J., Poggi de Aragão, M., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming 106, 491–511 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  12. Glover, F., Laguna, M.: Tabu search. Kluwer, Dordrecht (1997)

    MATH  Google Scholar 

  13. Golden, B.L., Wasil, E.A., Kelly, J.P., Chao, I.M.: The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets and computational results. In: Crainic, T.G., Laporte, G. (eds.) Fleet management and logistics, pp. 33–56. Kluwer, Dordrecht (1998)

    Google Scholar 

  14. Irnich, S., Funke, B., Grünert, T.: Sequential search and its application to vehicle-routing problems. Computers & Operations Research 33, 2405–2429 (2006)

    Article  MATH  Google Scholar 

  15. Labadi, N., Prins, C., Reghioui, M.: GRASP with path relinking for the capacitated arc routing problem with time windows. In: Giacobini, M. (ed.) EvoWorkshops 2007. LNCS, vol. 4448, pp. 722–731. Springer, Heidelberg (2007)

    Google Scholar 

  16. Laporte, G., Gendreau, M., Potvin, J.Y., Semet, F.: Classical and modern heuristics for the vehicle routing problem. International Transactions in Operational Research 7, 285–300 (2000)

    Article  MathSciNet  Google Scholar 

  17. Lourenço, H.R., Martin, O., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of metaheuristics, pp. 321–353 (2002)

    Google Scholar 

  18. Mester, D., Bräysy, O.: Active guided evolution strategies for large scale vehicle routing problems with time windows. Computers & Operations Research 32, 1593–1614 (2005)

    Article  Google Scholar 

  19. Mester, D., Bräysy, O.: Active guided evolution strategies for large scale capacitated vehicle routing problems. Computers & Operations Research 34, 2964–2975 (2007)

    Article  MATH  Google Scholar 

  20. Pisinger, D., Röpke, S.: A general heuristic for vehicle routing problems. Computers & Operations Research 34, 2403–2435 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  21. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 31, 1985–2002 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  22. Reimann, M., Doerner, K., Hartl, R.F.: D-ants: savings based ants divide and conquer the vehicle routing problem. Computers & Operations Research 31, 563–591 (2004)

    Article  MATH  Google Scholar 

  23. Rochat, Y., Taillard, E.: Probabilistic diversification and intensification in local search for vehicle routing. Journal of Heuristics 1, 147–167 (1995)

    Article  MATH  Google Scholar 

  24. Tarantilis, C.D.: Solving the vehicle routing problem with adaptive memory programming methodology. Computers & Operations Research 32, 2309–2327 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  25. Tarantilis, C.D., Kiranoudis, C.T.: Bone route: an adaptive memory-based method for effective fleet management. Annals of Operations Research 115, 227–241 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  26. Toth, P., Vigo, D.: The vehicle routing problem. SIAM, Philadelphia (2002)

    MATH  Google Scholar 

  27. Wolf, S., Merz, P.: Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HCI/ICCV 2007. LNCS, vol. 4771, pp. 1–15. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute Charles Delaunay, University of Technology of Troyes (UTT), BP 2060, 10010, Troyes Cedex, France

    Christian Prins

Authors
  1. Christian Prins
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Francisco Babtista Pereira Jorge Tavares

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Prins, C. (2009). A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem. In: Pereira, F.B., Tavares, J. (eds) Bio-inspired Algorithms for the Vehicle Routing Problem. Studies in Computational Intelligence, vol 161. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85152-3_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85152-3_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85151-6

  • Online ISBN: 978-3-540-85152-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation