An appraisal of a column-generation-based algorithm for centralized train-conflict resolution on a metropolitan railway network
Authors:
- Myoung-Ju ParkMPMyoung-Ju Park
- Soon-Heum HongSHSoon-Heum Hong
- 1 February 2011
- journal article
- Published by Elsevier in Transportation Research Part B: Methodological
- Vol. 45 (2) , 409-429
Abstract
No abstract availableKeywords
Funding Information
- Ministry of Education, Science and Technology (2009-0077035)
- National Research Foundation of Korea
This publication has 26 references indexed in Scilit:
- A branch and bound algorithm for scheduling trains in a railway networkEuropean Journal of Operational Research, 2007
- N-tracked railway traffic re-scheduling during disturbancesTransportation Research Part B: Methodological, 2007
- An exact solution procedure to determine the optimal dispatching times for complex rail networksIIE Transactions, 2006
- Bicriteria train scheduling for high-speed passenger railroad planning applicationsEuropean Journal of Operational Research, 2005
- Job-shop scheduling with blocking and no-wait constraintsEuropean Journal of Operational Research, 2002
- Greedy heuristics for rapid scheduling of trains on a single trackIIE Transactions, 1998
- A Model, Algorithms and Strategy for Train PathingJournal of the Operational Research Society, 1995
- Extending a train pathing model from one-way to two-way trackTransportation Research Part B: Methodological, 1994
- A model and strategy for train pathing with choice of lines, platforms, and routesTransportation Research Part B: Methodological, 1994
- A fast heuristic for the train scheduling problemComputers & Operations Research, 1994