A constraint-based interactive train rescheduling tool
In this paper, we formulate train rescheduling as constraint satisfaction problem and describe a constraint propagation approach to tackle it. Algorithms for timetable verifications and train rescheduling are designed under a coherent framework. We define two optimality criteria that correspond to minimizing passenger delay and the number of station visit modifications respectively for rescheduling. Two heuristics are then proposed to speed up and direct the search towards the optimal solutions. The feasibility of our proposed algorithms and heuristics are confirmed with experimentation using real-life data.
KeywordsRescheduling Constraint Propagation Variable and Value Ordering
Unable to display preview. Download preview PDF.
- 1.T.W. Chiang and H.Y. Hau. Railway scheduling system using repair-based approach. In Proceedings: Seventh International Conference on Tools with Artificial Intelligence, pages 71–78, 1995.Google Scholar
- 2.Y. Dong. The Zhengzhou ↔ Wuhan train dispatch system. UNU/IIST PRaCoSy Document DYL/1/3, International Institute for Software Technology, United Nations University, July 1994.Google Scholar
- 3.K. Fukumori, H. Sano, T. Hasegawa, and T. Sakai. Fundamental algorithm for train scheduling based on artificial intelligence. Systems and Computers in Japan, 18(3):52–63, 1987.Google Scholar
- 4.ILOG. ILOG: Solver Reference Manual Version 2.0, 1994.Google Scholar
- 5.K. Komaya and T. Fukuda. A knowledge-based approach for railway scheduling. In Proceedings: Seventh IEEE Conference on Artificial Intelligence Applications, pages 405–411, 1991.Google Scholar
- 6.H.C. Lin and C.C. Hsu. An interactive train scheduling workbench based on artificial intelligence. In Proceedings: Sixth International Conference on Tools with Artificial Intelligence, pages 42–48, 1994.Google Scholar
- 7.X. Liu. A simple running map display tool. UNU/IIST PRaCoSy Document lx/tool/02, International Institute for Software Technology, United Nations University, August 1994.Google Scholar
- 8.A.K. Mackworth. Consistency in networks of relations. AI Journal, 8(1):99–118, 1977.Google Scholar
- 9.S. Prehn. A railway running map design. UNU/IIST PRaCoSy Document SP/12/3, International Institute for Software Technology, United Nations University, July 1994.Google Scholar
- 10.S. Prehn and D. Bjørner. PRaCoSy: An executive overview. UNU/IIST PRaCoSy Document par/02/09, International Institute for Software Technology, United Nations University, June 1994.Google Scholar
- 11.M. Zweben, E. Davis, B. Daun, and M.J. Deale. Scheduling and rescheduling with iterative repair. IEEE Transactions on Systems, Man, and Cybernetics, 23(6):1588–1596, November/December 1993.Google Scholar