[go: up one dir, main page]
More Web Proxy on the site http://driver.im/
Skip to main content

Router: A Fast and Flexible Local Search Algorithm for a Class of Rich Vehicle Routing Problems

  • Conference paper
Operations Research Proceedings 2004

Part of the book series: Operations Research Proceedings ((ORP,volume 2004))

Abstract

We describe a flexible indirect search procedure which we have applied for solving a special pick-up and delivery vehicle routing problem with time windows. The heuristic is based on an encoding of a solution as a sequence/permutation of tasks, a cheapest insertion decoding procedure, and, a threshold-accepting like local search meta-heuristic.

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

Access this chapter

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
GBP 19.95
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
GBP 103.50
Price includes VAT (United Kingdom)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
GBP 129.99
Price includes VAT (United Kingdom)
  • 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.

Similar content being viewed by others

References

  1. G. Dueck and T. Scheuer (1990), Threshold Accepting: A General Purpose Optimization Algorithm Appearing Superior to Simulated Annealing. Journal of Computational Physics 90: 161–175.

    Article  MathSciNet  Google Scholar 

  2. J. Gottlieb (2001), Evolutionary Algorithms for Constrained Optimization Problems. Shaker Verlag, Aachen.

    Google Scholar 

  3. P. Toth and D. Vigo (2002), The Vehicle Routing Problem. SIAM Monograph on Discrete Mathematics and Applications.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Derigs, U., Döhmer, T. (2005). Router: A Fast and Flexible Local Search Algorithm for a Class of Rich Vehicle Routing Problems. In: Fleuren, H., den Hertog, D., Kort, P. (eds) Operations Research Proceedings 2004. Operations Research Proceedings, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27679-3_18

Download citation

Publish with us

Policies and ethics