Optimal train traffic rescheduling simulation by a knowledge-based system combined with critical path method

Simulation Practice and Theory

Volumn 4, Issue 6, 1996, Pages 399-413

  Cheng, Yu ^a,b  

^a RAILWAY TECHNICAL RESEARCH INSTITUTE   (Japan)

^b NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

Critical path method; Knowledge based systems; Simulation; Train traffic rescheduling

Indexed keywords

COMPUTER SIMULATION; CRITICAL PATH ANALYSIS; FEEDBACK CONTROL; KNOWLEDGE BASED SYSTEMS; MATHEMATICAL PROGRAMMING; OPERATIONS RESEARCH; OPTIMAL CONTROL SYSTEMS; SCHEDULING;

TRAIN TRAFFIC RESCHEDULING;

RAILROAD TRAFFIC CONTROL;

EID: 0030283958     PISSN: 09284869     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0928-4869(96)00034-1     Document Type: Article

References (9)

1. K. Abe and S. Araya, Train traffic simulation using the longest path method, J. Inform. Process. Japan 27 (1) (1986) (in Japanese).
2. J.M. Antill, Critical Path Methods in Construction Practice (John Wiley & Sons, New York, 1966).
3. E. Balas, Machine sequence via disjunctive graphs - An implicit enumeration algorithm, Oper. Res. 17 (1969) 941-957.
4. F.H. Bowman, The schedule-sequence problem, Oper. Res. 7 (1959) 621-624.
5. J. Carlier and E. Pinson, An algorithm for solving the job-shop problem, Oper. Res. 2 (1989) 164-176.
6. Y. Cheng, N. Tomii, H. Ikeda and Y. Hayashi, A feasible partial train traffic simulation using diagram expressed in network, in: Proceedings of the International Conference of New Directions in Simulation for Manufacturing and Communications, Tokyo, Japan (1994) 439-445.
7. A.A. Oloufa, Modeling operational activities in object-oriented simulation, J. Comput. Civil Engineering 7 (1993) 94-106.
8. Rule-extended Algorithmic Language (RAL), Language guide (Production Systems Technologies, Inc., USA, 1991).
9. M.C. Yovits, Advance in Computers (Harcourt Brace & Company, New York, Vol. 37, 1993).