Skip to main content
SpringerLink
Log in

Autonomous Decision Model Adaptation and the Vehicle Routing Problem with Time Windows and Uncertain Demand

  • Chapter
Understanding Autonomous Cooperation and Control in Logistics

Abstract

The instruction of resources in logistic systems in order to ensure an effective as well as efficient usage is a very sophisticated task. At lot of data and requirements have to be considered simultaneously. For this reason computerized decision support (Makowski 1994) is strongly recommended (Bramel and Simchi-Levi 1997; Crainic and Laporte 1998).

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 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
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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

  • Ausiello G, Feuerstein E, Leonardi S, Stougie L, Talamo M (2001) Algorithms for the On-Line Travelling Salesman. Algorithmica 29: 560–581

    Article  MATH  MathSciNet  Google Scholar 

  • Bertsimas DJ, van Ryzin G (1989) The Dynamic Traveling Repairman Problem. MIT Sloan School Working Paper No. 3036-89-MS

    Google Scholar 

  • Bianchi L, Birattari M, Chiarandini M, Manfrin M, Mastrolilli M, Paquete L, Rossi-Doria O, Schiavinotto T (2005) Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands. Technical Report No. IDSIA-0605

    Google Scholar 

  • Bramel J, Simchi-Levi D (1997) The Logic of Logistics. Springer, New York

    MATH  Google Scholar 

  • Brotcorne L, Laporte G, Semet F (2003) Ambulance location and relocation models. European Journal of Operational Research 147: 451–463

    Article  MATH  MathSciNet  Google Scholar 

  • Chen Z-L, Xu H (2006) Dynamic Column Generation for Dynamic Vehicle Routing with Time Windows. Transportation Science 40(1): 74–88

    Article  Google Scholar 

  • Clifton C, Iyer A, Uzsoy R (2002) A Prototype Integrated Transaction Data Analysis and Visualization Environment for the Transportation, Distribution and Logistics Sector. Purdue University, Indiana, USA

    Google Scholar 

  • Crainic T, Laporte G (1997) Planning models for freight transportation. European Journal of Operational Research 97: 409–438

    Article  MATH  Google Scholar 

  • Crainic T, Laporte G (1998) Fleet Management and Logistics.

    Google Scholar 

  • Kluwer Fiat A, Woeginger G J (1998) Online Algorithms — The State of the Art. Springer, Berlin Heidelberg

    Google Scholar 

  • Fleischmann B, Gnutzmann S, Sandvoß E (2004) Dynamic Vehicle Routing Based on Online Traffic Information. Transportation Science 38(4): 420–433

    Article  Google Scholar 

  • Gayialis S, Tatsiopoulos I (2004) Design of an IT-driven decision support system for vehicle routing and scheduling. European Journal of Operational Research 152: 382–298

    Article  MATH  Google Scholar 

  • Gendreau M, Guertin F, Potvin J-Y, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science 33(4): 381–390

    MATH  Google Scholar 

  • Gendreau M; Potvin J-Y (1998) Dynamic Vehicle Routing and Dispatching. In: Crainic T G; Laporte G.: Fleet Management and Logistics: 115–126

    Google Scholar 

  • Ghiani G, Guerriero F, Laporte G, Musmanno R (2003) Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. European Journal of Operational Research 151(1): 1–11

    Article  MATH  Google Scholar 

  • Gutenschwager K, Niklaus C, Voß S (2004) Dispatching of an Electric Monorail System: Applying Metaheuristics to an Online Pickup and Delivery Problem. Transportation Science 38(4): 434–446

    Article  Google Scholar 

  • Hiller B, Krumke S O, Rambau J (2005) Reoptimisation Gaps versus Model Erros in Online-Dispatching of Service Units for ADAC. Submitted for publication in Discrete Applied Mathematics

    Google Scholar 

  • Holzer M (2003) Hierarchical Speed-up Techniques for Shortest-Path Algorithms. Diploma Thesis, University of Konstanz, Germany

    Google Scholar 

  • Ibaraki T, Nonobe K, Yagiura M (2005) Metaheuristics: Progress as Real Problem Solvers. Springer, Heidelberg

    Book  MATH  Google Scholar 

  • Irani, S, Lu, X, Regan, A (2004) On-line Algorithms for the dynamic traveling repairman problem. Journal of Scheduling 7: 243–258

    Article  MathSciNet  MATH  Google Scholar 

  • Jaillet P (1988) A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited, Operations Research, 36(6): 929–936

    MATH  MathSciNet  Google Scholar 

  • Jaillet P, Odoni A R (1988) The Probabilistic Vehicle Routing Problem. In: Golden B L, Assad A A (eds.) Vehicle Routing: Methods and Studies, North-Holland: 293–318

    Google Scholar 

  • Jensen M T (2001) Robust and Flexible Scheduling with Evolutionary Computation. PhD Dissertation, University of Aarhus, Denmark

    Google Scholar 

  • Kopfer H, Schönberger J (2006) Adaptive Optimierung: Selbststeuernde Anpassung einer operativen Transportkostenoptimierung an strategische Qualitätsziele. In: Jacquemin M, Pipernik R, Sucky E (eds.) Quantitative Methoden der Logistik und des Supply Chain Management, Verlag Dr. Kovac: 321–337

    Google Scholar 

  • Krumke, S (2001) Online-Optimisation — Competitive Analysis and Beyond. Habilitation Thesis, Technical University Berlin, Germany.

    Google Scholar 

  • Lackner, A (2004) Dynamische Tourenplanung mit ausgewählten Metaheuristiken. Cuvilier Verlag Göttingen.

    Google Scholar 

  • Makowski, M. (1994) Design and Implementation of Model-based Decision Support Systems. Working Paper WP-94-86, IIASA

    Google Scholar 

  • Michalewicz Z, Fogel D B (2004) How to Solve It: Modern Heuristics. 2nd Edition. Springer, Heidelberg

    MATH  Google Scholar 

  • MitroviĆ-MiniĆ S, Krishnamurti R, Laporte G (2004) Double-horizon based heuristic for the dynamic pickup and delivery problem with time windows. Transportation Research B 38: 635–655

    Article  Google Scholar 

  • Pankratz G (2002) Speditionalle Transportdisposition. DUV

    Google Scholar 

  • Psaraftis H (1988) Dynamic vehicle routing problems. In: Golden B L, Assad A A (eds) Vehicle Routing: Methods and Studies, North-Holland: 223–248

    Google Scholar 

  • Psaraftis H (1995) Dynamic vehicle routing: status and prospects. Annals of Operations Research 61: 143–164

    Article  MATH  Google Scholar 

  • Sandvoss E (2004) Dynamische Tourenplanung auf Basis von Online-Verkehrs-Informationen. ProBusiness

    Google Scholar 

  • Savelsbergh M, Sol M (1998) DRIVE: Dynamic Routing of Independent Vehicles. Operations Research 46:474–490

    MATH  Google Scholar 

  • Schönberger J, Kopfer H (2007) On Decision Model Adaptation in Online Optimisation of a Transport System. Accepted for publication in the proceedings of the conference Supply Networks and Logistics Management — Decision Support, Information Systems and OR Tools

    Google Scholar 

  • Schönberger J (2005) Operational Freight Carrier Planning. Springer

    Google Scholar 

  • Séguin R, Potvin J-Y, Gendreau M, Crainic T G, Marcotte P (1997) Real-time decision problems: an operational research perspective. Journal of the Operational Research Society 48(2):162–174

    Article  MATH  Google Scholar 

  • Slater A (2002) Specification for a dynamic vehicle routing and scheduling system. International Journal of Transport Management 1: 29–40

    Article  MathSciNet  Google Scholar 

  • Solomon M (1987) The vehicle routing and scheduling problems with time window constraints. Operations Research 35(2): 254–265

    Article  MATH  MathSciNet  Google Scholar 

  • Williams H P (1999) Model Building in Mathematical Programming. 4th Edition. Wiley, Chichester

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bremen, Germany

    Jörn Schönberger (Chair of Logistics) & Herbert Kopfer

Authors
  1. Jörn Schönberger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Herbert Kopfer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty 07: Business Studies and Economics, University of Bremen, Wilhelm-Herbst-Str. 12, 28359, Bremen, Germany

    Michael Hülsmann

  2. Bremen Institute of Industrial Technology and Applied Work Science, University of Bremen, Hochschulring 20, 28359, Bremen, Germany

    Katja Windt

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Schönberger, J., Kopfer, H. (2007). Autonomous Decision Model Adaptation and the Vehicle Routing Problem with Time Windows and Uncertain Demand. In: Hülsmann, M., Windt, K. (eds) Understanding Autonomous Cooperation and Control in Logistics. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-47450-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-47450-0_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47449-4

  • Online ISBN: 978-3-540-47450-0

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation