Page 148 - 360.revista de Alta Velocidad - Nº 5

Grande, Zacarías. Blanco López, Marta. García Tamames, Alberto. Castillo, Enrique.

how it depends on tiredness and attention levels, as being one of the most important factors in
the safety of railway networks and lines.
A simple list of items can be given for a computer program to build the acyclic graph associated
with the Bayesian network automatically.
The proposed partitioning technique reduces the initial nonlinear complexity to a complexity
which is linear with the number of nodes.
The examples analyzed in this article show that the method is able to identify and quantify
relevant incidents and their probabilities of occurrence.
The backward possibilities of the Bayesian network permits to analyze the causes of incidents
and especially those leading to fatal accidents.
The most critical part of the proposed model is the parameter estimation and calibration,
which must be done with the collaboration of various groups of experts.
5. Bibliography

• Amit, I. & Goldfarb, D., 1971. The timetable problem for railways. Developments in
Operations Research, Volume 2, pp. 379-387.
• Assad, A., 1980. Models for rail transportation. Transportation Research Part A, Volume 14,
pp. 205-220.
• Beales, L., 2002. Guidance on the Preparation of Risk Assessments within Railway Safety
Cases, s.l.: RSSB.
• Burdett, R. L. & Kozan, E., 2010. A disjunctive graph model and framework for constructing
new train schedules. European Journal of Operational Research, Volume 2010, pp. 85-98.
• Cacchiani, V. & Toth, P., 2012. Nominal and Robust Train Timetabling Problems. European
Journal of Operational Research, Volume 219, pp. 727-737.

• Caprara, A., Fischetti, M. & Toth, P., 2002. Modeling and solving the train timetabling
problem. Operations Research, Volume 50, pp. 851-861.

• Carey, M., 1994. A model and strategy for train pathing with choice of lines, platforms and
routes. Transportation Research Part B, Volume 28, pp. 333-353.

• Carey, M. & Crawford, I., 2007. Scheduling trains on a network of busy complex stations.
• Transportation Research Part B, Volume 41, pp. 159-178.
• Carey, M. & Lockwood, D., 1995. A model, algorithms and strategy for train pathing. Journal
of the Operational Research Society, Volume 46, pp. 988-1005.
• Castillo, E. et al., 2015. An alternate double-single track proposal for high-speed peripheral
railway lines. Computer Aided Civil and Infrastructure Engineering, Volume 30, pp. 181201.
• Castillo, E., Gallego, I., Ureña, J. M. & Coronado, J. M., 2009. Timetabling optimization of
a single railway track line with sensitivity analysis. TOP, Volume 17, pp. 256-287.
• Castillo, E., Gallego, I., Ureña, J. M. & Coronado, J. M., 2011. Timetabling optimization
of a mixed double- and single-tracked railway network. Applied Mathematical Modelling,
Volume 35, pp. 859-878.
• Castillo, E., Grande, Z., Moraga, P. & Sánchez Vizcano, J., 2016. A time partitioning technique
for railway line design and timetable optimization. Computer Aided Civil And Infrastructure
Engineering, Volume 31, pp. 599-616.
• Cordeau, J. F., Toth, P. & Vigo, D., 1998. A survey of optimization models for train routing

146 360.revista de alta velocidad