A constraint-based interactive train rescheduling tool

DOI10.1023/A:1015109732002zbMATH Open0994.68532OpenAlexW1578742005MaRDI QIDQ698087FDOQ698087

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

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

zbMATH Keywords

constraint propagationtrain reschedulingsearch heuristics

Mathematics Subject Classification ID

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

Cited In (6)

• A MIP-based local search method for the railway rescheduling problem
• Heuristic approach to train rescheduling
• A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations
• SAPI: statistical analysis of propagation of incidents. A new approach for rescheduling trains after disruptions
• Techniques for restricting multiple overtaking conflicts and performing compound moves when constructing new train schedules
• Mathematical solutions for solving periodic railway transportation

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)