Simultaneous Network Line Planning and Traffic Assignment

Authors Karl Nachtigall, Karl Jerosch

Thumbnail PDF


  • Filesize: 276 kB
  • 16 pages

Document Identifiers

Author Details

Karl Nachtigall
Karl Jerosch

Cite AsGet BibTex

Karl Nachtigall and Karl Jerosch. Simultaneous Network Line Planning and Traffic Assignment. In 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08). Open Access Series in Informatics (OASIcs), Volume 9, pp. 1-16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)


One of the basic problems in strategic planning of public and rail transport is the line planning problem to find a system of lines and its associated frequencies. The objectives of this planning process are usually manifold and often contradicting. The transport operator wants to minimize cost, whereas passengers want to have travel time shortest routes without any or only few changings between different lines. The travel quality of a passenger route depends on the travel time and on the number of necessary changings between lines and is usually measured by a disutility or impedance function. In practice the disutility strongly depends on the line plan, which is not known, but should be calculated. The presented model combines line planning models and traffic assignment model to overcome this dilemma. Results with data of Berlin's city public transportion network are reported.
  • Line planning problem
  • integer programming


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail