Dynamic routing of automated guided vehicles in real-time

Mathematics - Key Technology for the Future: Joint Projects Between Universities and Industry 2004-2007

Volumn , Issue , 2008, Pages 165-177

  Gawrilow, Ewgenij ^a   Köhler, Ekkehard ^b   Möhring, Rolf H ^a   Stenzel, Björn ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b BRANDENBURG UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 78649786618     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-3-540-77203-3_12     Document Type: Chapter

References (18)

1. Beasley, J. E., Christofides, N. (1989) An algorithm for the resource constrained shortest path problem. Networks 19, 379-394.
2. Broadbent, A. J. et al. (1987) Free-ranging AGV and Scheduling System. In Automated Guided Vehicle Systems, 301-309.
3. Desrosiers, et al. (1986) Methods for routing with time windows. European Journal of Operations Research 23, 236-245.
4. Desrosiers, M., Soumis, F. (1988) A generalized permanent labelling algorithm for the Shortest Path Problem with Time Windows, INFOR 26(3), 191-212.
5. Desrosiers, J., Solomon, M. (1988) Time window constrained routing and scheduling problems, Transportation Science 22, 1-13.
6. Ford, L. R., Fulkerson, D. R. (1959) Constructing maximal dynamic flows from static flows. Operations Research 6, 419-433.
7. Ford, L. R., Fulkerson, D. R. (1962) Flows in Networks. Princeton University Press, Princeton, NJ.
8. 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.
9. 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.
10. 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. tuberlin.de/coga/publications/techreports/2002/Report-752-2002.html.
11. Krishnamurthy, N., Batta, R., Karwan, M. (1993) Developing conflict-free routes for automated guided vehicles. Operations Research 41, 1077-1090.
12. Moorthy, K. M. R. L., Guan, W. H. (2000) Deadlock Prediction and Avoidance in an AGV System. SMA Thesis.
13. 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.
14. Sancho, N. G. F. (1994) Shortest path problems with time windows on nodes and arcs. Journal of mathematical analysis and applications 186, 643-648.
15. Sedgewick, R., Vitter, J.S. (1986) Shortest paths in Euclidian graphs. Algorithmica 1, 31-48.
16. Spenke, I. (2006) Complexity and Approximation of Static k-Splittable Flows and Dynamic Grid Flows. PhD Thesis Technische Universität Berlin.
17. 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.
18. 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.