Advertisement

Dealing with Uncertainty in Operational Transport Planning

  • J. ZuttEmail author
  • A. van Gemund
  • M. de Weerdt
  • C. Witteveen
Chapter
Part of the Intelligent Systems, Control and Automation: Science and Engineering book series (ISCA, volume 42)

Abstract

An important problem in transportation is how to ensure efficient operational route planning when several vehicles share a common road infrastructure with limited capacity. Examples of such a problem are route planning for automated guided vehicles in a terminal and route planning for aircraft taxiing at airports. Maintaining efficiency in such transport planning scenarios can be difficult for at least two reasons. Firstly, when the infrastructure utilization approaches saturation, traffic jams and deadlocks may occur. Secondly, incidents where vehicles break down may seriously reduce the capacity of the infrastructure and thereby affect the efficiency of transportation. In this chapter we describe a new approach to deal with congestion as well as incidents using an intelligent infrastructure. In this approach, infrastructural resources (road sections, crossings) are capable of maintaining reservations of the use of that resource. Based on this infrastructure, we present an efficient, context-aware, operational transportation planning approach. Experimental results show that our context-aware planning approach outperforms a traditional planning technique and provides robustness in the face of incidents, at a level that allows application to real-world transportation problems.

Keywords

Priority Queue Route Planning Transport Agent Incident Level Automate Guide Vehicle System 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    J. F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832–843, November 1983.CrossRefGoogle Scholar
  2. 2.
    H. Bal, R. Bhoedjang, R. Hofman, C. Jacobs, T. Kielmann, J. Maassen, R. van Nieuwpoort, J. Romein, L. Renambot, T. Rühl, and others. The distributed ASCI supercomputer project. ACM SIGOPS Operating Systems Review, 34(4):76–96, October 2000.CrossRefGoogle Scholar
  3. 3.
    A. J. Broadbent, C. B. Besant, S. K. Premi, and S. P. Walker. Free ranging AGV systems: Promises, problems and pathways. In Proceedings of the 2nd International Conference on Automated Guided Vehicle System, pages 221–237, June 1985.Google Scholar
  4. 4.
    A. J. Davenport and J. C. Beck. A survey of techniques for scheduling with uncertainty. Unpublished manuscript, 2000.Google Scholar
  5. 5.
    A. J. Davenport, C. Gefflot, and J. C. Beck. Slack-based techniques for robust schedules. In Proceedings of the Sixth European Conference on Planning, pages 7–18, September 2001.Google Scholar
  6. 6.
    E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1:269–271, 1959.CrossRefGoogle Scholar
  7. 7.
    S. Fujii, H. Sandoh, and R. Hozaki. A routing control method of automated guided vehicles by the shortest path with time-windows. In M. Pridham and C. O'Brien, editors, Production Research: Approaching the 21st Century, pages 489–495. Taylor & Francis, London, UK, 1991.Google Scholar
  8. 8.
    W. Hatzack and B. Nebel. Solving the operational traffic control problem. In Proceedings of the 6th European Conference on Planning, Toledo, Spain, September 2001.Google Scholar
  9. 9.
    J. Huang, U. S. Palekar, and S. G. Kapoor. A labelling algorithm for the navigation of automated guides vehicles. Journal of Engineering for Industry, 115(3):315–321, 1993.Google Scholar
  10. 10.
    C. W. Kim and J. M. A. Tanchoco. Conflict-free shortest-time bidirectional AGV routing. International Journal on Production Research, 29(12):2377–2391, 1991.CrossRefGoogle Scholar
  11. 11.
    R. L. Kruse. Data Structures & Program Design. Prentice-Hall, Inc., Upper Saddle River, New Jersey, 1984.Google Scholar
  12. 12.
    F. A. Kuipers and P. Van Mieghem. Conditions that impact the complexity of QoS routing. IEEE/ACM Transaction on Networking, 13(4):717–730, August 2005.CrossRefGoogle Scholar
  13. 13.
    J. K. Lenstra and A. H. G. R. Kan. Complexity of vehicle routing and scheduling problems. Networks, 11(2):221–227, 1981.CrossRefGoogle Scholar
  14. 14.
    S. Maza and P. Castagna. A performance-based structural policy for conflict-free routing of bi-directional automated guided vehicles. Computers in Industry, 56(7):719–733, September 2005.CrossRefGoogle Scholar
  15. 15.
    H. De Neve P. Van Mieghem and F. A. Kuipers. Hop-by-hop quality of service routing. Computer Networks, 37(3–4):407–423, November 2001.Google Scholar
  16. 16.
    R Development Core Team. R: A language and environment for statistical computing. R Foundation for Statistical Computing, Vienna, Austria, 2007. URL http://www.R-project.org.
  17. 17.
    F. Taghaboni-Dutta and J. M. A. Tanchoco. Comparison of dynamic routing techniques for automated guided vehicle system. International Journal of Production Research, 33(10): 2653–2669, 1995.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media B.V. 2010

Authors and Affiliations

  • J. Zutt
    • 1
    Email author
  • A. van Gemund
    • 1
  • M. de Weerdt
    • 1
  • C. Witteveen
    • 1
  1. 1.Department of Software TechnologyDelft University of TechnologyDelftThe Netherlands

Personalised recommendations