Abstract
We present an algorithm for the problem of routing Automated Guided Vehicles (AGVs) in an automated logistic system. The algorithm avoids collisions, deadlocks and livelocks already at the time of route computation (conflict-free routing). After a preprocessing step the real-time computation for each request consists of the determination of a shortest path with time-windows and a following readjustment of these time-windows. Both is done in polynomial-time. Using goal-oriented search we get computation times which are appropriate for real-time routing. Additionally, in comparison to a static routing approach, used in Container Terminal Altenwerder (CTA) at Hamburg Harbour, our algorithm had an explicit advantage.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aspnes, J. et al. (1997) On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM 44, 486–504
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
Cormen, T. H., Leiserson, Ch. E., Rivest, R. L. (1990) Introduction to Algorithms. MIT Press, Cambridge, Massachusetts
Desrosiers et al. (1986) Methods for routing with time windows. European Journal of Operations Research 23, 236–245
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
Huang, J., Palekar, U. S., Kapoor, S. (1993) A labeling algorithm for the navigation of automated guided vehicles. Journal of engineering for industry 115, 315–321
Kim, Ch. W., Tanchoco, J. M. A. (1991) Conflict-free shortest-time bidirectional agv routeing. International Journal of Production Research 29(12), 2377–2391
Krishnamurthy, N., Batta, R., Karwan, M. (1993) Developing conflict-free routes for automated guided vehicles. Operations Research 41, 1077–1090
Sancho, N. G. F. (1994) Shortest path problems with time windows on nodes and arcs. Journal of mathematical analysis and applications 186, 643–648
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Möhring, R.H., Köhler, E., Gawrilow, E., Stenzel, B. (2005). Conflict-free Real-time AGV Routing. In: Fleuren, H., den Hertog, D., Kort, P. (eds) Operations Research Proceedings 2004. Operations Research Proceedings, vol 2004. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-27679-3_3
Download citation
DOI: https://doi.org/10.1007/3-540-27679-3_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24274-1
Online ISBN: 978-3-540-27679-1
eBook Packages: Business and EconomicsBusiness and Management (R0)