License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2013.68
URN: urn:nbn:de:0030-drops-42451
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2013/4245/
Go to the corresponding OASIcs Volume Portal

Borndörfer, Ralf ; Hoppmann, Heide ; Karbstein, Marika

A Configuration Model for the Line Planning Problem

pdf-format:
7.pdf (0.5 MB)

Abstract

We propose a novel extended formulation for the line planning
problem in public transport. It is based on a new concept of
frequency configurations that account for all possible
options to provide a required transportation capacity on an
infrastructure edge. We show that this model yields a strong LP
relaxation. It implies, in particular, general classes of facet
defining inequalities for the standard model.

BibTeX - Entry

@InProceedings{borndrfer_et_al:OASIcs:2013:4245,
  author =	{Ralf  Bornd{\"o}rfer and Heide Hoppmann and Marika Karbstein},
  title =	{{A Configuration Model for the Line Planning Problem}},
  booktitle =	{13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems},
  pages =	{68--79},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-939897-58-3},
  ISSN =	{2190-6807},
  year =	{2013},
  volume =	{33},
  editor =	{Daniele Frigioni and Sebastian Stiller},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2013/4245},
  URN =		{urn:nbn:de:0030-drops-42451},
  doi =		{10.4230/OASIcs.ATMOS.2013.68},
  annote =	{Keywords: Combinatorial optimization, polyhedral combinatorics, line planning}
}

Keywords: Combinatorial optimization, polyhedral combinatorics, line planning
Collection: 13th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems
Issue Date: 2013
Date of publication: 05.09.2013

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI