The treatment of transfers is a major challenge in line planning. Existing models either route passengers and lines sequentially, and hence disregard essential degrees of freedom, or they are of extremely large scale, and seem to be computationally intractable. We propose a novel direct connection approach that allows an integrated optimization of line and passenger routing, including accurate estimates of the number of direct travelers, for large-scale real-world instances.
@InProceedings{borndorfer_et_al:OASIcs.ATMOS.2012.47, author = {Bornd\"{o}rfer, Ralf and Karbstein, Marika}, title = {{A Direct Connection Approach to Integrated Line Planning and Passenger Routing}}, booktitle = {12th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems}, pages = {47--57}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-45-3}, ISSN = {2190-6807}, year = {2012}, volume = {25}, editor = {Delling, Daniel and Liberti, Leo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2012.47}, URN = {urn:nbn:de:0030-drops-37027}, doi = {10.4230/OASIcs.ATMOS.2012.47}, annote = {Keywords: combinatorial optimization, line planning, transfers, passenger routing} }
Feedback for Dagstuhl Publishing