Abstract
One of the major planning issues in large scale automated transportation systems is so-called empty vehicle management, the timely supply of vehicles to terminals in order to reduce cargo waiting times. Motivated by a Dutch pilot project on an underground cargo transportation system using Automated Guided Vehicles (AGVs), we developed several rules and algorithms for empty vehicle management, varying from trivial First-Come, First-Served (FCFS) via look-ahead rules to integral planning. For our application, we focus on attaining customer service levels in the presence of varying order priorities, taking into account resource capacities and the relation to other planning decisions, such as terminal management. We show how the various rules are embedded in a framework for logistics control of automated transportation networks. Using simulation, the planning options are evaluated on their performance in terms of customer service levels, AGV requirements and empty travel distances. Based on our experiments, we conclude that look-ahead rules have significant advantages above FCFS. A more advanced so-called serial scheduling method outperforms the look-ahead rules if the peak demand quickly moves amongst routes in the system.
We thank the Dutch Centre for Transportation Technology (CTT) for their funding of the simulation study that has been the basis of our research results. CTT is initiator and coordinator of the project to design and develop the underground logistics system around Amsterdam Airport Schiphol that has been used as a case study in this paper.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akturk MS, Yilmaz H (1996) Scheduling of automatically guided vehicles in a decision making hierarchy. International Journal of Production Research 34(2): 577–591
Cheung RK, Chen C-Y (1998) A two-stage stochastic network model and solution methods for the dynamic empty container allocation problem. Transportation Science 32(2): 142–162
Cheung RK, Powell WB (1994) An algorithm for multistage dynamic networks with random arc capacities, with an application to dynamic fleet management. Operations Research 44(6): 951–963
Dejax PJ, Crainic TG (1987) A review of empty flows and fleet management models in freight transportation Transportation Science 21(4): 227–247
Ebben MJR (2001) Logistics control of automated transportation networks. PhD thesis, University of Twente, Faculty of Technology and Management (forthcoming)
Egbelu PJ, Tanchoco JMA (1984) Characterization of automated guided vehicle dispatching rules. International Journal of Production Research 22: 359–374
Gademann AJRM, van de Velde SL (2000) Positioning automated guided vehicles in loop layout. European Journal of Operational Research 127: 565–573
van der Heijden MC, van Harten A, Ebben MJR, Saanen Y, Verbraeck A, Valentin E (2000) Safeguarding Schiphol Airport accessibility for freight transport: The design of a fully automated underground transportation system and the role of simulation. Working paper, University of Twente and TRAIL Research School (submitted for publication)
Holmberg K, Joborn M, Lundgren JT (1998) Improved empty freight car distribution. Transportation Science 32(2): 163–173
Hu CH, Egbelu PJ (2000) A framework for the selection of idle vehicle home locations in an automated guided vehicle system. International Journal of Production Research 38: 543–562
Jordan WC, Turnquist MA (1983) A stochastic, dynamic network model for railroad car distribution. Transportation Science 17(2): 117–145
Kim KH, Kim JY (1997) Estimating mean response time and positioning idle vehicles of automated guided vehicle systems in loop layout. Computers and Industrial Engineering 33: 669–672
Klein CM, Kim J (1996) AGV dispatching. International Journal of Production Research 34: 95–110
Kolisch R (1996) Serial and parallel resource-constrained project scheduling methods revisited: Theory and computation. European Journal of Operational Research 90(2): 320–333
Powell WB (1996) A stochastic formulation of the dynamic assignment problem, with an application to truckload motor carriers. Transportation Science 30(3): 195–219
Powell WB, Carvalho TA (1998) Dynamic control of logistics queuing networks for large-scale fleet management. Transportation Science 32(2): 90–109
Powell WB, Sheffi Y, Nickerson KS, Butterbaugh K, Atherton S (1988) Maximizing profits for North American Van Lines’ truckload division: A new framework for pricing and operations. Interfaces 18: 21–41
Silver EA, Pyke DF, Peterson R (1998) Inventory management and production planning and scheduling. Wiley, New York
Ulusoy G, Bilge U (1993) Simultaneous scheduling of machines and automated guided vehicles, International Journal of Production Research 31: 2857–2873
Verbraeck A, Saanen YA, Valentin E (1998) Logistic modeling and simulation of automated guided vehicles. In: Bargiela A, Kerckhoffs E (eds) Simulation technology: science and Art, pp. 514–519. SCS, San Diego CA
White W, Bomberault A (1969) A network algorithm for empty freight car allocation. IBM Systems Technical Journal 8: 147–171
van der Zee DJ (1997) Simulation as a tool for logistics management. PhD Thesis, University of Twente
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
van der Heijden, M., Ebben, M., Gademann, N., van Harten, A. (2005). Scheduling vehicles in automated transportation systems. 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_11
Download citation
DOI: https://doi.org/10.1007/3-540-26686-0_11
Received:
Accepted:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22328-3
Online ISBN: 978-3-540-26686-0
eBook Packages: Business and EconomicsBusiness and Management (R0)