Ensuring the feasibility and robustness of train operations in stations and network nodes is receiving more and more attention given the trend towards a stronger integration of timetabling and network planning in railway systems. Existing approaches for robust station routing most commonly rely on the maximization of buffer times between consecutive trains. This view, however, neglects indirect dependencies between trains which may exacerbate delay propagation in the station, as well as dwell-time supplements. In this work we develop a new exact robust routing approach for stations that allows to minimize the expected delay caused by primary delays, generalizing delay absorption concepts used in timetable stability analysis and recoverable robustness. The methodology is based on a mixed-integer linear programming (MILP) approach for modeling delay propagation that takes both direct and indirect train dependencies into account. We test our approach on three railway stations from the Netherlands, where it is found that the optimized routings of the new method can reduce the delay propagation compared to buffer-based methodologies.
Widmann, Philipp, Weik, Norman. Extending robustness concepts and model formulations for the timetable-constrained railway station routing problem using absorption graphs. // Public Transport. – 2026. – DOI: 10.1007/s12469-026-00425-1. – URL: http://link.springer.com/openurl/fulltext?id=doi:10.1007/s12469-026-00425-1
Widmann, Philipp, Weik, & Norman (2026). Extending robustness concepts and model formulations for the timetable-constrained railway station routing problem using absorption graphs. Public Transport. https://doi.org/10.1007/s12469-026-00425-1
Widmann, et al. “Extending robustness concepts and model formulations for the timetable-constrained railway station routing problem using absorption graphs.” Public Transport, 2026. doi:10.1007/s12469-026-00425-1.
@article{Widmann2026,
title = {Extending robustness concepts and model formulations for the timetable-constrained railway station routing problem using absorption graphs},
author = {Widmann and Philipp and Weik and Norman},
journal = {Public Transport},
year = {2026},
doi = {10.1007/s12469-026-00425-1},
url = {http://link.springer.com/openurl/fulltext?id=doi:10.1007/s12469-026-00425-1}
}
In this paper, we consider cost-sharing problems defined on rooted trees. We refer to these problems as cost-tree problems and to the induced transferable utility cooperative games as irrigation games. We introduce a formal notion of...
In this paper, we focus on nonlinear programming problems with cardinality constraints that restrict the number of nonzero components of the decision vector. We start with a straightforward mixed-integer programming reformulation....
Portfolio selection is a critical issue in financial management under uncertainty. In this paper, we propose a complex approach for portfolio selection with quantile return approximation. In particular, we propose a practical workflow...
The transcendental logarithmic (translog) production function is recognised as a flexible functional form for modelling production processes. It accommodates varying elasticities of input substitution and diverse types of...
This study investigates mothership-drone route determination using two optimization approaches: a Mixed Integer Linear Programming (MILP) model based on a discrete hexagonal grid, and a Mixed Integer Nonlinear Programming (MINLP) model...