Skip to main content
Top
Published in: OR Spectrum 1/2015

01-01-2015 | Regular Article

Timetabling with passenger routing

Authors: Marie Schmidt, Anita Schöbel

Published in: OR Spectrum | Issue 1/2015

Log in

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

search-config
loading …

Abstract

Customer-oriented optimization of public transport needs data about the passengers in order to obtain realistic models. Current models take passengers’ data into account by using the following two-phase approach: In a first phase, routes for the passengers are determined. In a second phase, the actual planning of lines, timetables, etc., takes place using the knowledge on which routes passengers want to travel from the results of the first phase. However, the actual route a passenger will take strongly depends on the timetable, which is not yet known in the first phase. Hence, the two-phase approach finds non-optimal solutions in many cases. In this paper we study the integrated problem of determining a timetable and the passengers’ routes simultaneously. We investigate the computational complexity of the problem and present solution approaches which are tested on close-to-real-world data.

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

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!

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!

Appendix
Available only for authorised users
Literature
go back to reference Anhalt J (2012) Eine iterative Heuristik für aperiodische Fahrplangestaltung mit OD-Paaren. Master’s thesis, Georg-August-Universität Göttingen (in German) Anhalt J (2012) Eine iterative Heuristik für aperiodische Fahrplangestaltung mit OD-Paaren. Master’s thesis, Georg-August-Universität Göttingen (in German)
go back to reference Bellare M, Goldwasser S, Lund C, Russel A (1993) Efficient probabilistically checkable proofs and applications to approximation. In: STOC ’93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing. ACM, New York, USA, pp 294–304 Bellare M, Goldwasser S, Lund C, Russel A (1993) Efficient probabilistically checkable proofs and applications to approximation. In: STOC ’93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing. ACM, New York, USA, pp 294–304
go back to reference Borndörfer R, Grötschel M, Pfetsch ME (2007) A column-generation approach to line planning in public transport. Transp Sci 41(1):123–132CrossRef Borndörfer R, Grötschel M, Pfetsch ME (2007) A column-generation approach to line planning in public transport. Transp Sci 41(1):123–132CrossRef
go back to reference Borndörfer R, Grötschel M, Pfetsch ME (2008) Models for line planning in public transport. In: Hickman M, Mirchandani P, Voß S (eds) Computer-aided systems in public transport, vol 600., Lecture notes in economics and mathematical systemsSpringer, Berlin, pp 363–378CrossRef Borndörfer R, Grötschel M, Pfetsch ME (2008) Models for line planning in public transport. In: Hickman M, Mirchandani P, Voß S (eds) Computer-aided systems in public transport, vol 600., Lecture notes in economics and mathematical systemsSpringer, Berlin, pp 363–378CrossRef
go back to reference Dollevoet T, Huisman D (2011) Fast heuristics for delay management with passenger rerouting. Tech rep. Econometric Institute, Erasmus University Rotterdam Dollevoet T, Huisman D (2011) Fast heuristics for delay management with passenger rerouting. Tech rep. Econometric Institute, Erasmus University Rotterdam
go back to reference Dollevoet T, Huisman D, Schmidt M, Schöbel A (2012) Delay management with re-routing of passengers. Transp Sci 46(1):74–89CrossRef Dollevoet T, Huisman D, Schmidt M, Schöbel A (2012) Delay management with re-routing of passengers. Transp Sci 46(1):74–89CrossRef
go back to reference Feige U (1998) A threshold of ln n for approximating set cover. J ACM 45:634–652CrossRef Feige U (1998) A threshold of ln n for approximating set cover. J ACM 45:634–652CrossRef
go back to reference Fischetti M, Monaci M (2009) Light robustness. In: Ahuja RK, Möhring R, Zaroliagis C (eds) Robust and online large-scale optimization., Lecture note on computer scienceSpringer, New York, pp 61–84CrossRef Fischetti M, Monaci M (2009) Light robustness. In: Ahuja RK, Möhring R, Zaroliagis C (eds) Robust and online large-scale optimization., Lecture note on computer scienceSpringer, New York, pp 61–84CrossRef
go back to reference Fischetti M, Salvagnin S, Zanette A (2009) Fast approaches to improve the robustness of a railway timetable. Transp Sci 43:321CrossRef Fischetti M, Salvagnin S, Zanette A (2009) Fast approaches to improve the robustness of a railway timetable. Transp Sci 43:321CrossRef
go back to reference Garey M, Johnson D (1979) Computers and intractability—a guide to the theory of NP-completeness. Freeman, San Francisco Garey M, Johnson D (1979) Computers and intractability—a guide to the theory of NP-completeness. Freeman, San Francisco
go back to reference Goerigk M, Schöbel A (2010) An empirical analysis of robustness concepts for timetabling. In: Erlebach T, Lübbecke M (eds) Proceedings of ATMOS, OASIcs, vol 14. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp 100–113 Goerigk M, Schöbel A (2010) An empirical analysis of robustness concepts for timetabling. In: Erlebach T, Lübbecke M (eds) Proceedings of ATMOS, OASIcs, vol 14. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp 100–113
go back to reference Kinder M (2008) Models for periodic timetabling. Master’s thesis, Technische Universität, Berlin Kinder M (2008) Models for periodic timetabling. Master’s thesis, Technische Universität, Berlin
go back to reference Krasemann J (2012) Design of an effective algorithm for fast response to the rescheduling of railway traffic during disturbances. Transp Res Part C 20:62–78CrossRef Krasemann J (2012) Design of an effective algorithm for fast response to the rescheduling of railway traffic during disturbances. Transp Res Part C 20:62–78CrossRef
go back to reference Liebchen C (2006) Periodic timetable optimization in public transport. Ph.D. thesis, Technische Universität, Berlin, Published by dissertation.de. Liebchen C (2006) Periodic timetable optimization in public transport. Ph.D. thesis, Technische Universität, Berlin, Published by dissertation.de.
go back to reference Liebchen C, Lübbecke M, Möhring R (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. In: Ahuja RK, Möhring R, Zaroliagis C (eds) Robust and online large-scale optimization. Springer, New York Liebchen C, Lübbecke M, Möhring R (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. In: Ahuja RK, Möhring R, Zaroliagis C (eds) Robust and online large-scale optimization. Springer, New York
go back to reference Liebchen C, Proksch M, Wagner FH (2008) Performance of algorithms for periodic timetable optimization. In: Fandel G, Trockel W, Hickman M, Mirchandani P, Voß S (eds) Computer-aided systems in public transport, vol 600., Lecture notes in economics and mathematical systemsSpringer, Berlin, pp 151–180CrossRef Liebchen C, Proksch M, Wagner FH (2008) Performance of algorithms for periodic timetable optimization. In: Fandel G, Trockel W, Hickman M, Mirchandani P, Voß S (eds) Computer-aided systems in public transport, vol 600., Lecture notes in economics and mathematical systemsSpringer, Berlin, pp 151–180CrossRef
go back to reference Lindner T (2000) Train schedule optimization in public rail transport. Ph.D. thesis, Technische Universität Braunschweig Lindner T (2000) Train schedule optimization in public rail transport. Ph.D. thesis, Technische Universität Braunschweig
go back to reference Lübbe J (2009) Passagierrouting und Taktfahrplanoptimierung. Master’s thesis, Technische Universität Berlin (in German) Lübbe J (2009) Passagierrouting und Taktfahrplanoptimierung. Master’s thesis, Technische Universität Berlin (in German)
go back to reference Lusby R, Larsen J, Ehrgott M, Ryan D (2011) Railway track allocation: models and methods. OR Spectr 33:843–883CrossRef Lusby R, Larsen J, Ehrgott M, Ryan D (2011) Railway track allocation: models and methods. OR Spectr 33:843–883CrossRef
go back to reference Nachtigall K (1998) Periodic network optimization and fixed interval timetables. Deutsches Zentrum für Luft- und Raumfahrt. Institut für Flugführung, Braunschweig. Habilitationsschrift Nachtigall K (1998) Periodic network optimization and fixed interval timetables. Deutsches Zentrum für Luft- und Raumfahrt. Institut für Flugführung, Braunschweig. Habilitationsschrift
go back to reference Nachtigall K, Opitz J (2008) Solving periodic timetable optimisation problems by modulo simplex calculations. In: Fischetti M, Widmayer P (eds) Proceedings of ATMOS. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany Nachtigall K, Opitz J (2008) Solving periodic timetable optimisation problems by modulo simplex calculations. In: Fischetti M, Widmayer P (eds) Proceedings of ATMOS. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany
go back to reference Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New YorkCrossRef Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New YorkCrossRef
go back to reference Odijk MA (1996) A constraint generation algorithm for the construction of periodic railway timetables. Transp Res Part B 30(6):455–464CrossRef Odijk MA (1996) A constraint generation algorithm for the construction of periodic railway timetables. Transp Res Part B 30(6):455–464CrossRef
go back to reference Odijk MA (1998) Railway timetable generation. Ph.D. thesis, Technische Universiteit Delft Odijk MA (1998) Railway timetable generation. Ph.D. thesis, Technische Universiteit Delft
go back to reference Peeters L (2003) Cyclic railway timetable optimization. Ph.D. thesis, Erasmus University Rotterdam Peeters L (2003) Cyclic railway timetable optimization. Ph.D. thesis, Erasmus University Rotterdam
go back to reference Pfetsch M, Borndörfer R (2006) Routing in line planning for public transport. In: Haasis HD, Kopfer H, Schönberger J (eds) Operations Research Proceedings 2005, vol 2005. Springer, Berlin, pp 405–410 Pfetsch M, Borndörfer R (2006) Routing in line planning for public transport. In: Haasis HD, Kopfer H, Schönberger J (eds) Operations Research Proceedings 2005, vol 2005. Springer, Berlin, pp 405–410
go back to reference Rockafellar RT (1984) Network flows and monotropic optimization. John Wiley & Sons, Inc., New York Rockafellar RT (1984) Network flows and monotropic optimization. John Wiley & Sons, Inc., New York
go back to reference Schmidt M (2012) Integrating routing decisions in network problems. Ph.D. thesis, Institute for Numerical and Applied Mathematics, Georg-August-University Göttingen Schmidt M (2012) Integrating routing decisions in network problems. Ph.D. thesis, Institute for Numerical and Applied Mathematics, Georg-August-University Göttingen
go back to reference Schmidt M (2012) Line planning with equilibrium routing. Tech rep, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen Schmidt M (2012) Line planning with equilibrium routing. Tech rep, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen
go back to reference Schmidt M (2013) Simultaneous optimization of delay management decisions and passenger routes. Public Transp 5:125–147CrossRef Schmidt M (2013) Simultaneous optimization of delay management decisions and passenger routes. Public Transp 5:125–147CrossRef
go back to reference Schmidt M (2014) Integrating routing decisions in public transportation problems, optimization and its applications. Springer, New York Schmidt M (2014) Integrating routing decisions in public transportation problems, optimization and its applications. Springer, New York
go back to reference Schmidt M, Schöbel A (2010) The complexity of integrating routing decisions in public transportation models. In: Erlebach T, Lübbecke M (eds) Proceedings of ATMOS, OASIcs, vol 14. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp 156–169 Schmidt M, Schöbel A (2010) The complexity of integrating routing decisions in public transportation models. In: Erlebach T, Lübbecke M (eds) Proceedings of ATMOS, OASIcs, vol 14. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Dagstuhl, Germany, pp 156–169
go back to reference Schöbel A (2006) Optimization in public transportation. Stop location, delay management and tariff planning from a customer-oriented point of view. Optimization and its applications. Springer, New York Schöbel A (2006) Optimization in public transportation. Stop location, delay management and tariff planning from a customer-oriented point of view. Optimization and its applications. Springer, New York
go back to reference Schöbel A (2012) Line planning in public transportation: models and methods. OR Spectr 34(3):491–510CrossRef Schöbel A (2012) Line planning in public transportation: models and methods. OR Spectr 34(3):491–510CrossRef
go back to reference Schöbel A, Kratz A (2009) A bicriteria approach for robust timetabling. Lect Notes Comput Sci 5868:119CrossRef Schöbel A, Kratz A (2009) A bicriteria approach for robust timetabling. Lect Notes Comput Sci 5868:119CrossRef
go back to reference Schöbel A, Scholl S (2006) Line planning with minimal travel time. In: 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, no. 06901 in Dagstuhl Seminar Proceedings Schöbel A, Scholl S (2006) Line planning with minimal travel time. In: 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, no. 06901 in Dagstuhl Seminar Proceedings
go back to reference Serafini P, Ukovich W (1989) A mathematical model for periodic scheduling problems. SIAM J Discret Math 2:550–581CrossRef Serafini P, Ukovich W (1989) A mathematical model for periodic scheduling problems. SIAM J Discret Math 2:550–581CrossRef
go back to reference Siebert M, Goerigk M (2013) An experimental comparison of periodic timetabling models. Comput Oper Res 40(10):2251–2259CrossRef Siebert M, Goerigk M (2013) An experimental comparison of periodic timetabling models. Comput Oper Res 40(10):2251–2259CrossRef
Metadata
Title
Timetabling with passenger routing
Authors
Marie Schmidt
Anita Schöbel
Publication date
01-01-2015
Publisher
Springer Berlin Heidelberg
Published in
OR Spectrum / Issue 1/2015
Print ISSN: 0171-6468
Electronic ISSN: 1436-6304
DOI
https://doi.org/10.1007/s00291-014-0360-0

Other articles of this Issue 1/2015

OR Spectrum 1/2015 Go to the issue