A Constraint-Based Interactive Train Rescheduling Tool | Constraints Skip to main content

Advertisement

Springer Nature Link
Log in

A Constraint-Based Interactive Train Rescheduling Tool

  • Published:
Constraints Aims and scope Submit manuscript

Abstract

In this paper, we report the design and implementation of a constraint-based interactive train rescheduling tool, a project in collaboration with the International Institute for Software Technology, United Nations University (UNU/IIST), Macau. We formulate train rescheduling as constraint satisfaction and describe a constraint propagation approach for tackling the problem. Algorithms for timetable verification and train rescheduling are designed under a coherent framework. Formal correctness properties of the rescheduling algorithm are established. We define two optimality criteria for rescheduling that correspond to minimizing the number of station visits affected and passenger delay respectively. Two heuristics are then proposed to speed up and direct the search towards optimal solutions. The feasibility of our proposed algorithms and heuristics are confirmed with experimentation using real-life data.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (Japan)

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Baptiste, P., & Le Pape, C. (1995). Disjunctive constraints for manufacturing scheduling: Principles and extensions. In Proceedings of the Third International Conference on Computer Integrated Manufacturing, Singapore.

  2. Bessiére, C., & Cordier, M. (1993). Arc-consistency and arc-consistency again. In Proceedings of AAAI-93, pages 108–113.

  3. Bisiani, R. (1987). Beam search. In S. C. Shapiro (ed.), Encyclopedia of Artificial Intelligence, pages 56–58. New York: Wiley.

    Google Scholar 

  4. Bitner, J., & Reingold, E. M. (1985). Backtrack programming techniques. Communications of the ACM, 18: 651–655.

    Google Scholar 

  5. Borning, A., Freeman-Benson, B., & Wilson, M. (1992). Constraint hierarchies. Lisp and Symbolic Computation, 5(3): 223–270.

    Google Scholar 

  6. Carey, M. (1994). Extending a train pathing algorithm from one-way to two-way track. Transportation Research, 28B: 395–400.

    Google Scholar 

  7. Carey, M. (1994). A model and strategy for train pathing, with choice of lines, platforms and routes. Transportation Research, 28B: 333–353.

    Google Scholar 

  8. Carey, M., & Lockwood, D. (1995). A model, algorithm and strategy for train pathing. Journal of Operational Research Society, 46: 988–1005.

    Google Scholar 

  9. Cheng, Y. (1998). Hybrid simulation for resolving resource conflicts in train traffic rescheduling. Computers in Industry, 35(3): 233–246.

    Google Scholar 

  10. Chiang, T. W., & Hau, H. Y. (1995). Railway scheduling system using repair-based approach. In Proceedings: Seventh International Conference on Tools with Artificial Intelligence, pages 71–78.

  11. 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 Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, pages 104–118.

  12. Chiu, C. K., Chou, C. M., Lee, J. H. M., Leung, H. F., & Leung, Y. W. (1997). A constraint-based interactive train rescheduling tool. Technical report, Department of Computer Science and Engineering, The Chinese University of Hong Kong.

  13. Colmerauer, A. (1990). An introduction to Prolog III. Communications of the ACM, July: 69–90.

  14. Davenport, A., Tsang, E. P. K., Wang, C. J., & Zhu, K. (1994). GENET: A connectionist architecture for solving constraint satisfaction problems by iterative improvement. In Proceedings of AAAI'94.

  15. Dechter, R., & Meiri, I. (1989). Experimental evaluation of preprocessing techniques in constraintsatisfaction problems. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pages 37–42, Menlo Park, CA. American Association for Artificial Intelligence.

    Google Scholar 

  16. Deville, Y., & Van Hentenryck, P. (1991). An efficient arc consistency algorithm for a class of CSP algorithm. In Proceedings of IJCAI 1991, pages 325–330.

  17. Dincbas, M., Simonis, H., & Van Hentenryck, P. (1990). Solving large combinatorial problems in logic programming. Journal of Logic Programming, 8: 75–93.

    Google Scholar 

  18. Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., & Graf, T. (1988). Applications of CHIP to industrial and engineering problems. In Proceedings of the First International Conference on Industrial & Engineering Applications of Artificial Intelligence & Expert Systems, pages 887–892.

  19. Dincbas, M., Van Hentenryck, P., Simonis, H., Aggoun, A., Graf, T., & Berthier, F. (1988). The constraint logic programming language CHIP. In Proceedings of the International Conference on Fifth Generation Computer Systems (FGCS'88), pages 693–702, Tokyo, Japan.

  20. Dong, Y. (1994). The Zhengzhou ↔ Wuhan train dispatch system. UNU/IIST PRaCoSy Document DYL/1/3, International Institute for Software Technology, United Nations University, July.

  21. Freuder, E. C., & Wallace, R. (1992). Partial constraint satisfaction. Artificial Intelligence, 58: 21–70.

    Google Scholar 

  22. Fukumori, K., Sano, H., Hasegawa, T., & Sakai, T. (1987). Fundamental algorithm for train scheduling based on artificial intelligence. Systems and Computers in Japan, 18(3): 52–63.

    Google Scholar 

  23. Gaschnig, J. (1978). Experimental case studies of backtrack versus Waltz-type versus new algorithms for satisfying assignment problems. In Proceedings of the Second Biennial Conference of the Canadian Society for Computational Studies of Intelligence, Canadian Information Processing Society.

  24. Gaschnig, J. (1979). Performance Measurement and Analysis of Certain Search Algorithms. Ph.D. thesis, Department of Computer Science, Carnegie-Mellon University, Pittsburgh, PA.

  25. Goldman, R. P., & Boddy, M. S. (1997). A constraint-based scheduler for batch manufacturing. IEEE Expert—Intelligent Systems & Their Applications, 12(1): 49–56.

    Google Scholar 

  26. Haralick, R. M., & Elliot, G. L. (1980). Increasing tree search efficiency for constraint satisfaction problem. Artificial Intelligence, 14: 263–313.

    Google Scholar 

  27. ILOG. (1994). ILOG: Solver Reference Manual Version 2.0.

  28. Jaffar, J., Michaylov, S., Stuckey, P. J., & Yap, R. H. C. (1992). The CLP(_) language and system. ACM Transactions on Programming Languages and Systems, 14(3): 339–395.

    Google Scholar 

  29. Komaya, K., & Fukuda, T. (1991). A knowledge-based approach for railway scheduling. In Proceedings: Seventh IEEE Conference on Artificial Intelligence Applications, pages 405–411.

  30. Kumar, V. (1987). Depth-first search. In S.C. Shapiro (ed.), Encyclopedia of Artificial Intelligence, vol. 2, pages 1004–1005, Wiley.

  31. Kumar, V. (1992). Algorithms for constraint-satisfaction problems: A survey. AI Magazine, 13(1): 32–44.

    Google Scholar 

  32. Le Pape, C. (1994). Implementation of resource constraints in ilog schedule: A library for the development of constraint-based scheduling systems. Intelligent Systems Engineering, 3: 55–66.

    Google Scholar 

  33. Le Pape, C. (1995). Resource constraints in a library for constraint-based scheduling. In Proceedings of the INRIA/IEEE Conference on Emerging Technologies and Factory Automation, Paris, France.

  34. Lee, J. H. M., Leung, H. F., & Won, H. W. (1995). Extending GENET for non-binary CSP's. In Proceedings of the Seventh IEEE International Conference on Tools with Artificial Intelligence, pages 338–343.

  35. Lee, J. H. M., Leung, H. F., & Won, H. W. (1996). Towards a more efficient stochastic constraint solver. In Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, pages 338–352.

  36. Lee, J. H. M., Leung, H. F., & Won, H. W. (1998). A comprehensive and efficient constraint library using local search. In Proceedings of the 11th Australian Joint Conference on Artificial Intelligence, Brisbane, Australia.

  37. Lin, H. C., & Hsu, C. C. (1994). An interactive train scheduling workbench based on artificial intelligence. In Proceedings: Sixth International Conference on Tools with Artificial Intelligence, pages 42–48.

  38. Liu, X. (1994). A simple running map display tool. UNU/IIST PRaCoSy Document lx/tool/02, International Institute for Software Technology, United Nations University.

  39. Mackworth, A. K. (1977). Consistency in networks of relations. AI Journal, 8(1): 99–118.

    Google Scholar 

  40. Mackworth, A. K., Mulder, J. A., & Havens, W. S. (1985). Hierarchical arc consistency: Exploiting structured domains in constraint satisfaction problems. Computational Intelligence, 1: 118–126.

    Google Scholar 

  41. McGregor, J. (1979). Relational consistency algorithms and their applications in finding subgraph and graph isomorphism. Information Science, 19: 229–250.

    Google Scholar 

  42. Mohr, R., & Henderson, T. C. (1986). Arc and path consistency revisited. Artificial Intelligence, 28: 225–233.

    Google Scholar 

  43. Morgado, E. M., & Martins, J. P. (1998). Crews_ns: Scheduling train crews in the Netherlands. AI Magazine, 19(1): 25–38.

    Google Scholar 

  44. Nadel, B. (1988). Tree search and arc consistency in constraint-satisfaction algorithms. In L. Kanal and V. Kumar (ed.), Search in Artificial Intelligence, pages 287–342, Springer-Verlag.

  45. Nadel, B. A. (1989). Constraint satisfaction algorithms. Computational Intelligence, 5: 188–224.

    Google Scholar 

  46. Nuijten, W., & Aarts, E. (1995). A computational study of constraint satisfaction for multiple capacitated job shop scheduling. European Journal of Operational Research.

  47. Perrett, M. (1991). Using constraint logic programming techniques in container port planning. ICL Technical Journal, 7(3): 537–545.

    Google Scholar 

  48. Prehn, S. (1994). A railway running map design. UNU/IIST PRaCoSy Document SP/12/3, International Institute for Software Technology, United Nations University.

  49. Prehn, S., & Bjørner, D. (1994). PRaCoSy: An executive overview. UNU/IIST PRaCoSy Document par/02/09, International Institute for Software Technology, United Nations University.

  50. Prosser, P. (1991). Hybrid algorithms for the constraint-satisfaction problem. Research Report AISL-46-91, Computer Science Department, Univ. of Strathclyde.

  51. Puget, J.-F. (1993). On the satisfiability of symmetrical constrained satisfaction problems. In Proceedings of 7th ISMIS, Trondheim, Norway.

  52. Puget, J.-F. (1994). A C++ implementation of CLP. In Proceedings of SPICIS 94.

  53. Sauer, J., & Bruns, R. (1997). Knowledge-based scheduling systems in industry and medicine. IEEE Expert—Intelligent Systems & Their Applications, 12(1): 24–31.

    Google Scholar 

  54. Schaefer, H. (1995). Computer-aided train dispatching with expert systems. In Proceedings of the International Conference on Electric Railways in a United Europe, pages 28–32.

  55. Tsang, E. P. K. (1993). Foundations of Constraint Satisfaction. Academic Press.

  56. Tsukada, T. K., & Shin, K. G. (1996). PRIAM: Polite rescheduler for intelligent automated manufacturing. IEEE Transactions on Robotics and Automation, 12(2): 235–245.

    Google Scholar 

  57. Tsuruta, S., & Matsumoto, K. (1988). A knowledge-based interactive train scheduling system. In Proceedings of the IEEE International Workshop on Artificial Intelligence for Industrial Applications, pages 490–495.

  58. Van Hentenryck, P. (1989). Constraint Satisfaction in Logic Programming. The MIT Press.

  59. Waltz, D. (1975). Understanding line drawings of scenes with shadows. In P. H. Winston (ed.), The Psychology of Computer Vision, pages 19–91, McGraw-Hill.

  60. Wu, S. D., Storer, R. H., & Chang, P. C. (1993). One machine rescheduling heuristics with efficiency and stability as criteria. Computers & Operations Research, 20: 1–14.

    Google Scholar 

  61. Zweben, M., Davis, E., Daun, B., & Deale, M. J. (1993). Scheduling and rescheduling with iterative repair. IEEE Transactions on Systems, Man, and Cybernetics, 23(6): 1588–1596.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, The Chinese University of Hong Kong, Shatin, N.T., Hong Kong, China

    C. K. Chiu, C. M. Chou, J. H. M. Lee, H. F. Leung & Y. W. Leung

Authors
  1. C. K. Chiu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. C. M. Chou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. J. H. M. Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. H. F. Leung
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Y. W. Leung
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chiu, C.K., Chou, C.M., Lee, J.H.M. et al. A Constraint-Based Interactive Train Rescheduling Tool. Constraints 7, 167–198 (2002). https://doi.org/10.1023/A:1015109732002

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1015109732002

Search

Navigation