Fast heuristics for delay management with passenger rerouting
Delay management models determine which connections should be maintained in case of a delayed feeder train. Recently, delay management models are developed that take into account that passengers will adjust their routes when they miss a connection. However, for large-scale real-world instances, these extended models become too large to be solved with standard integer programming techniques. We therefore develop several heuristics to tackle these larger instances. The dispatching rules that are used in practice are our first heuristic. Our second heuristic applies the classical delay management model without passenger rerouting. Finally, the third heuristic updates the parameters of the classical model iteratively. We compare the quality of these heuristic solution methods on real-life instances from Netherlands Railways. In this experimental study, we show that our iterative heuristic can solve large-scale real-world instances within a short computation time. Furthermore, the solutions obtained by this iterative heuristic are of good quality.
|Keywords||Delay management, Passenger rerouting, Public transportation, Railway operations|
|Persistent URL||dx.doi.org/10.1007/s12469-013-0076-6, hdl.handle.net/1765/74369|
Dollevoet, T.A.B, & Huisman, D. (2014). Fast heuristics for delay management with passenger rerouting. Public Transport, 6(1-2), 67–84. doi:10.1007/s12469-013-0076-6