Abstract
Railway timetables are frequently modeled as discrete time expanded graphs. The selection of the magnitude of the discrete time unit can significantly alter the structure of the graph and change the solutions generated. This paper presents a method for generating improved mappings of real railway track segments to discrete arc graphs given a chosen discrete time unit. The results show that the dimensions of the generated graph are not monotonic and a range of values should be evaluated.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Brännlund, U., Lindberg, P., Nôu, A., Nilsson, J.: Railway timetabling using lagrangian relaxation. Transp. Sci. 32(4), 358–369 (1998)
Caimi, G., Burkolter, D., Herrmann, T., Chudak, F., Laumanns, M.: Design of a railway scheduling model for dense services. Netw. Spat. Econ. 9, 25–46 (2009)
Camm, J.D., Raturi, A.S., Tsubakitani, S.: Cutting big m down to size. Interfaces 20(5), 61–66 (1990)
Caprara, A., Fischetti, M., Toth, P.: Modeling and solving the train timetabling problem. Oper. Res. 50(5), 851–861 (2002)
Federal Railroad Administration: Railroad corridor transportation plans. Technical report, Office of Railroad Development, RDV-10, Federal Railroad Administration, Washington, DC (2005)
Harrod, S.: Modeling network transition constraints with hypergraphs. Transp. Sci. 45(1), 81–97 (2011)
Harrod, S.: A tutorial on fundamental model structures for railway timetable optimization. Surv. Oper. Res. Manag. Sci. 17, 85–96 (2012)
Lusby, R., Larsen, J., Ryan, D., Ehrgott, M.: Routing trains through railway stations: a new set-packing approach. Transp. Sci. 45(2), 228–245 (2011)
Mills, R., Perkins, S., Pudney, P.: Dynamic rescheduling of long-haul trains for improved timekeeping and energy conservation. Asia-Pac. J. Oper. Res. 8, 146–165 (1991)
Parkinson, T., Fisher, I.: TCRP report 13, rail transit capacity. Technical report, Transportation Research Board, Washington D.C (1996)
Şahin, G.: New combinatorial approaches for solving railroad planning and scheduling problems. Ph.D. Thesis, University of Florida, Gainesville, FL (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Harrod, S. (2018). Construction of Discrete Time Graphs from Real Valued Railway Line Data. In: Daniele, P., Scrimali, L. (eds) New Trends in Emerging Complex Real Life Problems. AIRO Springer Series, vol 1. Springer, Cham. https://doi.org/10.1007/978-3-030-00473-6_32
Download citation
DOI: https://doi.org/10.1007/978-3-030-00473-6_32
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00472-9
Online ISBN: 978-3-030-00473-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)