Skip to main content

Flexible Variable Neighborhood Search in Dynamic Vehicle Routing

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6624))

Abstract

Many optimization problems are dynamic, which means that the available data may change while the problem is being solved. Incorporating elements into the algorithm that take into account these changes usually leads to more effective algorithms which provide better solutions. In this work, we propose a flexibility strategy for the Vehicle Routing Problem with Dynamic Requests. We show that early decissions, which are taken in the beginning of the optimization process, influence the quality of final solutions for the dynamic problem. Our flexible algorithm provides better results than the canonical one and is competitive with the results in the literature.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
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. Branke, J., Mattfeld, D.C.: Anticipation and flexibility in dynamic scheduling. International Journal of Production Research 43(15), 3103–3129 (2005)

    Article  Google Scholar 

  2. Dantzig, G., Ramser, J.: The truck dispatching problem. Operations Research, Management Sciences 6(1), 80–91 (1959)

    MathSciNet  MATH  Google Scholar 

  3. Francis, P., Smilowitz, K., Tzur, M.: The period vehicle routing problem with service choice. Transportation Science 40, 439–454 (2006)

    Article  Google Scholar 

  4. Hansen, P., Mladenović, N.: An introduction to variable neighborhood search. In: Metaheuristics: Advances and Trends in Local Search Paradigms for Optimization, ch. 30, pp. 433–458. Kluwer Academic Publishers, Dordrecht (1999)

    Chapter  Google Scholar 

  5. Hanshar, F., Ombuki-Berman, B.: Dynamic vehicle routing using genetic algorithms. Applied Intelligence 27, 89–99 (2007)

    Article  MATH  Google Scholar 

  6. Hashimoto, H., Ibaraki, T., Imahori, S., Yagiura, M.: The VRP with flexible time windows and traveling times. Discrete Appl. Math. 154, 2271–2290 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  7. Jans, R., Degraeve, Z.: Meta-heuristics for dynamic lot sizing: A review and comparison of solution approaches. European Journal of Operational Research 177(3), 1855–1875 (2007)

    Article  MATH  Google Scholar 

  8. Khouadjia, M., Alba, E., Jourdan, L., Talbi, E.G.: Multi-swarm optimization for dynamic combinatorial problems: A case study on dynamic vehicle routing problem. In: Dorigo, M., Birattari, M., Di Caro, G.A., Doursat, R., Engelbrecht, A.P., Floreano, D., Gambardella, L.M., Groß, R., Şahin, E., Sayama, H., Stützle, T. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 227–238. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Kilby, P., Prosser, P., Shaw, P.: Dynamic VRPs: A study of scenarios. APES-06-1998, University of Strathclyde, U.K (1998)

    Google Scholar 

  10. Kok, A., Meyer, C., Kopfer, H., Schutten, J.: A dynamic programming heuristic for the vehicle routing problem with time windows and the european community social legislation. Transportation Science (2010)

    Google Scholar 

  11. Montemanni, R., Gambardella, L., Rizzoli, A., Donati, A.: A new algorithm for a dynamic vehicle routing problem based on ant colony system. Journal of Combinatorial Optimization 10, 327–343 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  12. Psaraftis, H.: Dynamic vehicle routing: status and prospects. Annals of Opertations Reasearch 61, 143–164 (1995)

    Article  MATH  Google Scholar 

  13. Scheffermann, R., Bender, M., Cardeneo, A.: Robust solutions for vehicle routing problems via evolutionary multiobjective optimization. In: Proceedings of the 11th Congress on Evolutionary Computation, pp. 1605–1612 (2009)

    Google Scholar 

  14. Snoek, M.: Anticipation optimization in dynamic job shops. In: Proceedings of the 2001 Genetic and Evolutionary Computation Conference (2001)

    Google Scholar 

  15. Sörensen, K.: A framework for robust and flexible optimization using meta-heuristics with applications in supply chain design. Ph.D. thesis, Antwerp (2003)

    Google Scholar 

  16. Sörensen, K., Sevaux, M.: A practical approach for robust and flexible vehicle routing using metaheuristics and monte carlo sampling. Journal of Mathematical Modelling and Algorithms 8, 387–407 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sarasola, B., Khouadjia, M.R., Alba, E., Jourdan, L., Talbi, EG. (2011). Flexible Variable Neighborhood Search in Dynamic Vehicle Routing. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2011. Lecture Notes in Computer Science, vol 6624. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-20525-5_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-20525-5_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-20524-8

  • Online ISBN: 978-3-642-20525-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics