2026-08-19T10:20:01Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:1588 2024-03-06T10:28:33Z ddc:004 open_access

Solving Periodic Timetable Optimisation Problems by Modulo Simplex Calculations Nachtigall, Karl Opitz, Jens Periodic event scheduling problem integer programming modulo network simplex 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Karl Nachtigall and Jens Opitz 2008 Is Part Of OASIcs, Volume 9, 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'08) (2008) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2008.1588 urn:nbn:de:0030-drops-15884 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2008.1588 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode