Susceptibility of optimal train schedules to stochastic disturbances of process times

Flexible Services and Manufacturing Journal

Volumn 26, Issue 4, 2014, Pages 466-489

  Larsen, Rune ^a   Pranzo, Marco ^b   D’Ariano, Andrea ^c   Corman, Francesco ^d   Pacciarelli, Dario ^c  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

^b UNIVERSITY OF SIENA   (Italy)

^c ROMA TRE UNIVERSITY   (Italy)

^d UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Delay minimization; Railway traffic optimization; Simulation; Uncertainty

Indexed keywords

BRANCH AND BOUND METHOD; RAILROAD TRANSPORTATION; RAILROADS; RANDOM PROCESSES; SCHEDULING; SENSITIVITY ANALYSIS;

BRANCH-AND-BOUND ALGORITHMS; DELAY MINIMIZATION; RAILWAY TRAFFIC; RAILWAY TRAFFIC MANAGEMENT; SIMULATION; STATISTICAL DISTRIBUTION; STOCHASTIC DISTURBANCES; UNCERTAINTY;

STOCHASTIC SYSTEMS;

EID: 84912051240     PISSN: 19366582     EISSN: 19366590     Source Type: Journal    
DOI: 10.1007/s10696-013-9172-9     Document Type: Article

References (39)

