Non-Pool-Based Line Planning on Graphs of Bounded Treewidth

Irene Heinrich, Philine Schiewe, Constantin Seebach

Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

1 Citation (Scopus)
39 Downloads (Pure)

Abstract

Line planning, i.e. choosing routes which are to be serviced by vehicles in order to satisfy network demands, is an important aspect of public transport planning. While there exist heuristic procedures for generating lines from scratch, most theoretical investigations consider the problem of choosing lines only from a predefined line pool. We consider the line planning problem when all simple paths can be used as lines and present an algorithm which is fixed-parameter tractable, i.e. it is efficient on instances with small parameter. As a parameter we consider the treewidth of the public transport network, along with its maximum degree as well as the maximum allowed frequency.
Original languageEnglish
Title of host publication23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2023
EditorsDaniele Frigioni, Philine Schiewe
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Chapter4
Pages1-19
Number of pages19
ISBN (Electronic)978-3-95977-302-7
DOIs
Publication statusPublished - Sept 2023
MoE publication typeA4 Conference publication
EventSymposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems - Amsterdam, Netherlands
Duration: 7 Sept 20238 Sept 2023
Conference number: 23

Publication series

NameOpen Access Series in Informatics (OASIcs)
PublisherSchloss Dagstuhl - Leibniz-Zentrum für Informatik
Volume115
ISSN (Electronic)2190-6807

Conference

ConferenceSymposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Abbreviated titleATMOS
Country/TerritoryNetherlands
CityAmsterdam
Period07/09/202308/09/2023

Fingerprint

Dive into the research topics of 'Non-Pool-Based Line Planning on Graphs of Bounded Treewidth'. Together they form a unique fingerprint.

Cite this