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.2016.1
URN: urn:nbn:de:0030-drops-65251
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6525/
Go to the corresponding OASIcs Volume Portal

Pätzold, Julius ; Schöbel, Anita

A Matching Approach for Periodic Timetabling

pdf-format:
OASIcs-ATMOS-2016-1.pdf (0.5 MB)

Abstract

The periodic event scheduling problem (PESP) is a well studied problem known as intrinsically hard, but with important applications mainly for finding good timetables in public transportation. In this paper we consider PESP in public transportation, but in a reduced version (r-PESP) in which the driving and waiting times of the vehicles are fixed to their lower bounds. This results in a still NP-hard problem which has less variables, since only one variable determines the schedule for a whole line. We propose a formulation for r-PESP which is based on scheduling the lines. This enables us on the one hand to identify a finite candidate set and an exact solution approach. On the other hand, we use this formulation to derive a matching-based heuristic for solving PESP. Our experiments on close to real-world instances from LinTim show that our heuristic is able to compute competitive timetables in a very short runtime.

BibTeX - Entry

@InProceedings{ptzold_et_al:OASIcs:2016:6525,
  author =	{Julius P{\"a}tzold and Anita Sch{\"o}bel},
  title =	{{A Matching Approach for Periodic Timetabling}},
  booktitle =	{16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016)},
  pages =	{1:1--1:15},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-021-7},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{54},
  editor =	{Marc Goerigk and Renato Werneck},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6525},
  URN =		{urn:nbn:de:0030-drops-65251},
  doi =		{10.4230/OASIcs.ATMOS.2016.1},
  annote =	{Keywords: PESP, Timetabling,  Public Transport, Matching, Finite Dominating Set}
}

Keywords: PESP, Timetabling, Public Transport, Matching, Finite Dominating Set
Collection: 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016)
Issue Date: 2016
Date of publication: 24.08.2016

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