Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
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.
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.
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.
ILOG. ILOG: Solver Reference Manual Version 2.0, 1994.
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.
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.
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.
A.K. Mackworth. Consistency in networks of relations. AI Journal, 8(1):99–118, 1977.
S. Prehn. A railway running map design. UNU/IIST PRaCoSy Document SP/12/3, International Institute for Software Technology, United Nations University, July 1994.
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.
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.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chiu, C.K., Chou, C.M., Lee, J.H.M., Leung, H.F., Leung, Y.W. (1996). A constraint-based interactive train rescheduling tool. In: Freuder, E.C. (eds) Principles and Practice of Constraint Programming — CP96. CP 1996. Lecture Notes in Computer Science, vol 1118. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61551-2_69
Download citation
DOI: https://doi.org/10.1007/3-540-61551-2_69
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61551-4
Online ISBN: 978-3-540-70620-5
eBook Packages: Springer Book Archive