Determining operations affected by delay in predictive train timetables
暂无分享,去创建一个
[1] Erhan Kozan,et al. Techniques for restricting multiple overtaking conflicts and performing compound moves when constructing new train schedules , 2009, Math. Comput. Model..
[2] David M. Ryan,et al. The train driver recovery problem - A set partitioning based model and solution method , 2010, Comput. Oper. Res..
[3] Katsuhiko Takahashi,et al. Robustness optimisation of the minimum makespan schedules in a job shop , 2003, Int. J. Manuf. Technol. Manag..
[4] Nobuto Nakamura,et al. Robustness of the minimum makespan schedules in a job shop , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).
[5] Erhan Kozan,et al. Scheduling trains as a blocking parallel-machine job shop scheduling problem , 2009, Comput. Oper. Res..
[6] Erhan Kozan,et al. Techniques for absolute capacity determination in railways , 2006 .
[7] Paolo Toth,et al. Nominal and robust train timetabling problems , 2012, Eur. J. Oper. Res..
[8] Dario Pacciarelli,et al. Reordering and Local Rerouting Strategies to Manage Train Traffic in Real Time , 2008, Transp. Sci..
[9] Ramesh Hariharan,et al. Improved decremental algorithms for maintaining transitive closure and all-pairs shortest paths , 2002, STOC '02.
[10] Erhan Kozan,et al. Scheduling Trains with Priorities: A No-Wait Blocking Parallel-Machine Job-Shop Scheduling Model , 2011, Transp. Sci..
[11] Matteo Fischetti,et al. A Lagrangian Heuristic for Robustness, with an Application to Train Timetabling , 2012, Transp. Sci..
[12] Erhan Kozan,et al. Techniques for inserting additional trains into existing timetables , 2009 .
[13] Alena Koubková,et al. Algorithms for transitive closure , 2002, Inf. Process. Lett..
[14] Cameron G. Walker,et al. Simultaneous disruption recovery of a train timetable and crew roster in real time , 2005, Comput. Oper. Res..
[15] Dario Pacciarelli,et al. A tabu search algorithm for rerouting trains during rail operations , 2007 .
[16] Andrea D'Ariano,et al. Improving real-time train dispatching: Models, algorithms and applications , 2008 .
[17] Andrea D'Ariano. Improving Real-Time Train Dispatching: Models, Algorithms and Applications - TRAIL Thesis Series no. T2008/6, The Netherlands TRAIL Research School , 2008 .
[18] Sebastian Stiller,et al. Computing delay resistant railway timetables , 2010, Comput. Oper. Res..
[19] Erhan Kozan,et al. A disjunctive graph model and framework for constructing new train schedules , 2010, Eur. J. Oper. Res..
[20] Dario Pacciarelli,et al. A branch and bound algorithm for scheduling trains in a railway network , 2007, Eur. J. Oper. Res..
[21] Erhan Kozan,et al. Scheduling Trains on Parallel Lines with Crossover Points , 2009, J. Intell. Transp. Syst..
[22] Erhan Kozan,et al. A sequencing approach for creating new train timetables , 2010, OR Spectr..
[23] R. L. Burdett,et al. A SEQUENCING APPROACH FOR TRAIN TIMETABLING , 2007 .
[24] Matteo Fischetti,et al. Fast Approaches to Improve the Robustness of a Railway Timetable , 2009, Transp. Sci..
[25] Rommert Dekker,et al. Stochastic Improvement of Cyclic Railway Timetables , 2006 .
[26] Giuseppe F. Italiano,et al. Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures , 2006, J. Discrete Algorithms.
[27] Erhan Kozan,et al. A practical approach for identifying expected solution performance and robustness in operations research applications , 2012 .
[28] Paolo Toth,et al. Scheduling extra freight trains on railway networks , 2010 .