The complexity of integrating routing decisions in public transportation models

OpenAccess Series in Informatics

Volumn 14, Issue , 2010, Pages 156-169

  Schmidt, Marie ^a   SchöBel, Anita ^a  

^a UNIVERSITY OF GÖTTINGEN   (Germany)

Author keywords

Line planning; Routing; Timetabling

Indexed keywords

INTEGRATING ROUTING; LINE PLANNING; OPTIMIZATION PROBLEMS; POLYNOMIAL ALGORITHM; PUBLIC TRANSPORTATION; PUBLIC TRANSPORTATION NETWORKS; ROUTING; TIMETABLING;

ALGORITHMS; COMPLEX NETWORKS; OPTIMIZATION; SCHEDULING; TRAFFIC CONTROL;

TRANSPORTATION ROUTES;

EID: 84883029784     PISSN: 21906807     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/OASIcs.ATMOS.2010.156     Document Type: Conference Paper

References (14)

1. J.A. Mesa G. Laporte, A. Marín and F.A. Ortega. An integrated methodology for rapid transit network design. In Algorithmic Methods for Railway Optimization, volume 4359 of Lecture Notes in Computer Science, pages 187-199. Springer, 2007.
2. M.R. Garey and D.S. Johnson. Computers and Intractability - A Guide to the Theory of NP-Completeness. Freeman, San Francisco, 1979.
3. M. Kaspi. Service oriented train timetabling. Master's thesis, Tel Aviv University, 2010.
4. M. Kinder. Models for periodic timetabling. Master's thesis, Technische Universität Berlin, 2008.
5. C. Liebchen. Periodic Timetable Optimization in Public Transport. PhD thesis, Technische Universität Berlin, 2006. published by dissertation.de.
6. J. Lübbe. Passagierrouting und taktfahrplanoptimierung. Master's thesis, Technische Universität Berlin, 2009. in german.
7. K. Nachtigall. Periodic Network Optimization and Fixed Interval Timetables. Deutsches Zentrum für Luft- und Raumfahrt, Institut für Flugführung, Braunschweig, 1998. Habilitationsschrift.
8. K. Nachtigall and K. Jerosch. Simultaneous network line planning and traffic assignment. In M. Fischetti and P. Widmayer, editors, 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, 2008.
9. C. A. Phillips. The network inhibition problem. In Annual ACM Symposium on Theory of Computing - Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 776-785, New York, 1993. ACM.
10. M. E. Pfetsch R. Borndörfer, M. Grötschel. A column generation approach to line planning in public transport. Transportation Science 41, pages 123-132, 2007.
11. R. T. Rockafellar. Network flows and monotropic optimization. John Wiley & Sons, Inc., 1984.
12. M. Schmidt and A. Schöbel. The complexity of integrating routing decisions in public transportation models. Technical report, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen, 2010. NAM Report.
13. A. Schöbel and S. Scholl. Line planning with minimal transfers. In 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, number 06901 in Dagstuhl Seminar Proceedings, 2006.
14. Z. Wang and J. Crowcroft. Quality of service routing for supporting multimedia applications. IEEE Journal on Selected areas in communications, 14(7):1228-1234, 1996.