Skip to main content

On the Potentials of Parallelizing Large Neighbourhood Search for Rich Vehicle Routing Problems

  • Conference paper
Learning and Intelligent Optimization (LION 2010)

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

Included in the following conference series:

Abstract

In this paper we present preliminary results on parallelizing the Large Neighbourhood Search heuristic (LNS) for the Vehicle Routing Problem with Pickup and Delivery and Time Windows (VRPPDTW) using pb.net, a framework for easy and efficient parallelization of problem solving heuristics.

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

Access this chapter

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. Bartodziej, P.: pb.net: Konzeption, Design und Implementierung eines Frameworks zur Entwicklung von Heuristiken für Kombinatorische Probleme. PhD thesis, University of Cologne (2009)

    Google Scholar 

  2. Burke, E., Kendall, G., Soubeiga, E.: A Tabu Search Hyperheuristic for Timetabling and Rostering. Journal of Heuristics 9, 451–470 (2003)

    Article  Google Scholar 

  3. Li, H., Lim, A.: A metaheuristic for the pickup and delivery problem with time windows. International Journal on Artificial Intelligence Tools 12(2), 173–186 (2003)

    Article  Google Scholar 

  4. Ropke, S., Pisinger, D.: An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows. Transportation Science 40(4), 455–472 (2006)

    Article  Google Scholar 

  5. Ropke, S.: Parallel large neighborhood search - a software framework. In: MIC 2009: The VIII Metaheuristics International Conference (2009)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bartodziej, P., Derigs, U., Vogel, U. (2010). On the Potentials of Parallelizing Large Neighbourhood Search for Rich Vehicle Routing Problems. In: Blum, C., Battiti, R. (eds) Learning and Intelligent Optimization. LION 2010. Lecture Notes in Computer Science, vol 6073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13800-3_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13800-3_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13799-0

  • Online ISBN: 978-3-642-13800-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics