An appraisal of a column-generation-based algorithm for centralized train-conflict resolution on a metropolitan railway network

Transportation Research Part B: Methodological

Volumn 45, Issue 2, 2011, Pages 409-429

  Min, Yun Hong ^a   Park, Myoung Ju ^a   Hong, Sung Pil ^a   Hong, Soon Heum ^b  

^a Seoul National University   (South Korea)

^b Korea Railroad Research Institute   (South Korea)

Author keywords

Column generation; Fix and regenerate; NP hardness; Train conflict resolution

Indexed keywords

ELECTRIC LOAD DISPATCHING; OPTIMIZATION; RAILROAD TRANSPORTATION; RAILROADS; TRANSPORTATION;

COLUMN GENERATION; CONFLICT RESOLUTION; DECENTRALIZED SYSTEM; EFFECTIVE SOLUTION; FIX-AND-REGENERATE; METROPOLITAN RAILWAY; MULTI-LAYER SYSTEM; NP-HARDNESS;

LINEAR PROGRAMMING;

ALGORITHM; NETWORK ANALYSIS; OPTIMIZATION; RAILWAY TRANSPORT;

EID: 78650824016     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2010.08.001     Document Type: Article

References (29)

1. Brannlund U., Lindberg P., Nou A., Nilsson J. Railway timetabling using lagrangian relaxation. Transportation Science 1998, 32(4):358-369.
2. Brucker P., Knust S., Cheng T., Sharkhlevich N. Complexity results for flow-shop and open-shop scheduling problems with transportation delays. Annals of Operations Research 2004, 129(1-4):81-106.
3. Cacchiani V., Caprara A., Toth P. A column generation approach to train timetabling on a corridor. A Quarterly Journal of Operations Research 2008, 6(2):125-142.
4. Cai X., Goh C. A faster heuristic for the train scheduling problem. Computers & Operations Research 1994, 21(5):499-510.
5. Cai X., Goh C., Mees A. Greedy heuristic for rapid scheduling of trains on a single track. IIE Transactions 1998, 30(5):481-493.
6. Caprara A., Fischetti M., Toth P. Modeling and solving the train timetabling problem. Operations Research 2002, 50(5):851-861.
7. Caprara A., Monaci M., Toth P., Guida P. A lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Applied Mathematics 2006, 154(5):738-753.
8. Carey M. Extending a train pathing model from one-way to two-way track. Transportation Research Part B 1994, 28(5):395-400.
9. Carey M. A model and strategy for train pathing with choices of lines, platforms and routes. Transportation Research Part B 1994, 28(5):333-353.
10. Carey M., Lockwood D. A model, algorithms and strategy for train pathing. The Journal of the Operational Research Society 1995, 46(8):988-1005.
11. D'Ariano A., Pacciarelli D., Pranzo M. A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research 2007, 127(2):643-657.
12. D'Ariano A., Pranzo M., Hansen I. Conflict resolution and train speed coordination for solving real-time timetable perturbations. IEEE Transactions on Intelligent Transportation Systems 2007, 8(2):208-222.
13. Davis J., Kanet J. Single machine scheduling with early and tardy completion costs. Naval Research Logistics 1993, 40(1):85-101.
14. Dessouky M., Lu Q., Zhao J., Leachman R. An exact solution procedure to determine the optimal dispatching times for complex rail networks. IIE Transactions 2006, 38(2):141-152.
15. Garey M., Tarjan R., Wilfong G. One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research 1988, 13(2):330-348.
16. Higgins A., Kozan E., Ferreira L. Optimal scheduling of trains on a single line track. Transportation Research Part B 1996, 30(2):147-161.
17. Kraay D., Harker P. Real-time scheduling of freight railroads. Transportation Research Part B 1995, 29(3):213-229.
18. Kraay D., Harker P., Chen B. Optimal pacing of trains in freight railroads: model formulation and solution. Operations Research 1991, 39(1):82-99.
19. Mascis A., Pacciarelli D. Job-shop scheduling with blocking and no-wait constraints. European Journal of Operational Research 2002, 143(3):498-517.
20. Mascis A., Pacciarelli D., Pranzo M. Scheduling models for short-term railway traffic optimisation. Lecture Notes in Economics and Mathematical Systems 2008, 600:71-90.
21. Mazzarello M., Ottaviani E. A traffic management system for real-time traffic optimisation in railways. Transportation Research Part B 2007, 41(2):246-274.
22. Ow P., Morton E. The single machine early/tardy problem. Management Science 1989, 35(2):177-191.
23. Sahin I. Railway traffic control and train scheduling based on inter-train conflict management. Transportation Research Part B 1999, 33(24):511-534.
24. Törnquist, J., 2006. Computer-based decision support for railway traffic scheduling and dispatching: a review of models and algorithms. In: Proceedings of ATMOS2005 (Algorithmic MeThods and Models for Optimization of RailwayS), Palma de Mallorca, Spain, October 2005, Dagstuhl Research Online Publication Server (DROPS).
25. Törnquist J. Railway traffic disturbance management - an experimental analysis of disturbance complexity, management objectives and limitations in planning horizon. Transportation Research Part A 2007, 41(3):249-266.
26. Törnquist J., Persson J. N-tracked railway traffic re-scheduling during disturbances. Transportation Research Part B 2007, 41(3):342-362.
27. Valente J., Alves R. Improved heuristics for the early tardy scheduling problem with no idle time. Computers & Operations Research 2005, 32(3):557-569.
28. Yano C., Kim Y. Algorithms for a class of single machine weighted tardiness and earliness scheduling problems. European Journal of Operational Research 1991, 52(2):167-178.
29. Zhou X., Zhong M. Bicriteria train scheduling for high-speed passenger railroad planning applications. European Journal of Operational Research 2005, 167(3):752-771.