Skip to main content
SpringerLink
Log in

A Variable Neighborhood Search Integrated in the POPMUSIC Framework for Solving Large Scale Vehicle Routing Problems

  • Conference paper
Hybrid Metaheuristics (HM 2008)

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

Included in the following conference series:

Abstract

This paper presents a heuristic approach based on the POPMUSIC framework for solving large scale Multi Depot Vehicle Routing Problems with Time Windows derived from real world data. A Variable Neighborhood Search is used as the optimizer in the POPMUSIC framework. POPMUSIC is a new decomposition approach for large scale problems. We compare our method with a pure VNS approach and a Memetic Algorithm integrated in a POPMUSIC framework. The computational results show that the integration of VNS in the POPMUSIC framework outperforms the other existing methods. Furthermore different distance metrics for the decomposition strategies are presented and the results are reported and analyzed.

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

Access this chapter

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 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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  Google Scholar 

  2. Cordeau, J.-F., Laporte, G., Mercier, A.: A unified tabu search heuristic for the vehicle routing problems with time windows. Journal of the Operation Research Society 52, 928–936 (2001)

    Article  MATH  Google Scholar 

  3. Flaberg, T., Hasle, G., Kloster, O., Riise, A.: Towards solving hughe-scale vehicle routing problems for household type applications. In: Workshop presentation in Network Optimization Workshop Saint-Remy de Provence, France (August 2006)

    Google Scholar 

  4. Fleszar, K., Osman, I.H., Hindi, K.S.: A variable neighbourhood search algorithm for the open vehicle routing problem. European Journal of Operational Research (2008) (accepted for publication)

    Google Scholar 

  5. Gillet, B., Miller, L.: A heuristic algorithm for the dispatch problem. Operations Research 22, 340–349 (1974)

    Article  Google Scholar 

  6. Hansen, P., Mladenović, N.: An introduction to variable neighborhood search. In: Voss, S., Martello, S., Osman, I.H., Roucairol, C. (eds.) Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 433–458. Kluwer Academic Publishers, Dordrecht (1999)

    Chapter  Google Scholar 

  7. Hemmelmayr, V.C., Doerner, K.D., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research (2008) (accepted for publication)

    Google Scholar 

  8. Homberger, J., Gehring, H.: A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research 162, 220–238 (2005)

    Article  MATH  Google Scholar 

  9. Kytöjoki, J., Nuortio, T., Bräysy, O., Gendreau, M.: An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers & Operations Research 34, 2743–2757 (2007)

    Article  MATH  Google Scholar 

  10. Lin, S.: Computer solutions of the traveling salesman problem. Bell System Technical Journal 44, 2245–2269 (1965)

    Article  MathSciNet  MATH  Google Scholar 

  11. 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  MATH  Google Scholar 

  12. 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 

  13. Ostertag, A., Hartl, R.F., Doerner, K.F., Taillard, E.D., Waelti, P.: Popmusic for a real world large scale vehicle routing problem with time windows. Journal of the Operational Research Society (2008) (accepted for publication)

    Google Scholar 

  14. Polacek, M., Doerner, K., Hartl, R.F., Maniezzo, V.: A variable neigborhood search for the capacitated arc routing problem with intermediate facilities. Journal of Heuristics (2008) (accepted for publication)

    Google Scholar 

  15. Polacek, M., Hartl, R.F., Doerner, K., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics 10, 613–627 (2004)

    Article  Google Scholar 

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

    Article  MATH  Google Scholar 

  17. Taillard, E.D., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science 31, 170–186 (1997)

    Article  MATH  Google Scholar 

  18. Taillard, E.D., Voss, S.: Popmusic: Partial optimization metaheuristic under special intensification conditions. In: Ribeiro, C., Hansen, P. (eds.) Essays and surveys in metaheuristics, pp. 613–629. Kluwer Academic Publishers, Dordrecht (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Business Administration, University of Vienna, Bruenner Strasse 72, 1210, Vienna, Austria

    Alexander Ostertag, Karl F. Doerner & Richard F. Hartl

Authors
  1. Alexander Ostertag
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Karl F. Doerner
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Richard F. Hartl
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Barcelona, Spain

    María J. Blesa  & Christian Blum  & 

  2. Dept. LCC, Universidad de Málaga, Spain

    Carlos Cotta

  3. ETSI Informática, Universidad de Málaga, Málaga, Spain

    Antonio J. Fernández

  4. Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, Universidad de Málaga, Málaga, Spain

    José E. Gallardo

  5. DEIS, Università di Bologna, Cesena, Italy

    Andrea Roli

  6. Université Libre de Bruxelles, IRIDIA CP 194/6, Avenue Franklin D. Roosevelt 50, 1050, Bruxelles, Belgium

    Michael Sampels

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ostertag, A., Doerner, K.F., Hartl, R.F. (2008). A Variable Neighborhood Search Integrated in the POPMUSIC Framework for Solving Large Scale Vehicle Routing Problems. In: Blesa, M.J., et al. Hybrid Metaheuristics. HM 2008. Lecture Notes in Computer Science, vol 5296. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88439-2_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-88439-2_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-88438-5

  • Online ISBN: 978-3-540-88439-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation