Article thumbnail

Optimal train rescheduling after conflict detection

By Sofie Van Thielen, Sofie Burggraeve and Pieter Vansteenwegen

Abstract

The increasing importance of public transport incurs a growing need for accurate trains. Though timetabling can account for possible delays, in practice, external events regularly lead to delays. Once trains are deviating from their schedule, conflicts can occur. A conflict implies that (at least) two trains require the same part of the infrastructure at the same time. Conflicts need to be resolved quickly in a way that disturbs the system as little as possible. Therefore, the impact on the whole network should be taken into account when solving conflicts. This paper discusses and evaluates three heuristics that solve conflicts, based on a detailed simulation. The first two are based on common dispatching rules, the last one is a self-designed strategy that incorporates the secondary conflicts in a way that it tries to limit the duration of all conflicts in the next hour. Given delay scenarios, the three dierent strategies are compared based on secondary delays and computation time.status: publishe

Topics: Con ict resolution, CIB_PUBLIC, Delay management, Dispatching, Real-time scheduling
Year: 2015
OAI identifier: oai:lirias.kuleuven.be:123456789/504153
Provided by: Lirias
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • https://lirias.kuleuven.be/bit... (external link)
  • https://lirias.kuleuven.be/han... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.