EURO 2024 Copenhagen
Abstract Submission

EURO-Online login

3811. Heuristics for recovery robust periodic timetabling

Invited abstract in session WA-51: Timetabling 2, stream Public Transport Optimization.

Wednesday, 8:30-10:00
Room: M5 (building: 101)

Authors (first author is the speaker)

1. Vera Grafe
Department of Mathematics, RPTU Kaiserslautern-Landau
2. Anita Schöbel
Department of Mathematics, University of Kaiserslautern-Landau

Abstract

An important aspect of optimising public transport is finding a good timetable. On the one hand, short travel times are important from the passengers' point of view. On the other hand, tight timetables without buffer times are prone to delays, which are inevitable in practice and highly dissatisfactory for the passengers. Hence, a good timetable should also have some degree of delay resistance. Often a periodic timetable is desirable, i.e. a timetable which repeats in a regular pattern (e.g. every hour). However, delays do in general not occur periodically, so many robust timetable models only consider aperiodic timetables.
In our work we apply the concept of recoverable robustness to periodic timetabling with aperiodic delays, resulting in the integration of two well-known problems: the periodic event scheduling problem (PESP) and delay management (DM). We show how we can bridge the gap between the periodic PESP and the aperidoic DM, yielding MIP formulations. However, solving the problem to optimality is unrealistic for large instance due to its high complexity. Therefore, we pursue heuristic approaches. We present iterative heuristics computing periodic timetables with increased robustness at the cost of only a small increase in the nominal travel time.

Keywords

Status: accepted

Back to the list of papers