A Constraint-Based Interactive Train Rescheduling Tool

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.

[1]  Thomas C. Henderson,et al.  Arc and Path Consistency Revisited , 1986, Artif. Intell..

[2]  K. Matsumoto,et al.  A knowledge-based interactive train scheduling system-aiming at large-scale complex planning expert systems , 1988, Proceedings of the International Workshop on Artificial Intelligence for Industrial Applications.

[3]  J. Gaschnig.  Performance measurement and analysis of certain search algorithms. , 1979 .

[4]  Vipin Kumar,et al.  Algorithms for Constraint-Satisfaction Problems: A Survey , 1992, AI Mag..

[5]  Pei-Chann Chang,et al.  One-machine rescheduling heuristics with efficiency and stability as criteria , 1993, Comput. Oper. Res..

[6]  Claude Le Pape,et al.  Implementation of resource constraints in ILOG SCHEDULE: a library for the development of constraint-based scheduling systems , 1994 .

[7]  Ching-Chi Hsu,et al.  An interactive train scheduling workbench based on artificial intelligence , 1994, Proceedings Sixth International Conference on Tools with Artificial Intelligence. TAI 94.

[8]  Pascal Van Hentenryck.  Constraint satisfaction in logic programming , 1989, Logic programming.

[9]  Bernard A. Nadel,et al.  Tree search and ARC consistency in constraint satisfaction algorithms , 1988 .

[10]  Pascal Van Hentenryck,et al.  The Constraint Logic Programming Language CHIP , 1988, FGCS.

[11]  Ernesto M. Morgado,et al.  CREWS_NS: Scheduling Train Crews in The Netherlands , 1997, AI Mag..

[12]  Kang G. Shin,et al.  PRIAM: polite rescheduler for intelligent automated manufacturing , 1996, IEEE Trans. Robotics Autom..

[13]  Edward P. K. Tsang,et al.  Foundations of constraint satisfaction , 1993, Computation in cognitive science.

[14]  Jürgen Sauer,et al.  Knowledge-Based Scheduling Systems in Industry and Medicine , 1997, IEEE Expert.

[15]  T. Fukuda,et al.  A knowledge-based approach for railway scheduling , 1991, [1991] Proceedings. The Seventh IEEE Conference on Artificial Intelligence Application.

[16]  William S. Havens,et al.  Hierarchical arc consistency: exploiting structured domains in constraint satisfaction problems , 1985 .

[17]  Toshiharu Hasegawa,et al.  Fundamental algorithm for train scheduling based on artificial intelligence , 1987, Systems and Computers in Japan.

[18]  Te-Wei Chiang,et al.  Railway scheduling system using repair-based approach , 1995, Proceedings of 7th IEEE International Conference on Tools with Artificial Intelligence.

[19]  Robert P. Goldman,et al.  A Constraint-Based Scheduler for Batch Manufacturing , 1997, IEEE Expert.

[20]  Robert M. Haralick,et al.  Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..

[21]  Ho-fung Leung,et al.  Extending GENET for non-binary CSP's , 1995, Proceedings of 7th IEEE International Conference on Tools with Artificial Intelligence.

[22]  Ho-fung Leung,et al.  A Constraint-Based Interactive Train Rescheduling Tool , 1996, CP.

[23]  Bernard A. Nadel,et al.  Constraint satisfaction algorithms 1 , 1989, Comput. Intell..

[24]  J StuckeyPeter,et al.  The CLP( ℛ ) language and system , 1992 .

[25]  Bjørn N. Freeman-Benson,et al.  Constraint hierarchies , 1987, OOPSLA '87.

[26]  Christian Bessiere,et al.  Arc-Consistency and Arc-Consistency Again , 1993, Artif. Intell..

[27]  Alan Bundy,et al.  Depth-First Search , 1984 .

[28]  Malachy Carey,et al.  A Model, Algorithms and Strategy for Train Pathing , 1995 .

[29]  Alan K. Mackworth.  Consistency in Networks of Relations , 1977, Artif. Intell..

[30]  Pascal Van Hentenryck,et al.  Solving Large Combinatorial Problems in Logic Programming , 1990, J. Log. Program..

[31]  Pascal Van Hentenryck,et al.  Applications of CHIP to industrial and engineering problems , 1988, IEA/AIE '88.

[32]  Edward M. Reingold,et al.  Backtrack programming techniques , 1975, CACM.

[33]  Patrick Prosser,et al.  HYBRID ALGORITHMS FOR THE CONSTRAINT SATISFACTION PROBLEM , 1993, Comput. Intell..

[34]  Ho-fung Leung,et al.  Extending GENET for Non-Binary Constraint Satisfaction Problems , 1995 .

[35]  J. J. McGregor.  Relational consistency algorithms and their application in finding subgraph and graph isomorphisms , 1979, Inf. Sci..

[36]  Malachy Carey,et al.  A model and strategy for train pathing with choice of lines, platforms, and routes , 1994 .

[37]  Pascal Van Hentenryck,et al.  An Efficient Arc Consistency Algorithm for a Class of CSP Problems , 1991, IJCAI.

[38]  C. Le Pape,et al.  Three mechanisms for managing resource constraints in a library for constraint-based scheduling , 1995 .

[39]  A. ILOGS..  DISJUNCTIVE CONSTRAINTS FOR MANUFACTURING SCHEDULING : PRINCIPLES AND EXTENSIONS , 1995 .

[40]  Jean-François Puget,et al.  On the Satisfiability of Symmetrical Constrained Satisfaction Problems , 1993, ISMIS.

[41]  David L. Waltz,et al.  Understanding Line drawings of Scenes with Shadows , 1975 .

[42]  Yu Cheng.  Hybrid simulation for resolving resource conflict in train traffic rescheduling , 1998 .

[43]  Alain Colmerauer,et al.  An introduction to Prolog III , 1989, CACM.

[44]  Malachy Carey,et al.  Extending a train pathing model from one-way to two-way track , 1994 .

[45]  H. Schaefer.  Computer-aided train dispatching with expert systems , 1995 .

[46]  Roland H. C. Yap,et al.  The CLP( R ) language and system , 1992, TOPL.

[47]  Ehl Emile Aarts,et al.  A computational study of constraint satisfaction for multiple capacitated job shop scheduling , 1996 .

[48]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[49]  Monte Zweben,et al.  Scheduling and rescheduling with iterative repair , 1993, IEEE Trans. Syst. Man Cybern..

[50]  Andrew J. Davenport,et al.  GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement , 1994, AAAI.

[51]  Jean-francois Puget,et al.  A C++ implementation of CLP , 1997 .

[52]  M. Perrett.  Using constraint logic programming techniques in container port planning , 1991 .

[53]  Ho-fung Leung,et al.  Towards a More Efficient Stochastic Constraint Solver , 1996, CP.

[54]  Rina Dechter,et al.  Experimental Evaluation of Preprocessing Techniques in Constraint Satisfaction Problems , 1989, IJCAI.