Abstract
The line planning problem is one of the fundamental problems in strategic planning of public and rail transport. It consists in finding lines and corresponding frequencies in a public transport network such that a given travel demand can be satisfied. There are (at least) two objectives. The transport company wishes to minimize its operating cost; the passengers request short travel times. We propose two new multi-commodity flow models for line planning. Their main features, in comparison to existing models, are that the passenger paths can be freely routed and that the lines are generated dynamically.
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
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Yuster, R., and Zwick, U. (1995). Color-coding. Journal of the Association of Computing Machinery, 42(4), 844–856.
Bouma, A. and Oltrogge, C. (1994). Linienplanung und Simulation für öffentliche Verkehrswege in Praxis und Theorie. Eisenbahntechnische Rundschau, 43(6), 369–378.
Bussieck, M. R. (1997). Optimal Lines in Public Rail Transport. Ph.D. thesis, TU Braunschweig.
Bussieck, M. R., Winter, T., and Zimmermann, U. T. (1997a). Discrete optimization in public rail transport. Mathematical Programming, 79B(1–3), 415–444.
Bussieck, M. R., Kreuzer, P., and Zimmermann, U. T. (1997b). Optimal lines for railway systems. European Journal of Operational Research, 96(1), 54–63.
Bussieck, M. R., Lindner, T., and Lübbecke, M. E. (2004). A fast algorithm for near optimal line plans. Mathematical Methods in Operations Research, 59(2).
Ceder, A. and Israeli, Y. (1992). Scheduling considerations in designing transit routes at the network level. In M. Desrochers and J.-M. Rousseau, editors, Computer-Aided Transit Scheduling, volume 386 of Lecture Notes in Economics and Mathematical Systems, pages 113–136. Springer, Berlin.
Ceder, A. and Wilson, N. H. M. (1986). Bus network design. Transportation Research, 20B(4), 331–344.
Claessens, M. T., van Dijk, N. M., and Zwaneveld, P. J. (1998). Cost optimal allocation of rail passanger lines. European Journal of Operational Research, 110(3), 474–489.
Correa, J. R., Schulz, A. S., and Stier Moses, N. E. (2004). Selfish routing in capacitated networks. Mathematics of Operations Research, 29, 961–976.
Daduna, J. R., Branco, I., and Paixão, J. M. P., editors (1995). Computer-Aided Transit Scheduling, volume 430 of Lecture Notes in Economics and Mathematical Systems. Springer, Berlin.
Desrosiers, J., Dumas, Y., Solomon, M. M., and Soumis, F. (1995). Time constrained routing and scheduling. In M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser, editors, Network Routing, volume 8 of Handbooks in Operations Research and Management Science, pages 35–139. North-Holland, Amsterdam.
Dubois, D., Bel, G., and Llibre, M. (1979). A set of methods in transportation network synthesis and analysis. Journal of the Operational Research Society, 30, 797–808.
Goossens, J.-W. H. M., van Hoesel, S., and Kroon, L. G. (2002). On solving multitype line planning problems. METEOR Research Memorandum RM/02/009, University of Maastricht.
Goossens, J.-W. H. M., van Hoesel, S., and Kroon, L. G. (2004). A branch-and-cut approach for solving railway line-planning problems. Transportation Science, 38, 379–393.
Grötschel, M., Lovász, L., and Schrijver, A. (1993). Geometric Algorithms and Combinatorial Optimization, volume 2 of Algorithms and Combinatorics. Springer, Heidelberg, 2nd edition.
Israeli, Y. and Ceder, A. (1995). Transit route design using scheduling and multiobjective programming techniques. In Branco, I., and Paixão, J. M. P., editors. Computer-Aided Transit Scheduling, volume 430 of Lecture Notes in Economics and Mathematical Systems. Springer, Berlin Daduna et al. (1995)}, pages 56–75.
Kim, D. and Barnhart, C. (1997). Transportation service network design: Models and algorithms. In N. H. M. Wilson, editor, Computer-Aided Transit Scheduling, volume 471 of Lecture Notes in Economics and Mathematical Systems, pages 259–283. Springer, Berlin.
Mandl, C. E. (1980). Evaluation and optimization of urban public transportation networks. European Journal of Operational Research, 5, 396–404.
Odoni, A. R., Rousseau, J.-M., and Wilson, N. H. M. (1994). Models in urban and air transportation. In S. M. Pollock, M. H. Rothkopf, and A. Barnett, editors, Operations Research and the Public Sector, volume 6 of Handbooks in Operations Research and Management Science, pages 107–150. North Holland, Amsterdam.
Pape, U., Reinecke, Y.-S., and Reinecke, E. (1995). Line network planning. In Branco, I., and Paixão, J. M. P., editors. Computer-Aided Transit Scheduling, volume 430 of Lecture Notes in Economics and Mathematical Systems. Springer, Berlin Daduna et al. (1995)}, pages 1–7.
Petkovsek, M., Wilf, H. S., and Zeilberger, D. (1996). A = B. A. K. Peters, Wellesley, MA.
Silman, L. A., Barzily, Z., and Passy, U. (1974). Planning the route system for urban buses. Computers & Operations Research, 1, 201–211.
Sonntag, H. (1979). Ein heuristisches Verfahren zum Entwurf nachfrageorientierter Linienführung im öffentlichen Personennahverkehr. Zeitschrift für Operations Research, 23, B15–B31.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Borndörfer, R., Grötschel, M., Pfetsch, M.E. (2008). Models for Line Planning in Public Transport. In: Hickman, M., Mirchandani, P., Voß, S. (eds) Computer-aided Systems in Public Transport. Lecture Notes in Economics and Mathematical Systems, vol 600. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73312-6_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-73312-6_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73311-9
Online ISBN: 978-3-540-73312-6
eBook Packages: EngineeringEngineering (R0)