Document Open Access Logo

Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations

Authors Karl Nachtigall, Jens Opitz



PDF
Thumbnail PDF

File

OASIcs.ATMOS.2008.1588.pdf
  • Filesize: 294 kB
  • 15 pages

Document Identifiers

Author Details

Karl Nachtigall
Jens Opitz

Cite AsGet BibTex

Karl Nachtigall and Jens Opitz. Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations. In 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08). Open Access Series in Informatics (OASIcs), Volume 9, pp. 1-15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/OASIcs.ATMOS.2008.1588

Abstract

In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted sum of undesirable slack times. This problem can be formulated as a mixed integer linear problem, which for real world instances is hard to solve. This is mainly caused by the integer variables, the so-called modulo parameter. At first we will discuss some results on the polyhedral structure of the periodic timetable problem. These ideas allow to define a modulo simplex basic solution by calculating the basic variables from modulo equations. This leads to a modulo network simplex method, which iteratively improves the solution by changing the simplex basis.
Keywords
  • Periodic event scheduling problem
  • integer programming
  • modulo network simplex

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail