Access the full text.
Sign up today, get DeepDyve free for 14 days.
A Schöbel (2007)
Railway optimization
A D’Ariano, M Pranzo, IA Hansen (2007)
Conflict resolution and train speed coordination for solving real-time timetable perturbationsIEEE Trans Intell Transp Syst, 8
T Siefer, A Radtke (2006)
Proceedings of 7th world congress on railway research
J Törnquist, J Persson (2007)
N-tracked railway traffic re-scheduling during disturbancesTransp Res, Part B, Methodol, 41
A Berger, A Gebhardt, M Müller-Hannemann, M Ostrowski (2011)
11th workshop on algorithmic approaches for transportation modelling, optimization, and systems
F Corman, RMP Goverde, A D’Ariano (2009)
Robust and online large-scale optimization
M Schachtebeck, A Schöbel (2010)
To wait or not to wait–and who goes first? Delay management with priority decisionsTransp Sci, 44
(2008)
Railway timetable & traffic—analysis, modelling, simulation
A Mascis, D Pacciarelli (2002)
Job-shop scheduling with blocking and no-wait constraintsEur J Oper Res, 143
M Kettner, B Sewcyk, C Eickmann (2003)
Proceedings of the European transport conference (ETC)
A D’Ariano, D Pacciarelli, M Pranzo (2007)
A branch and bound algorithm for scheduling trains in a railway networkEur J Oper Res, 183
RMP Goverde (2007)
Railway timetable stability analysis using max-plus system theoryTransp Res, Part B, Methodol, 41
G Caimi (2012)
2578Comput Oper Res, 39
JS Hooghiemstra (1996)
Computers in railways V
G Caimi, D Burkolter, T Herrmann, F Chudak, M Laumanns (2009)
Design of a railway scheduling model for dense servicesNetw Spat Econ, 9
F Corman (2010)
219Public Transp, 2
G Caimi, M Fuchsberger, M Laumanns, M Lüthi (2012)
A model–predictive control approach for discrete-time rescheduling in complex central railway station areasComput Oper Res, 39
F Corman, A D’Ariano, D Pacciarelli, M Pranzo (2012)
Optimal inter-area coordination of train rescheduling decisionsTransp Res, Part E, Logist Transp Rev, 48
TJJ Boom, B Schutter (2007)
Proceedings of the 2nd international seminar on railway operations modelling and analysis (RailHannover2007)
L Suhl, C Biederbick, N Kliewer (2001)
Computer-aided transit scheduling. LNEMS
N Tomii, T Yoshiaki, T Noriyuki, H Chikara, M Kunimitsu (2005)
Innovations in applied artificial intelligence
F Corman, A D’Ariano, D Pacciarelli, M Pranzo (2010)
Centralized versus distributed systems to reschedule trains in two dispatching areasPublic Transp, 2
G Caimi (2009)
25Netw Spat Econ, 9
F Corman, A D’Ariano, D Pacciarelli, M Pranzo (2012)
Bi-objective conflict detection and resolution in railway traffic managementTransp Res, Part C, Emerg Technol, 20
F Corman (2009)
100
T Schlechte, R Borndörfer, B Erol, T Graffagnino, E Swarat (2011)
Micro–macro transformation of railway networksJ Rail Transp Plann Manag, 1
J Törnquist Krasemann (2011)
Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbancesTransp Res, Part C, Emerg Technol, 20
P Kecman, F Corman, A D’Ariano, RMP Goverde (2012)
Proceedings of the conference on advanced systems for public transport (CASPT12)
A Nash, D Huerlimann (2004)
Computers in railways IX
YH Min, MJ Park, SP Hong, SH Hong (2011)
An appraisal of a column-generation-based algorithm for centralized train-conflict resolution on a metropolitan railway networkTransp Res, Part B, Methodol, 45
RMP Goverde (2010)
A delay propagation algorithm for large-scale railway traffic networksTransp Res, Part C, Emerg Technol, 18
In the last decades of railway operations research, microscopic models have been intensively studied to support traffic operators in managing their dispatching areas. However, those models result in long computation times for large and highly utilized networks. The problem of controlling country-wide traffic is still open since the coordination of local areas is hard to tackle in short time and there are multiple interdependencies between trains across the whole network. This work is dedicated to the development of new macroscopic models that are able to incorporate traffic management decisions. Objective of this paper is to investigate how different levels of detail and number of operational constraints may affect the applicability of models for network-wide rescheduling in terms of quality of solutions and computation time. We present four different macroscopic models and test them on the Dutch national timetable. The macroscopic models are compared with a state-of-the-art microscopic model. Trade-off between computation time and solution quality is discussed on various disturbed traffic conditions.
Public Transport – Springer Journals
Published: Mar 12, 2013
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.