A constraint-based interactive train rescheduling tool

DOI10.1023/A:1015109732002MaRDI QIDQ698087zbMATH OpenOpenAlexFDO

Authors C. M. Chou, Chong-Kan Chiu, J. H. M. Lee, Hofung Leung, Yiu Wah Leung

Publication date 18 September 2002

Published in Constraints (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1015109732002

zbMATH Keywords

constraint propagationtrain reschedulingsearch heuristics

Mathematics Subject Classification ID

Computing methodologies and applications (68U99) Theory of software (68N99)

Recommendations

• Heuristic approach to train rescheduling
• Using a general-purpose mixed-integer linear programming solver for the practical solution of real-time train rescheduling
• scientific article; zbMATH DE number 2085253
• A branch and bound algorithm for scheduling trains in a railway network
• A MIP-based local search method for the railway rescheduling problem

Cited in

(8)

• Techniques for restricting multiple overtaking conflicts and performing compound moves when constructing new train schedules
• A formulation of MIP train rescheduling at terminals in bidirectional double-track lines with a moving block and ATO
• SAPI: statistical analysis of propagation of incidents. A new approach for rescheduling trains after disruptions
• Mathematical solutions for solving periodic railway transportation
• A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
• Heuristic approach to train rescheduling
• A MIP-based local search method for the railway rescheduling problem
• Rescheduling railway traffic on real time situations using time-interval variables

This page was built for publication: A constraint-based interactive train rescheduling tool

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q698087)