1. Ben-Tal A, Nemirovski A (2002) Robust optimization—methodology and applications. Math Program 92(3):453–480
2. Biederbick C, Suhl L (2007) Decision support tools for customer-oriented dispatching. Lecture notes in computer science, vol 4359. pp 171–183
3. Carey M (1999) Ex ante heuristic measures of schedule reliability. Transp Res Part B Methodol 33(7):473–494
4. Carey M, Carville S (2000) Testing schedule performance and reliability for train stations. J Oper Res Soc 51(6):666–682
5. Cicerone S, D’Angelo G, Di Stefano G, Frigioni D, Navarra A (2008) Delay management problem: complexity results and robust algorithms. In: Proceedings of the 2nd annual international conference on combinatorial optimization and applications, COCOA’08. Lecture notes in computer science, vol 5165. pp 458–468
6. Corman F, Goverde RMP, D’Ariano A (2009) Rescheduling dense train traffic over complex station interlocking areas. In: Ahuja RK, Moehring R, Zaroliagis C (eds) Robust and online large-scale optimization. Lecture notes in computer science, vol 5868. Springer, Berlin, pp 369–386
7. Corman F, D’Ariano A, Pacciarelli D, Pranzo M (2011a) Dispatching and coordination in multi-area railway traffic management. Tech. Rep. 2011-190, Dip. Inform. Autom. Roma Tre University
8. Corman F, D’Ariano A, Pranzo M, Hansen I (2011b) Effectiveness of dynamic reordering and rerouting of trains in a complicated and densely occupied station area. Transp Plan Technol 34(4):341–362
9. Corman F, D’Ariano A, Pacciarelli D, Pranzo M (2012) Bi-objective conflict detection and resolution in railway traffic management. Transp Res Part C Emerg Technol 20(1):79–94
10. D’Angelo G, Di Stefano G, Navarra A (2009) Recoverable-robust timetables for trains on single-line corridors. In: Proceedings of the 3rd international seminar on railway operations modelling and analysis–engineering and optimisation approaches (RailZurich2009)
11. D’Angelo G, Di Stefano G, Navarra A, Pinotti CM (2009) Recoverable robust timetables on trees. In: J Fiala, J Kratochvíl, M Miller (eds) Combinatorial optimization and applications. Lecture notes in computer science, vol 5573. Springer, Berlin, pp 451–462
12. D’Ariano A, Corman C, Pacciarelli D, Pranzo M (2008) Modeling reordering and local rerouting strategies to solve train conflicts during rail operations. Transp Sci 42(4):405–419
13. D’Ariano A, Pranzo M (2009) an advanced real-time train dispatching system for minimizing the propagation of delays in a dispatching area under severe disturbances. Netw Spat Econ 9(1):63–84
14. Dewilde T, Sels P, Cattrysse D, Vansteenwegen P (2011) Defining robustness of a railway timetable. In: Proceedings of the 4th international seminar on railway operations modelling and analysis (RailRome2011)
15. Fischetti M, Monaci M (2009) Light robustness. Lecture notes in computer science, vol 5868. pp 61–84
16. Fischetti M, Salvagnin D, Zanette A (2009) Fast approaches to improve the robustness of a railway timetable. Transp Sci 43(3):321–335
17. Ginkel A, Schöbel A (2007) To wait or not to wait? the bicriteria delay management problem in public transportation. Transp Sci 41(4):527–538
18. Goerigk M, Schöbel A (2010) An empirical analysis of robustness concepts for timetabling. In: Erlebach T, Lübbecke M (eds) Proceedings of 10th workshop on algorithmic approaches for transportation modelling, optimization, and systems (ATMOS10). Open access series in informatics schloss. Dagstuhl Publishing, Germany, pp 100–113
19. Hansen I, Pachl J (2008) Railway timetable and traffic: analysis-modelling- simulation. Eurailpress, Zagreb
20. Kroon L, Huisman D, Abbink E, Fioole P-J, Fischetti M, Maróti G, Steenbeek A, Shrijver L, Ybema R (2009) The new Dutch timetable: the OR revolution. Interfaces 39(1):6–17
21. Kliewer N, Suhl L (2011) A note on the online nature of the railway delay management problem. Networks 57(1):28–37
22. Larsen R, Pranzo M (2012) A framework for dynamic rescheduling problems. Tech. Rep. 2012–01, Dip. Ingegneria dell’Informazione. University of Siena
23. Liebchen C, Lübbecke M, Möhring R, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. Lecture notes in computer science, vol 5868. pp 1–27
24. Liebchen C, Schachtebeck M, Schöbel A, Stiller S, Prigge A (2010) Computing delay resistant railway timetables. Comput Oper Res 37(5):857–868
25. Lusby R, Larsen J, Ehrgott M, Ryan D (2011) Railway track allocation: models and methods. OR Spectr 33(4):843–883
26. Meng L, Zhou X (2011) Robust single-track train dispatching model under a dynamic and stochastic environment: a scenario-based rolling horizon solution approach. Transp Res Part B Methodol 45(7):1080–1102
27. Nielsen LK, Kroon L, Maróti G (2007) Absorption robustness of railway resource schedules. Technical report 113, ARRIVAL project FP6-02135-2
28. Ouelhadj D, Petrovic S (2009) A survey of dynamic scheduling in manufacturing systems. J Sched 12(4):417–431
29. Pranzo M, Meloni C, Pacciarelli D (2003) A new class of greedy heuristics for job shop scheduling problems. Lecture notes in computer science, vol 2647. pp 223–236
30. Römisch W (2003) Stability of stochastic programming problems. In: Ruszczynski A, Shapiro A (eds) Stochastic programming, handbooks of operations research and management science, vol 10. Elsevier, Amsterdam, pp 483–554
31. Salido M, Barber F, Ingolotti L (2008) Robustness in railway transportation scheduling. In: Proceedings of the world congress on intelligent control and automation (WCICA), pp 2833–2837
32. Schachtebeck M, Schöbel A (2010) To wait or not to wait and who goes first? Delay management with priority decisions. Transp Sci 44(3):307–321
33. Schöbel A, Kratz A (2009) A bicriteria approach for robust timetabling. Lecture notes in computer science, vol 5868. pp 119–144
34. Shafia M, Pourseyed Aghaee M, Sadjadi S, Jamili A (2012) Robust train timetabling problem: mathematical model and branch and bound algorithm. IEEE Trans Intell Transp Syst 13(1):307–317
35. Suhl L, Biederbick C, Kliewer N. (2001) Design of customer-oriented dispatching support for railways. In: Voss S, Daduna J (eds) Computer-aided transit scheduling, lecture notes in economics and mathematical systems 505:365–386
36. Takeuchi Y, Tomii N, Hirai C (2007) Evaluation method of robustness for train schedules. Q Rep RTRI (Railway Technical Research Institute) (Japan) 48(4):197–201
37. Vansteenwegen P, Van Oudheusden D (2006) Developing railway timetables which guarantee a better service. Eur J Oper Res 173(1):337–350
38. Yuan J (2006) Stochastic modelling of train delays and delay propagation in stations. TRAIL thesis series T2006/6, Delft, The Netherlands
39. Yuan J, Hansen IA (2007) Optimizing capacity utilization of stations by estimating knock-on train delays. Transp Res Part B 41(2):202–217