Railway traffic management is responsible for the detection and resolution of conflicts in case of disturbed operations. To minimise delay propagation, rescheduling decisions are taken by human dispatchers, possibly supported by mathematical models. Existing conflict detection and resolution (CDR) models mostly refer to conventional fixed-block multi-aspect signalling systems, in which minimum train headways are determined based on a preset number of blocks considering worst-case braking distances and number of signal aspects. In moving-block signalling systems, minimum headways are based on absolute braking distances. This paper reviews literature on CDR with the aim to identify gaps and to propose next steps in the research on CDR under moving-block signalling. A research agenda presents various modelling options, for which modelling approaches are proposed based on a comparative analysis.@en

Conflict detection and resolution models are being developed to support railway traffic management in taking optimised rescheduling decisions in case of disturbances. Existing models mostly concern fixed-block signalling systems, in which minimum train separation distances are determined based on a preset number of blocks representing worst-case braking distances. In a moving-block signalling system, minimum train separation is based on absolute braking distances and hence depends on train speed differently from how fixed-block conflict detection and resolution models. In this paper, we propose a conflict detection and resolution model that approximates moving-block operations. The model enhances the state-of-the-art fixed-block rescheduling model RECIFE-MILP. The enhancements include a reconsideration of the discretisation of the infrastructure, the introduction of a speed profile alternative and a redefinition of the blocking times. We verify the model by comparing the solutions of the moving-block version with the fixed-block version for a specific scenario. The results indicate that the moving-block model can propose different rescheduling decisions than the fixed-block model with a better delay recovery.@en

Conflict detection and resolution models are being developed to support railway traffic management in taking optimised rescheduling decisions in case of disturbances. Existing models mostly concern fixed-block signalling systems, in which minimum train separation distances are determined based on a preset number of blocks representing worst-case braking distances. In a moving-block signalling system, minimum train separation is based on absolute braking distances and hence depends on train speed differently from how fixed-block conflict detection and resolution models. In this paper, we propose a conflict detection and resolution model that approximates moving-block operations. The model enhances the state-of-the-art fixed-block rescheduling model RECIFE-MILP. The enhancements include a reconsideration of the discretisation of the infrastructure, the introduction of a speed profile alternative and a redefinition of the blocking times. We verify the model by comparing the solutions of the moving-block version with the fixed-block version for a specific scenario. The results indicate that the moving-block model can propose different rescheduling decisions than the fixed-block model with a better delay recovery.@en