Skip to main content
SpringerLink
Log in
Book cover

Operations Research Proceedings 2004 pp 174–183Cite as

Ein praxistauglicher Ansatz zur Lösung eines spezifischen D-VRSP-TW-UC

  • Conference paper

  • 6667 Accesses

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

Abstract

In der Regel wachsen die Transportkosten auf der letzten Meile mit der Enge des Lieferzeitfensters. Dies stellt insbesondere Anbieter vor ein Problem, die Aussagen über einen präzisen Liefertermin bei Bestellung abgeben müssen, obwohl noch nicht alle zu bedienenden Lieferungen bekannt sind.

Im folgenden Beitrag wird das Problem als D-VRSP-TW-UC-DO modelliert. Motiviert durch die raum-zeitliche Analyse der Solomoninstanzen wird der Begriff der Gleichzeitigkeit als wesentlicher Kostentreiber herausgearbeitet. Anschließend wird ein praxistaugliches Verfahren (ORA) vorgestellt, das es ermöglicht, eine hohe Avisgenauigkeit bei Bestellung zu erlangen. SchlieBlich werden typische Ergebnisse des Verfahrens dargestellt und diskutiert.

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   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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.

Literatur

  • Bent, Russel W.; Van Hentenryck, Pascal (2003) Scenario Based Planning for Partially Dynamic Vehicle routing with Stochastic Customers [online], Department of Computer Science; Brown University Providence, RI 02912; www.cs.brown.edu/people/rbent/ORsr.pdf

    Google Scholar 

  • Bent, R.; Van Hentenryck, P. (2001) A Two-Stage Hybrid Local Search for the VRP-TW, Technical Report CS-01-06, Department of Computer Science, Brown University

    Google Scholar 

  • Berger, Jean; Salois, Martin; Begin, Regent (1998) A hybrid genetic algorithm for the VRP-TW, Proceedings of the 12th Bienneal Conference of the Canadian Society for Computational Studies of Intelligence, S. 114–127, Springer Verlag, Berlin

    Google Scholar 

  • Bräysy, Olli (2001), Genetic Algorithms for the VRP-TW, Arpakannus 1/2001 Special issue on Bioinformatics and Genetic Algorithms; S33–38

    Google Scholar 

  • Chao, I-Ming, Golden, Bruce L., Wasil, Edward A. (1996) The team orienteering problem, European Journal of Operations Research 88, S. 464–474

    Article  Google Scholar 

  • Cordeau, Jean-Francois; Laporte, Gilbert; Mercier, Alain (2000) Unified tabu search heuristic for VRP-TW, Publication CRT-2003-03; University of Montreal, Canada

    Google Scholar 

  • Erera, Alan L.; Daganzo Carlos F. (2000) Coordinated vehicle routing with uncertain demand; presentation at ROUTE 2000 — International workshop on vehicle routing, Skodsborg (Denmark), August 16–19; 2000

    Google Scholar 

  • Gambardella, Luca M.; Taillard, Eric; Agazzi, Giovanni (1999) MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows New Ideas in Optimization; S. 63–76, McGraw-Hill, London

    Google Scholar 

  • Gendreau, Michel; Laporte, Gilbert; Séguin, René (1996), A Tabu search heuristic for the vehicle routing problem with stochastic demands and customers; Operations Research 44-3, S.469–477

    Google Scholar 

  • Homberger, J.; Gehring, H. (1999) Two evolutionary meta-heuristics for the VRP-TW, INFOR, Vol. 37, S.297–318

    Google Scholar 

  • Kunze, Oliver (2003) A new interactive approach on route planning with tight delivery time windows, Proceedings of the 3rd International Conference on City Logistics, Madeira, Portugal (June 25th–27th, 2003)

    Google Scholar 

  • Potvin, Jean-Yves; Bangio, Samy (1996) The VRP-TW part II: genetic search, Journal on Computing, 8(2) S. 165–172

    Google Scholar 

  • Rousseau, L. M.; Gendreau, M.; Pesant, G. (forthcoming) Using Constraint-Based Operators to solve the VRP-TW, Journal of Heuristics

    Google Scholar 

  • Solomon, M. (1984) Vehicle Routine and Scheduling with Time Window Constraints: Models and Algorithms, Dissertation, Department of Decision Sciences, University of Pennsylvania, Philadelphia

    Google Scholar 

  • Thangiah, Sam (1995) Vehicle routing with time windows using genetic algorithms, Application Handbook of Genetic Algorithms: New Frontiers, Volume II, S.253–277, CRC Press, Boca Raton

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. c/o PTV AG, D-76131, Karlsruhe, Stumpfstr. 1

    Oliver Kunze

Authors
  1. Oliver Kunze
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Warandelaan 2, 5037 AB, Tilburg, The Netherlands

    Hein Fleuren , Dick den Hertog  & Peter Kort ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kunze, O. (2005). Ein praxistauglicher Ansatz zur Lösung eines spezifischen D-VRSP-TW-UC. 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_22

Download citation

Publish with us

Policies and ethics

Search

Navigation