Citation map · Study

SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

A branch and bound algorithm for scheduling trains in a railway network

5 references·7 citing·24 second hop

FromToDepth

this work references cited by second hop

References

1998A Survey of Optimization Models for Train Routing and Scheduling788 cited
2002Modeling and Solving the Train Timetabling Problem614 cited
1991Tactical Scheduling of Rail Operations: The SCAN I System193 cited
1999Railway traffic control and train scheduling based oninter-train conflict management190 cited
1997Heuristic Techniques for Single Line Train Scheduling160 cited

Cited by

2014An overview of recovery models and algorithms for real-time railway rescheduling716 cited
2009Railway track allocation: models and methods360 cited
2009A tabu search algorithm for rerouting trains during rail operations352 cited
2017Dynamic passenger demand oriented metro train scheduling with energy-efficiency and waiting time minimization: Mixed-integer linear programming approaches342 cited
2016Energy-efficient metro train rescheduling with uncertain time-variant passenger demands: An approximate dynamic programming approach319 cited
2014Simultaneous train rerouting and rescheduling on an N-track network: A model reformulation with network-based cumulative flow variables286 cited
2008Reordering and Local Rerouting Strategies to Manage Train Traffic in Real Time268 cited

Only edges whose both ends are imported exist here. Widen the year window, or show the whole map. Back to the work