- 1.2k Downloads
Train routing: how best to generate the routes of each train such that all traffic will be moved, and total train miles will be minimized. Minimizing total train miles also tends to maximize train size subject to a requirement that minimum train frequencies be observed.
Block-to-train assignments: which blocks (groups of railcars) will be placed on each train, minimizing overall train complexity and the need to swap blocks en-route from one train to another.
Train timing and connections: setting the timing of each train such that the overall transit times for all shipments will be minimized, taking into account the connections of railcars from one train to another, and the associated minimum processing times for such connections. Timing must also take into account the effective numbers of trains per hour that can be processed at each yard and can travel over each line segment.
KeywordsDwell Time Schedule Algorithm Locomotive Requirement Work Event Train Schedule
- Kraft ER (2000) Implementation strategies for railroad dynamic freight car scheduling. J Transport Res Forum 39(3):119–137, jointly with Transportation QuarterlyGoogle Scholar
- Kraft ER (1998) A reservations-based railway network operations management system, Ph. D. Dissertation, Department of Systems Engineering, University of Pennsylvania, Philadelphia, PA, UMI Order # 9829930Google Scholar
- Railroad Applications Section (2012) 2011 RAS Problem Solving Competition, Train Design Optimization, INFORMS. https://www.informs.org/Community/RAS/Problem-Repository