License
When quoting this document, please refer to the following
DOI: 10.4230/OASIcs.ATMOS.2016.3
URN: urn:nbn:de:0030-drops-65279
URL: http://drops.dagstuhl.de/opus/volltexte/2016/6527/
Go to the corresponding OASIcs Volume Portal


Gattermann, Philine ; Gro▀mann, Peter ; Nachtigall, Karl ; Sch÷bel, Anita

Integrating Passengers' Routes in Periodic Timetabling: A SAT approach

pdf-format:
OASIcs-ATMOS-2016-3.pdf (0.6 MB)


Abstract

The periodic event scheduling problem (PESP) is a well studied problem known as intrinsically hard. Its main application is for designing periodic timetables in public transportation. To this end, the passengers' paths are required as input data. This is a drawback since the final paths which are used by the passengers depend on the timetable to be designed. Including the passengers' routing in the PESP hence improves the quality of the resulting timetables. However, this makes PESP even harder. Formulating the PESP as satisfiability problem and using SAT solvers for its solution has been shown to be a highly promising approach. The goal of this paper is to exploit if SAT solvers can also be used for the problem of integrated timetabling and passenger routing. In our model of the integrated problem we distribute origin-destination (OD) pairs temporally through the network by using time-slices in order to make the resulting model more realistic. We present a formulation of this integrated problem as integer program which we are able to transform to a satisfiability problem. We tested the latter formulation within numerical experiments, which are performed on Germany's long-distance passenger railway network. The computation's analysis in which we compare the integrated approach with the traditional one with fixed passengers' weights, show promising results for future scientific investigations.

BibTeX - Entry

@InProceedings{gattermann_et_al:OASIcs:2016:6527,
  author =	{Philine Gattermann and Peter Gro{\ss}mann and Karl Nachtigall and Anita Sch{\"o}bel},
  title =	{{Integrating Passengers' Routes in Periodic Timetabling: A SAT approach}},
  booktitle =	{16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016)},
  pages =	{3:1--3: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/6527},
  URN =		{urn:nbn:de:0030-drops-65279},
  doi =		{10.4230/OASIcs.ATMOS.2016.3},
  annote =	{Keywords: PESP, Timetabling,  Public Transport, Passengers' Routes, SAT}
}

Keywords: PESP, Timetabling, Public Transport, Passengers' Routes, SAT
Seminar: 16th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2016)
Issue Date: 2016
Date of publication: 23.08.2016


DROPS-Home | Fulltext Search | Imprint Published by LZI