Traffic controllers regulate railway traffic sequencing train movements and setting routes with the aim of ensuring smooth train behaviour and limiting as much as possible train delays. In this paper we describe the implementation of a real-time traffic management system, called ROMA (Railway traffic Optimization by Means of Alternative graphs), to support controllers in the everyday task of managing disturbances. We make use of a branch and bound algorithm for sequencing train movements, while a local search algorithm is developed for rerouting optimization purposes. The compound problem of routing and sequencing trains is approached iteratively computing an optimal train sequencing for given train routes, and then improving this solution by locally rerouting some trains. An extensive computational study is carried out, based on a dispatching area of the Dutch railway network. We study practical size instances, and include in the model important operational constraints, including rolling stock and passenger connections. Different types of disturbances are analysed, including train delays and blocked tracks. Comparison with common dispatching practice shows the high potential of the system as an effective support tool to improve punctuality. -

D'Ariano, A., Francesco, C., Pacciarelli, D., Marco, P. (2006). Real-time conflict detection and resolution: global sequencing and local rerouting. In Proceedings of the 9th International TRAIL Congress 2006 - Selected papers (pp.73-91). Delft : TRAIL research school.

Real-time conflict detection and resolution: global sequencing and local rerouting

D'ARIANO, Andrea;PACCIARELLI, Dario;
2006-01-01

Abstract

Traffic controllers regulate railway traffic sequencing train movements and setting routes with the aim of ensuring smooth train behaviour and limiting as much as possible train delays. In this paper we describe the implementation of a real-time traffic management system, called ROMA (Railway traffic Optimization by Means of Alternative graphs), to support controllers in the everyday task of managing disturbances. We make use of a branch and bound algorithm for sequencing train movements, while a local search algorithm is developed for rerouting optimization purposes. The compound problem of routing and sequencing trains is approached iteratively computing an optimal train sequencing for given train routes, and then improving this solution by locally rerouting some trains. An extensive computational study is carried out, based on a dispatching area of the Dutch railway network. We study practical size instances, and include in the model important operational constraints, including rolling stock and passenger connections. Different types of disturbances are analysed, including train delays and blocked tracks. Comparison with common dispatching practice shows the high potential of the system as an effective support tool to improve punctuality. -
2006
90-5584-081-5
D'Ariano, A., Francesco, C., Pacciarelli, D., Marco, P. (2006). Real-time conflict detection and resolution: global sequencing and local rerouting. In Proceedings of the 9th International TRAIL Congress 2006 - Selected papers (pp.73-91). Delft : TRAIL research school.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11590/177841
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact