Deutsche Bahn Schedules Train Rotations Using Hypergraph Optimization

Published Online:https://doi.org/10.1287/inte.2020.1069

References

  • Ahuja RK, Liu J, Orlin JB, Sharma D, Shughart LA (2005) Solving real-life locomotive scheduling problems. Transportation Sci. 39(4):503–517.LinkGoogle Scholar
  • Beckenbach I (2018) A hypergraph network simplex algorithm. Kliewer N, Ehmke JF, Borndörfer R, eds. Operations Research Proceedings 2017 (Springer International Publishing, Cham, Switzerland), 309–315.Google Scholar
  • Beckenbach I (2019) Matchings and flows in hypergraphs. Doctoral dissertation, Freie Universität Berlin, Berlin.Google Scholar
  • Beckenbach I, Borndörfer R (2018) Hall’s and Kőnig’s theorem in graphs and hypergraphs. Discrete Math. 341(10):2753–2761.Google Scholar
  • Borndörfer R, Heismann O (2015) The hypergraph assignment problem. Discrete Optim. 15(February):15–25.Google Scholar
  • Borndörfer R, Reuther M, Schlechte T (2014) A coarse‐to‐fine approach to the railway rolling stock rotation problem. Funke S, Mihalák M, eds. Proc. 14th Workshop Algorithmic Approaches Transportation Model Optim. Systems OpenAccess Series Informatics (OASIcs), vol. 42 (Schloss, Dagstuhl, Germany), 79–91.Google Scholar
  • Borndörfer R, Grimm B, Reuther M, Schlechte T (2017) Template‐based re‐optimization of rolling stock rotations. Public Transport 9(1–2):365–383.Google Scholar
  • Borndörfer R, Grimm B, Reuther M, Schlechte T (2019) Optimization of handouts for rolling stock rotations. J. Rail Transport Planning Management 10(August):1–8.Google Scholar
  • Borndörfer R, Reuther M, Schlechte T, Weider S (2011) A hypergraph model for railway vehicle rotation planning. Caprara A, Kontogiannis S, eds. Proc. 11th Workshop Algorithmic Approaches Transportation Model Optim. Systems OpenAccess Ser. Informatics (OASIcs), vol. 20 (Schloss, Dagstuhl, Germany), 146–155.Google Scholar
  • Borndörfer R, Reuther M, Schlechte T, Waas K, Weider S (2015) Integrated optimization of rolling stock rotations for intercity railways. Transportation Sci. 50(3):863–877.LinkGoogle Scholar
  • Borndörfer R, Klug T, Lamorgese L, Mannino C, Reuther M, Schlechte T, eds. (2018) Handbook of Optimization in the Railway Industry (Springer International Publishing, Cham, Switzerland).Google Scholar
  • Cacchiani V, Caprara A, Toth P (2019) An effective peak period heuristic for railway rolling stock. Transportation Sci. 53(3):746–762.AbstractGoogle Scholar
  • Federal Environment Agency (2012) Daten zum Verkehr. Accessed August 25, 2020, https://www.umweltbundesamt.de/sites/default/files/medien/publikation/long/4364.pdf.Google Scholar
  • Federal Ministry of Transport and Digital Infrastructure (2020) Verkehr in Zahlen 2019/2020. Accessed August 3, 2020, https://www.bmvi.de/SharedDocs/DE/Publikationen/G/verkehr-in-zahlen-2019-pdf.Google Scholar
  • Giacco GL, D’Ariano A, Pacciarelli D (2014) Rolling stock rostering optimization under maintenance constraints. J. Intelligent Transportation Systems Tech. Planning Oper. 18(1):95–105.Google Scholar
  • Grimm B, Borndörfer R, Reuther M, Schlechte T (2019) A cut separation approach for the rolling stock rotation problem with vehicle maintenance. Cacchiani V, Marchetti-Spaccamela A, eds. Proc. 19th Symposium Algorithmic Approaches Transportation Model Optim. Systems OpenAccess Ser. Informatics (OASIcs), vol. 75 (Schloss, Dagstuhl, Germany), 1:1–1:2.Google Scholar
  • Holland C, Levis J, Nuggehalli R, Santill B, Winters J (2017) UPS optimizes delivery routes. Interfaces 47(1):8–23.LinkGoogle Scholar
  • Ireland P, Case R, Fallis J, Van Dyke C, Kuehn J, Meketon M (2004) The Canadian Pacific Railway transforms operations by using models to develop its operating plans. Interfaces 34(1):5–14.LinkGoogle Scholar
  • Kroon L, Huisman D, Abbink E, Fioole P-J, Fischetti M, Maróti G, Schrijver A, Steenbeek A, Ybema R (2009) The new Dutch timetable: The OR revolution. Interfaces 39(1):6–17.LinkGoogle Scholar
  • Lusby RM, Haahr JT, Larsen J, Pisinger D (2017) A branch-and-price algorithm for railway rolling stock rescheduling. Transportation Res. Part B: Methodological 99(May):228–250.Google Scholar
  • Ministry of Transport Baden-Württemberg (2015) DB is awarded the contract for local rail transport in network 3b between Crailsheim and Konstanz/Freudenstadt. Accessed August 4, 2020, https://vm.baden-wuerttemberg.de/de/service/presse/pressemitteilung/pid/db-erhaelt-den-zuschlag-fuer-spnv-im-netz-3b-zwischen-crailsheim-und-konstanzfreudenstadt/.Google Scholar
  • Ministry of Transport Baden-Württemberg (2017) Local traffic on the Rhine will be expanded significantly and faster. Accessed August 4, 2020, https://vm.baden-wuerttemberg.de/de/service/presse/pressemitteilung/pid/nahverkehr-auf-der-rheinschiene-wird-deutlich-ausgeweitet-und-schneller/.Google Scholar
  • Ministry of Transport Baden-Württemberg (2019) Karlsruher Netze: DB Regio is to receive a contract for transport services. Accessed August 4, 2020, https://vm.baden-wuerttemberg.de/de/service/presse/pressemitteilung/pid/karlsruher-netze-db-regio-soll-zuschlag-fuer-verkehrsleistungen-erhalten/.Google Scholar
  • Öztürk A (2015) Implementierung eines rolling horizon ansatzeszur anwendung bei derlokomotiveneinsatzoptimierung. Bachelor’s thesis, Helmut-Schmidt-Universität Hamburg, Hamburg, Germany.Google Scholar
  • Reuther M (2017) Mathematical optimization of rolling stock rotations. Doctoral dissertation, Technische Universität Berlin, Berlin.Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.