Delay Management is proven to reduce the average passenger delay. However, the current method of Delay Management either uses fast basic or slow accurate passenger rerouting. The former has a downfall in that it is inaccurate since it assumes that passengers delay is the periodicity of the train of the original transfer, while in reality, faster alternatives are often available. The latter reroutes passengers simultaneously with the delay management resulting in computation times larger than the time window of a Train Dispatcher to make a decision. This thesis proposes an alternative method of Delay Management which calculates the alternative routes before the Delay Management optimization using a modified Dijkstra algorithm. This method outperforms the fast basic approach to reducing passenger delay with a similar computation time, thereby outperforming the slow accurate approach.