Dealing with Uncertainty in Operational Transport Planning
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.
KeywordsPriority Queue Route Planning Transport Agent Incident Level Automate Guide Vehicle System
Unable to display preview. Download preview PDF.
- 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.A. J. Davenport and J. C. Beck. A survey of techniques for scheduling with uncertainty. Unpublished manuscript, 2000.Google Scholar
- 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
- 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.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.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
- 11.R. L. Kruse. Data Structures & Program Design. Prentice-Hall, Inc., Upper Saddle River, New Jersey, 1984.Google Scholar
- 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.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.