Abstract
This paper deals with automated guided vehicles (AGVs) which transport containers between the quay and the stack on automated container terminals. The focus is on the assignment of transportation jobs to AGVs within a terminal control system operating in real time. First, we describe a rather common problem formulation based on due times for the jobs and solve this problem both with a greedy priority rule based heuristic and with an exact algorithm. Subsequently, we present an alternative formulation of the assignment problem, which does not include due times. This formulation is based on a rough analogy to inventory management and is solved using an exact algorithm. The idea behind this alternative formulation is to avoid estimates of driving times, completion times, due times, and tardiness because such estimates are often highly unreliable in practice and do not allow for accurate planning. By means of simulation, we then analyze the different approaches. We show that the inventory-based model leads to better productivity on the terminal than the due-time-based formulation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bae JW, Kim KH (2000) A pooled dispatching strategy for automated guided vehicles in port container terminals. Int J Manag Sci 6:47–70
Baker C (1999) Altenwerder—the details. Port Dev Int (07/08):24–25
Bish EK, Chen FY, Leong YT, Nelson BL, Ng JWC, Simchi-Levy D (2005) Dispatching vehicles in a mega container terminal. OR Spectrum 27:491–506
Böse J, Reiners T, Steenken D, Voß S (2000) Vehicle dispatching at seaport container terminals using evolutionary algorithms. In: Sprague RH (ed) Proceedings of the 33rd Annual Hawaii International Conference on System Sciences. IEEE, Piscataway, pp 377–388
Briskorn D, Hartmann S (2006) Simulating dispatching strategies for automated container. GOR Proceedings 2005 (in press)
Daganzo CF (1989) The crane scheduling problem. Transp Res B 23:159–175
de Castilho B, Daganzo CF (1993) Handling strategies for import containers at marine terminals. Transp Res B 27:151–166
de Koster RBM, Le-Anh T, van der Meer JR (2004) Testing and classifying vehicle dispatching rules in three real-world settings. J Oper Manag 22:369–386
Grunow M, Günther H-O, Lehmann M (2004) Dispatching multi-load AGVs in highly automated seaport container terminals. OR Spectrum 26:211–235
Guan Y, Cheung RK (2004) The berth allocation problem: models and solution methods. OR Spectrum 26:75–92
Hartmann S (2004) A general framework for scheduling equipment and manpower at container terminals. OR Spectrum 26:51–74
Hwang H, Kim SH (1998) Development of dispatching rules for automated guided vehicle systems. J Manuf Syst 17:137–143
Imai A, Nagaiwa K, Tat CW (1997) Efficient planning of berth allocation for container terminals in Asia. J Adv Transp 31:75–94
Imai A, Nishimura E, Papadimitriou S (2001) The dynamic berth allocation problem for a container port. Transp Res B 35:401–417
Kim KH, Kim HB (1999a) Segregating space allocation models for container inventories in port container terminals. Int J Prod Econ 59:415–423
Kim KY, Kim KH (1999b) A routing algorithm for a single straddle carrier to load export containers onto a container ship. Int J Prod Econ 59:425–433
Kim KH, Park YM, Ryu K-R (2000) Deriving decision rules to locate export containers in container yards. Eur J Oper Res 124:89–101
Kim KH, Won SH, Lim JK, Takahashi T (2001) A simulation-based test-bed for a control software in automated container terminals. Proceedings of the international conference on computers and industrial engineering, Montreal, Canada, pp 239–243
Kuhn HW (1955) The Hungarian method for the assignment problem. Nav Res Logist Q 2:83–97
Lim A (1998) The berth planning problem. Oper Res Lett 22:105–110
Meersmans PJM, Dekker R (2001) Operations research supports container handling. Technical report EI 2001-22. Econometric Institute, Erasmus University, Rotterdam
Meersmans PJM, Wagelmans APM (2001) Effective algorithms for integrated scheduling of handling equipment at automated container terminals. Technical report EI 2001-19. Econometric Institute, Erasmus University, Rotterdam
Munkres JR (1957) Algorithms for the assignment and transportation problems. J Soc Ind Appl Math 5:32–38
Page B, Lechler T, Claassen S (eds) (2000) Objektorientierte simulation in Java mit dem Framework DESMO-J. BoD GmbH, Norderstedt
Park Y-M, Kim KH (2003) A scheduling method for berth and quai cranes. OR Spectrum 25:1–23
Peterkofsky RI, Daganzo CF (1990) A branch and bound solution method for the crane scheduling problem. Transp Res B 24:159–172
Steenken D, Henning A, Freigang S, Voß S (1993) Routing of straddle carriers at a container terminal with the special aspect of internal moves. OR Spectrum 15:167–172
Steenken D, Voß S, Stahlbock R (2004) Container terminal operations and operations research—a classification and literature review. OR Spectrum 26:3–49
Taleb-Ibrahimi M, de Castilho B, Daganzo CF (1993) Storage space vs. handling work in container terminals. Transp Res B 27:13–32
Vis IFA (2006) Survey of research in the design and control of automated guided vehicle systems. Eur J Oper Res 170:677–709
Vis IFA, de Koster R (2003) Transshipment of containers at a container terminal: an overview. Eur J Oper Res 147:1–16
Vis IFA, Harika I (2004) A comparison of vehicle types for automated container terminals. OR Spectrum 26:117–143
Zhang C, Liu J, Wan Y-W, Murty KG, Linn RJ (2001) Storage space allocation in container terminals. Technical report, Hong Kong University of Science and Technology
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Briskorn, D., Drexl, A. & Hartmann, S. Inventory-based dispatching of automated guided vehicles on container terminals. OR Spectrum 28, 611–630 (2006). https://doi.org/10.1007/s00291-006-0033-8
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00291-006-0033-8