Skip to main content

Dispatching multi-load AGVs in highly automated seaport container terminals

  • Chapter

Abstract

This paper is concerned with AGV dispatching in seaport container terminals. Special attention is given to multi-load vehicles which can carry more than one container at a time. The characteristics of this complex application environment and the impact on the AGV dispatching problem are analyzed and various solution techniques considered. For practical application within an online logistics control system, a flexible priority rule based approach is developed, making use of an extended concept of the availability of vehicles. For evaluation reasons, this approach is complemented by an alternative MILP formulation. Finally, the performance of the priority rule based approach and the MILP model are analysed for different scenarios with respect to total lateness of the AGVs. The main focus of the numerical investigation is on evaluating the priority rule based approach for single and dual-load vehicles as well as comparing its performance against the MILP modelling approach.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Achuthan N R, Caccetta L, Hill S P (1996) A new subtour elimination constraint for the vehicle routing problem. European Journal of Operational Research 91: 573–586

    Article  Google Scholar 

  • Angelelli E, Speranza M G (2002) The periodic vehicle routing problem with intermediate facilities. European Journal of Operational Research 137: 233–247

    Article  Google Scholar 

  • Bae J W, Kim K H (2000) A pooled dispatching strategy for automated guided vehicles in port container terminals. International Journal of Management Science 6: 47–67

    Google Scholar 

  • Bard J F, Kontoravdis G, Yu G (2002) A branch-and-cut procedure for the vehicle routing problem with time windows. Transportation Science 36: 250–259

    Article  Google Scholar 

  • Bilge Ü, Tanchoco J M A (11997) AGV Systems with multi-load carriers: basic issues and potential benefits. Journal of Manufacturing Systems 16: 159–174

    Google Scholar 

  • Carlton W B, Barnes J W (1996) Solving the traveling-salesman problem with time windows using tabu search. IIE Transactions 28: 617–629

    Google Scholar 

  • Chung R K, Li C L, Lin W (2002) Interblock crane deployment in container terminals. Transportation Science 36: 79–93

    Google Scholar 

  • Desrosiers J, Dumas Y, Soumis F (1989) The multiple vehicle DIAL-A-RIDE problem. Ecole de Hautes Études Commerciales, Montreal

    Google Scholar 

  • Egbelu P J, Tanchoco J M A (1984) Characterization of automatic guided vehicle dispatching rules. International Journal of Production Research 22: 359–374

    Google Scholar 

  • Evers J J M, Koppers S A J (1996) Automated guided vehicle control at a container terminal. Transportation Research A 30: 21–34

    Google Scholar 

  • Fischetti M, Lodi A, Martello S, Toth P (2001) A polyhedral approach to simplified crew scheduling and vehicle scheduling problems. Management Science 47: 833–850

    Google Scholar 

  • Fleischmann B (1998), Tourenplanung. In: Isermann H (ed) Logistik. Verlag Moderne Industrie, Landsberg/Lech, pp 287–301 (in German)

    Google Scholar 

  • Gambardella L M (2000) Vehicle routing problems. Technische Universiteit Eindhoven

    Google Scholar 

  • Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Management Science 40: 1276–1290

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

    Article  Google Scholar 

  • Golden B L, Laporte G, Taillard E D (1997) An adaptive memory heuristic for a class of vehicle routing problems with minimax objective. Computers Operations Research 24: 445–452

    Google Scholar 

  • Healy P, Moll R (1995) A new extension of local search applied to the Dial-A-Ride problem. European Journal of Operational Research 83: 83–104

    Article  Google Scholar 

  • Hwang H (2002) An improved model for vehicle routing problem with time constraint based on genetic algorithm. Computers and Industrial Engineering 42: 361–369

    Google Scholar 

  • Hwang H, Kim S H (1998) Development of dispatching rules for automated guided vehicle systems. Journal of Manufacturing Systems 17: 137–143

    Google Scholar 

  • Jaw J J, Odoni A R, Psaraftis H N, Wilson N H M (1986) A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows. Transportation Research B 20: 243–257

    Article  Google Scholar 

  • Kim K H, Kim K Y (1999) An optimal routing algorithm for a transfer crane in port container terminals. Transportation Science 33: 17–33

    Google Scholar 

  • Kim KH, Park Y-M (2003)Acrane scheduling method for port container terminals. European Journal of Operational Research (to appear)

    Google Scholar 

  • Kohl N, Desrosiers J, Madsen O G B, Solomon M M, Soumis F (1999) 2-path cuts for the vehicle routing problem with time windows. Transportation Science 33: 101–116

    Google Scholar 

  • Laporte G, Mercure H, Norbert Y (1986) An exact algorithm for the asymmetrical capacitated vehicle routing problem. Networks 16: 33–46

    MathSciNet  Google Scholar 

  • Laporte G (1992) The vehicle routing problem: an overview of exact and approximate algorithms. European Journal of Operational Research 59: 345–358

    MATH  Google Scholar 

  • Laporte G, Osman I H (1995) Routing problems: a bibliography. Annals of Operations Research 227–262

    Google Scholar 

  • Lau H C, Liang Z (2001) Pickup and delivery with time windows: algorithms and test case generation. Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence (ICTAI’01), 333–340

    Google Scholar 

  • Lee J, Tangjarukij M, Zhu Z (1996) Load selection of automated guided vehicles in flexible manufacturing systems. International Journal of Production Research 34: 3383–3400

    Google Scholar 

  • Lim J K, Kim K H, Yoshimoto K, Lee, J H, Takahashi T (2003) A dispatching method for automated guided vehicles by using a bidding concept. OR Spectrum 25: 25–44

    Article  MathSciNet  Google Scholar 

  • Mingozzi A, Giorgi S, Baldacci R (1999) An exact method for the vehicle routing problem with backhauls. Transportation Science 33: 315–329

    Google Scholar 

  • Nanry W P, Barnes J W (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transportation Research B 34: 107–121

    Article  Google Scholar 

  • Nayyar P, Khator S K (1993) Operational control of multi-load vehicles in an automated guided vehicle system. Computers and Industrial Engineering 24: 503–506

    Google Scholar 

  • Park Y-M, Kim, K H (2003) A scheduling method for berth and quay cranes. OR Spectrum 25: 1–23

    Article  MathSciNet  Google Scholar 

  • Psaraftis H N (1980) A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem. Transportation Science 14: 130–154

    Google Scholar 

  • Psaraftis H N (1986) Scheduling large scale advanced request dial-a-ride systems. American Journal of Mathematical and Management Sciences 6: 327–367

    MATH  Google Scholar 

  • Savelsbergh M, Sol M (1995) The general pickup and delivery problem. Transportation Science 29: 17–29

    Article  Google Scholar 

  • Schrecker A (2000) Planung und Steuerung fahrerloser Transportsysteme (Planning and control of automated guided vehicle systems). Gabler Verlag & Deutscher Universitäts Verlag, Wiesbaden (in German)

    Google Scholar 

  • Sinriech D, Kotlarski J (2002) A dynamic scheduling algorithm for a multiple load multiple carrier system. International Journal of Production Research 40: 1065–1080

    Article  Google Scholar 

  • Van Breedam A (1995) Improvement heuristics for the vehicle routing problem based on simulated annealing. European Journal of Operational Research 86: 480–490

    MATH  Google Scholar 

  • Van Breedam A (2002) A parametric analysis of heuristics for the vehicle routing problem with side-constraints. European Journal of Operational Research 137: 348–370

    MATH  Google Scholar 

  • Van der Heijden M, Ebben M, Gademan N, van Harten A (2002) Scheduling vehicles in automated transportation systems — algorithms and case study. OR Spectrum 24: 31–58

    Google Scholar 

  • Wallace A (2001) Application of AI to AGV control-agent control of AGVs. International Journal of Production Research 39: 709–726

    Article  MATH  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 chapter

Cite this chapter

Grunow, M., Günther, HO., Lehmann, M. (2005). Dispatching multi-load AGVs in highly automated seaport container terminals. In: Günther, HO., Kim, K.H. (eds) Container Terminals and Automated Transport Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-26686-0_10

Download citation

Publish with us

Policies and ethics