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.2017.12
URN: urn:nbn:de:0030-drops-78924
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2017/7892/
Go to the corresponding OASIcs Volume Portal

Goerigk, Marc ; Liebchen, Christian

An Improved Algorithm for the Periodic Timetabling Problem

pdf-format:
OASIcs-ATMOS-2017-12.pdf (0.9 MB)

Abstract

We consider the computation of periodic timetables, which is a key task in the service design process of public transportation companies. We propose a new approach for solving the periodic timetable optimisation problem. It consists of a (partially) heuristic network aggregation to reduce the problem size and make it accessible to standard mixed-integer programming (MIP) solvers. We alternate the invocation of a MIP solver with the well-known problem specific modulo network simplex heuristic (ModSim). This iterative approach helps the ModSim-method to overcome local minima efficiently, and provides the MIP solver with better initial solutions.

Our computational experiments are based on the 16 railway instances of the PESPlib, which is the only currently available collection of periodic event scheduling problem instances. For each of these instances, we are able to reduce the objective values of previously best known solutions by at least 10.0%, and up to 22.8% with our iterative combined method.

BibTeX - Entry

@InProceedings{goerigk_et_al:OASIcs:2017:7892,
  author =	{Marc Goerigk and Christian Liebchen},
  title =	{{An Improved Algorithm for the Periodic Timetabling Problem}},
  booktitle =	{17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017)},
  pages =	{12:1--12:14},
  series =	{OpenAccess Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-042-2},
  ISSN =	{2190-6807},
  year =	{2017},
  volume =	{59},
  editor =	{Gianlorenzo D'Angelo and Twan Dollevoet},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2017/7892},
  URN =		{urn:nbn:de:0030-drops-78924},
  doi =		{10.4230/OASIcs.ATMOS.2017.12},
  annote =	{Keywords: periodic timetabling, railway optimisation, modulo network simplex, periodic event scheduling problem}
}

Keywords: periodic timetabling, railway optimisation, modulo network simplex, periodic event scheduling problem
Collection: 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017)
Issue Date: 2017
Date of publication: 04.09.2017

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