Greedy heuristics for rapid scheduling of trains on a single track
- 1 May 1998
- journal article
- research article
- Published by Taylor & Francis Ltd in IIE Transactions
- Vol. 30 (5), 481-493
- https://doi.org/10.1080/07408179808966488
Abstract
This paper describes the core algorithm used in an implementation of a scheduler currently being installed in a major Asian railway. It extends previous work on a greedy heuristic for scheduling trains, to provide a powerful and practically useful method that is fast enough for real-time use in many cases. Real-world railway systems have constraints that do not fit easily into a simple mathematical formulation. The algorithm described here makes it straightforward to incorporate many such realistic features.Keywords
This publication has 10 references indexed in Scilit:
- Predicting On-Time Line-Haul Performance in Scheduled Railroad OperationsTransportation Science, 1996
- A fast heuristic for the train scheduling problemComputers & Operations Research, 1994
- Optimal Pacing of Trains in Freight Railroads: Model Formulation and SolutionOperations Research, 1991
- Railway scheduling by network optimizationMathematical and Computer Modelling, 1991
- Optimal control on a graph with application to train scheduling problemsMathematical and Computer Modelling, 1991
- An introduction to computer-assisted train dispatchJournal of Advanced Transportation, 1986
- Computer Aided Train Dispatching: Decision Support Through OptimizationInforms Journal on Applied Analytics, 1983
- A Structured Model for Rail Line Simulation and OptimizationTransportation Science, 1982
- Models for rail transportationTransportation Research Part A: General, 1980
- Over-the-Road Transit Time for a Single Track RailwayTransportation Science, 1974