Skip to main content
Top

2018 | OriginalPaper | Chapter

Construction of Discrete Time Graphs from Real Valued Railway Line Data

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

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.

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Brännlund, U., Lindberg, P., Nôu, A., Nilsson, J.: Railway timetabling using lagrangian relaxation. Transp. Sci. 32(4), 358–369 (1998)CrossRef Brännlund, U., Lindberg, P., Nôu, A., Nilsson, J.: Railway timetabling using lagrangian relaxation. Transp. Sci. 32(4), 358–369 (1998)CrossRef
2.
go back to reference 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)CrossRef 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)CrossRef
3.
go back to reference Camm, J.D., Raturi, A.S., Tsubakitani, S.: Cutting big m down to size. Interfaces 20(5), 61–66 (1990)CrossRef Camm, J.D., Raturi, A.S., Tsubakitani, S.: Cutting big m down to size. Interfaces 20(5), 61–66 (1990)CrossRef
4.
go back to reference Caprara, A., Fischetti, M., Toth, P.: Modeling and solving the train timetabling problem. Oper. Res. 50(5), 851–861 (2002)MathSciNetCrossRef Caprara, A., Fischetti, M., Toth, P.: Modeling and solving the train timetabling problem. Oper. Res. 50(5), 851–861 (2002)MathSciNetCrossRef
5.
go back to reference Federal Railroad Administration: Railroad corridor transportation plans. Technical report, Office of Railroad Development, RDV-10, Federal Railroad Administration, Washington, DC (2005) Federal Railroad Administration: Railroad corridor transportation plans. Technical report, Office of Railroad Development, RDV-10, Federal Railroad Administration, Washington, DC (2005)
6.
go back to reference Harrod, S.: Modeling network transition constraints with hypergraphs. Transp. Sci. 45(1), 81–97 (2011)CrossRef Harrod, S.: Modeling network transition constraints with hypergraphs. Transp. Sci. 45(1), 81–97 (2011)CrossRef
7.
go back to reference Harrod, S.: A tutorial on fundamental model structures for railway timetable optimization. Surv. Oper. Res. Manag. Sci. 17, 85–96 (2012)MathSciNet Harrod, S.: A tutorial on fundamental model structures for railway timetable optimization. Surv. Oper. Res. Manag. Sci. 17, 85–96 (2012)MathSciNet
8.
go back to reference 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)CrossRef 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)CrossRef
9.
go back to reference 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)MATH 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)MATH
10.
go back to reference Parkinson, T., Fisher, I.: TCRP report 13, rail transit capacity. Technical report, Transportation Research Board, Washington D.C (1996) Parkinson, T., Fisher, I.: TCRP report 13, rail transit capacity. Technical report, Transportation Research Board, Washington D.C (1996)
11.
go back to reference Şahin, G.: New combinatorial approaches for solving railroad planning and scheduling problems. Ph.D. Thesis, University of Florida, Gainesville, FL (2006) Şahin, G.: New combinatorial approaches for solving railroad planning and scheduling problems. Ph.D. Thesis, University of Florida, Gainesville, FL (2006)
Metadata
Title
Construction of Discrete Time Graphs from Real Valued Railway Line Data
Author
Steven Harrod
Copyright Year
2018
DOI
https://doi.org/10.1007/978-3-030-00473-6_32

Premium Partner