License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-21661
URL: http://drops.dagstuhl.de/opus/volltexte/2009/2166/
Go to the corresponding Portal


Borndörfer, Ralf ; Neumann, Marika ; Pfetsch, Marc E.

Line Planning and Connectivity

pdf-format:
Document 1.pdf (136 KB)


Abstract

The line planning problem in public transport deals with the construction of a system of lines that is both attractive for the passengers and of low costs for the operator. In general, the computed line system should be connected, i.e., for each two stations there have to be a path that is covered by the lines. This subproblem is a generalization of the well-known Steiner tree problem; we call it the Steiner connectivity Problem. We discuss complexity of this problem, generalize the so-called Steiner partition inequalities and give a transformation to the directed Steiner tree problem. We show that directed models provide tight formulations for the Steiner connectivity problem, similar as for the Steiner tree problem.

BibTeX - Entry

@InProceedings{borndrfer_et_al:DSP:2009:2166,
  author =	{Ralf Bornd{\"o}rfer and Marika Neumann and Marc E. Pfetsch},
  title =	{Line Planning and Connectivity},
  booktitle =	{Models and Algorithms for Optimization in Logistics},
  year =	{2009},
  editor =	{Cynthia Barnhart and Uwe Clausen and Ulrich Lauther and Rolf H. M{\"o}hring},
  number =	{09261},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2009/2166},
  annote =	{Keywords: Steiner tree, generalization, paths}
}

Keywords: Steiner tree, generalization, paths
Seminar: 09261 - Models and Algorithms for Optimization in Logistics
Issue Date: 2009
Date of publication: 02.10.2009


DROPS-Home | Fulltext Search | Imprint Published by LZI