Abstract
Automated Guided Vehicles (AGVs) are state-of-the-art technology for optimizing large scale production systems and are used in a wide range of application areas. A standard task in this context is to find efficient routing schemes, i.e., algorithms that route these vehicles through the particular environment. The productivity of the AGVs is highly dependent on the used routing scheme. In this work we study a particular routing algorithm for AGVs in an automated logistic system. For the evaluation of our algorithm we focus on Container Terminal Altenwerder (CTA) at Hamburg Harbor. However, our model is appropriate for an arbitrary graph. The key feature of this algorithm is that it avoids collisions, deadlocks and livelocks already at the time of route computation (conflict-free routing), whereas standard approaches deal with these problems only at the execution time of the routes. In addition, the algorithm considers physical properties of the AGVs and certain safety aspects implied by the particular application.
This is a preview of subscription content, log in via an institution to check access.
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
Beasley, J. E., Christofides, N. (1989) An algorithm for the resource constrained shortest path problem. Networks 19, 379–394
Broadbent, A. J. et al. (1987) Free-ranging AGV and Scheduling System. In Automated Guided Vehicle Systems, 301–309
Desrosiers et al. (1986) Methods for routing with time windows. European Journal of Operations Research 23, 236–245
Desrosiers, M., Soumis, F. (1988) A generalized permanent labelling algorithm for the Shortest Path Problem with Time Windows, INFOR 26(3), 191–212
Desrosiers, J., Solomon, M. (1988) Time window constrained routing and scheduling problems, Transportation Science 22, 1–13
Ford, L. R., Fulkerson, D. R. (1959) Constructing maximal dynamic flows from static flows. Operations Research 6, 419–433
Ford, L. R., Fulkerson, D. R. (1962) Flows in Networks. Princeton University Press, Princeton, NJ
Hart, P., Nilsson, N., Raphael, B. (1968) A formal basis for the heuristic determination of minimum cost paths. In IEEE Transactions on Systems, Science and Cybernetics SCC-4, 100–107
Kim, K. H., Jeon, S. M., Ryu, K. R. (2006) Deadlock prevention for automated guided vehicles in automated container terminals. OR Spectrum 28 (4), 659–679
Köhler, E., Möhring, R. H., Skutella, M. (2002) Traffic networks and flows over time. In Jürg Kramer, Special Volume Dedicated to the DFG Research Center “Mathematics for Key Technologies Berlin”, published by Berliner Mathematische Gesellschaft, 49–70, http://www.math.tu-berlin.de/coga/publications/techreports/2002/Report-752-2002.html
Krishnamurthy, N., Batta, R., Karwan, M. (1993) Developing conflict-free routes for automated guided vehicles. Operations Research 41, 1077–1090
Moorthy, K. M. R. L., Guan, W. H. (2000) Deadlock Prediction and Avoidance in an AGV System. SMA Thesis
Qui, J., Hsu, W.-J. (2000) Conflict-free AGV routing in a bi-directional path layout. In Proceedings of the 5th International Conference on Computer Integrated Manufacturing (ICCIM 2000), volume 1, 392–403
Sancho, N. G. F. (1994) Shortest path problems with time windows on nodes and arcs. Journal of mathematical analysis and applications 186, 643–648
Sedgewick, R., Vitter, J.S. (1986) Shortest paths in Euclidian graphs. Algorithmica 1, 31–48
Spenke, I. (2006) Complexity and Approximation of Static k-Splittable Flows and Dynamic Grid Flows. PhD Thesis Technische Universität Berlin
Taghaboni-Dutta, F., Tanchoco, J. M. A. (1995) Comparison of dynamic routeing techniques for automated guided vehicle system. International Journal of Production Research 33(10), 2653–2669
Vis, I. F. A. (2006) Survey of research in the design and control of automated guided vehicle systems. European Journal of Operational Research 170, 677–709
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gawrilow, E., Köhler, E., Möhring, R., Stenzel, B. (2008). Dynamic Routing of Automated Guided Vehicles in Real-time. In: Krebs, HJ., Jäger, W. (eds) Mathematics – Key Technology for the Future. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77203-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-77203-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77202-6
Online ISBN: 978-3-540-77203-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)