Advertisement

Construction of Discrete Time Graphs from Real Valued Railway Line Data

  • Steven HarrodEmail author
Chapter
Part of the AIRO Springer Series book series (AIROSS, volume 1)

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.

Keywords

Railway timetable Discrete optimization Railway operations 

References

  1. 1.
    Brännlund, U., Lindberg, P., Nôu, A., Nilsson, J.: Railway timetabling using lagrangian relaxation. Transp. Sci. 32(4), 358–369 (1998)CrossRefGoogle Scholar
  2. 2.
    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)CrossRefGoogle Scholar
  3. 3.
    Camm, J.D., Raturi, A.S., Tsubakitani, S.: Cutting big m down to size. Interfaces 20(5), 61–66 (1990)CrossRefGoogle Scholar
  4. 4.
    Caprara, A., Fischetti, M., Toth, P.: Modeling and solving the train timetabling problem. Oper. Res. 50(5), 851–861 (2002)MathSciNetCrossRefGoogle Scholar
  5. 5.
    Federal Railroad Administration: Railroad corridor transportation plans. Technical report, Office of Railroad Development, RDV-10, Federal Railroad Administration, Washington, DC (2005)Google Scholar
  6. 6.
    Harrod, S.: Modeling network transition constraints with hypergraphs. Transp. Sci. 45(1), 81–97 (2011)CrossRefGoogle Scholar
  7. 7.
    Harrod, S.: A tutorial on fundamental model structures for railway timetable optimization. Surv. Oper. Res. Manag. Sci. 17, 85–96 (2012)MathSciNetGoogle Scholar
  8. 8.
    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)CrossRefGoogle Scholar
  9. 9.
    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)zbMATHGoogle Scholar
  10. 10.
    Parkinson, T., Fisher, I.: TCRP report 13, rail transit capacity. Technical report, Transportation Research Board, Washington D.C (1996)Google Scholar
  11. 11.
    Şahin, G.: New combinatorial approaches for solving railroad planning and scheduling problems. Ph.D. Thesis, University of Florida, Gainesville, FL (2006)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2018

Authors and Affiliations

  1. 1.Technical University of DenmarkKongens LyngbyDenmark

Personalised recommendations