Simultaneous train rerouting and rescheduling on an N-track network: A model reformulation with network-based cumulative flow variables

Transportation Research Part B: Methodological

Volumn 67, Issue , 2014, Pages 208-234

  Meng, Lingyun ^a   Zhou, Xuesong ^b  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b Arizona State University   (United States)

Author keywords

Cumulative flow variable; Lagrangian relaxation; Rail network; Train dispatching

Indexed keywords

COMPLEX NETWORKS; INTEGER PROGRAMMING; LAGRANGE MULTIPLIERS; LINEAR PROGRAMMING; RAILROAD TRANSPORTATION;

EFFICIENT DECOMPOSITION; FLOW VARIABLE; INTEGER PROGRAMMING MODELS; LAGRANGIAN RELAXATION; NUMERICAL EXPERIMENTS; PERFORMANCE BENEFITS; RAIL NETWORKS; TRAIN DISPATCHING;

ELECTRIC LOAD DISPATCHING;

ALGORITHM; NUMERICAL MODEL; OPTIMIZATION; RAILWAY TRANSPORT; TRAIN; TRANSPORTATION SAFETY; TRANSPORTATION SYSTEM;

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

References (47)

1. Adenso-Díaz B., Oliva González M., González-Torre P. On-line timetable rescheduling in regional train services. Transp. Res. Part B 1999, 33(6):387-398.
2. Assad A. Models for rail transportation. Transp. Res. Part A 1980, 14(3):205-220.
3. Bertsimas D.J., Stock S. The air traffic flow management problem with enroute capacities. Oper. Res. 1998, 46(3):406-422.
4. Brännlund U., Lindberg P.O., Nõu A., Nilsson J-E. Railway timetabling using Lagrangian relaxation. Transp. Sci. 1998, 32(4):358-369.
5. Cacchiani V., Caprara A., Toth P. A column generation approach to train timetabling on a corridor. 4OR 2008, 6(2):125-142.
6. Cacchiani V., Caprara A., Toth P. Non-cyclic train timetabling and comparability graphs. Oper. Res. Lett. 2010, 38(3):179-184.
7. Cacchiani V., Caprara A., Toth P. Scheduling extra freight trains on rail networks. Transp. Res. Part B 2010, 44(2):215-231.
8. Caimi G., Fuchsberger M., Laumanns M., Lüthi M. A model predictive control approach for discrete-time rescheduling in complex central railway station areas. Comput. Oper. Res. 2012, 39(11):2578-2593.
9. Caprara A., Fischetti M., Toth P. Modeling and solving the train timetabling problem. Oper. Res. 2002, 50(5):851-861.
10. Caprara A., Monaci M., Toth P., Guida P.L. A Lagrangian heuristic algorithm for a real-world train timetabling problem. Discrete Appl. Math. 2006, 154(5):738-753.
11. Carey M. A model and strategy for train pathing with choice of lines, platforms, and routes. Transp. Res. Part B 1994, 28(5):333-353.
12. Carey M. Extending a train pathing model from one-way to two-way track. Transp. Res. Part B 1994, 28(5):395-400.
13. Carey M., Crawford I. Scheduling trains on a network of busy complex stations. Transp. Res. Part B 2007, 41(2):159-178.
14. Carey M., Lockwood D. A model, algorithms and strategy for train pathing. J. Oper. Res. Soc. 1995, 46(8):988-1005.
15. Cassidy M. Traffic flow and capacity. Handbook of Transportation Science 2003, 155-192. Kluwer Academic Publishers.
16. Castillo E., Gallego I., Ureña J.M., Coronado J.M. Timetabling optimization of a mixed double-and single-track rail network. Appl. Math. Model. 2011, 35(2):859-878.
17. Cordeau J., Toth P., Vigo D. A survey of optimization models for train routing and scheduling. Transp. Sci. 1998, 32(4):380-404.
18. Corman F., D'Ariano A., Pacciarelli D., Pranzo M. A tabu search algorithm for rerouting trains during rail operations. Transp. Res. Part B 2010, 44(1):175-192.
19. Corman F., D'Ariano A., Hansen I.A., Pacciarelli D. Optimal multi-class rescheduling of railway traffic. J. Rail Trans. Planning Manage. 2011, 1(1):14-24.
20. Corman F., D'Ariano A., Pacciarelli D., Pranzo M. Optimal inter-area coordination of train rescheduling decisions. Transp. Res. Part E 2012, 48(1):71-88.
21. Corman F., D'Ariano A., Pacciarelli D., Pranzo M. Dispatching and coordination in multi-area railway traffic management. Comput. Oper. Res. 2014, 44(1):146-160.
22. D'Ariano A., Pacciarelli D., Pranzo M. A branch and bound algorithm for scheduling trains in a rail network. Eur. J. Oper. Res. 2007, 183(2):643-657.
23. D'Ariano A., Pranzo M., Hansen I.A. Conflict resolution and train speed co-ordination for solving real-time timetable perturbations. IEEE Trans. Intell. Transp. Syst. 2007, 8(2):208-222.
24. D'Ariano A., Corman F., Pacciarelli D., Pranzo M. Reordering and local rerouting strategies to manage train traffic in real time. Transp. Sci. 2008, 42(4):405-419.
25. Dorfman M., Medanic J. Scheduling trains on a rail network using a discrete event model of rail traffic. Transp. Res. Part B 2004, 38(1):81-98.
26. FastTrain, 2013. An open source tool for fast train scheduling. http://code.google.com/p/fast-train/.
27. Hall R.W. Transportation queueing. Handbook of Transportation Science 2003, 113-154. Kluwer Academic Publishers.
28. Hansen I.A. Rail Network timetabling and dynamic traffic management. Int. J. Civ. Eng. 2010, 8(1):19-32.
29. Harrod S. Modeling network transition constraints with hypergraphs. Transp. Sci. 2011, 45(1):81-97.
30. INFORMS RAS, 2012. Problem description and released data set for problem solving competition-2012. http://www.informs.org/Community/RAS/Problem-Solving-ompetition/2012-RAS-Problem-Solving-Competition.
31. Iqbal S.M.Z., Grahn H., Törnquist J. Multi-Strategy Based Train Re-Scheduling During Railway Traffic Disturbances. Proceedings of the 5th International Seminar on Rail Operations Modeling and Analysis (RailCopenhagen 2013) 2013, 387-405. Technical University of Denmark.
32. Jovanovic, D., 1989. Improving rail in-time performance: models, algorithms and applications. PhD thesis, University of Pennsylvania, USA.
33. Kecman P., Corman F., D'Ariano A., Goverde R.M.P. Rescheduling models for railway traffic management in large-scale networks. Publ. Trans. Planning Oper. 2013, 5(1-2):95-123.
34. Lee Y., Chen C. A heuristic for the train pathing and timetabling problem. Transp. Res. Part B 2009, 43(8-9):837-851.
35. Li F., Gao Z., Li K., Yang L. Efficient scheduling of rail traffic based on global information of train. Transp. Res. Part B 2008, 42(10):1008-1030.
36. Mannino C., Mascis A. Optimal real-time traffic control in metro stations. Oper. Res. 2009, 57(4):1026-1039.
37. Meng L., Zhou X. Robust single-track train dispatching model under a dynamic and stochastic environment: a scenario-based rolling horizon solution approach. Transp. Res. Part B 2011, 45(7):1080-1102.
38. Mu S., Dessouky M. Scheduling freight trains traveling on complex networks. Transp. Res. Part B 2011, 45(7):1103-1123.
39. NTM, 2013. A formulation for network train traffic management. http://code.google.com/p/networked-train-scheduling/.
40. Pacciarelli, D., 2013. Introduction and classification of existing rescheduling literature. Course lecture in the 5th International Seminar on Rail Operations Modeling and Analysis (RailCopenhagen 2013), Technical University of Denmark, Denmark. http://indico.conferences.dtu.dk/internalPage.py?pageId=8&confId=120.
41. Pallottino S., Scutellà M.G. Shortest path algorithms in transportation models: classical and innovative aspects. Equilibrium and Advanced Transportation Modelling 1998, 245-281. Kluwer Academic Publishers, MA. P. Marcotte, S. Nguyen (Eds.).
42. Quaglietta E., Corman F., Goverde R.M.P. Stability of railway dispatching solutions under a stochastic and dynamic environment. Proceedings of the 5th International Seminar on Rail Operations Modeling and Analysis (RailCopenhagen 2013) 2013, 215-234. Technical University of Denmark.
43. Theeg G., Vlasenko S. Railway Signaling and Interlocking 2009, Eurailpress, Hamburg, Germany.
44. Törnquist J., Persson J. N-tracked rail traffic re-scheduling during disturbances. Transp. Res. Part B 2007, 41(3):342-362.
45. Yan, C., Yang, L., 2012. Mixed-integer programming based approaches for the movement planner problem: model, heuristics and decomposition. Technical Report, First Prize Winner, INFORMS RAS Problem Solving Competition 2012.
46. Zhou X., Zhong M. Single-track train timetabling with guaranteed optimality: branch-and-bound algorithms with enhanced lower bounds. Transp. Res. Part B 2007, 41(3):320-341.
47. Ziliaskopoulos A., Mahmassani H.S. A time-dependent shortest path algorithm for real-time intelligent vehicle/highway systems applications. Transp. Res. Record 1993, 1408:94-100.