Optimization models for railway traffic rescheduling in the last decade tend to develop along two main streams. One the one hand, train scheduling models strives to incorporate any relevant detail of the railway infrastructure having an impact on the feasibility and quality of the solutions from the viewpoint of operations managers. On the other hand, delay management models focus on the impact of rescheduling decisions on the quality of service perceived by the passengers. Models in the first stream are mainly microscopic, while models in the second stream are mainly macroscopic. This paper aims at merging these two streams of research by developing microscopic passenger-centric models, solution algorithms and lower bounds. Fast iterative algorithms are proposed, based on a decomposition of the problem and on the exact resolution of the sub-problems. A new lower bound is proposed, consisting of the resolution of a set of min-cost flow problems with activation constraints. Computational experiments, based on a real-world Dutch railway network, show that good quality solutions and lower bounds can be found within a limited computation time.

Corman, F., Pacciarelli, D., D’Ariano, A., & Samà, M. (2015). Rescheduling railway traffic taking into account minimization of passengers’ discomfort. In Lecture Notes in Computer Science (pp. 602-616) [10.1007/978-3-319-24264-4_41].

Rescheduling railway traffic taking into account minimization of passengers’ discomfort

CORMAN, FRANCESCO;PACCIARELLI, Dario;D'ARIANO, Andrea;SAMA', MARCELLA
2015

Abstract

Optimization models for railway traffic rescheduling in the last decade tend to develop along two main streams. One the one hand, train scheduling models strives to incorporate any relevant detail of the railway infrastructure having an impact on the feasibility and quality of the solutions from the viewpoint of operations managers. On the other hand, delay management models focus on the impact of rescheduling decisions on the quality of service perceived by the passengers. Models in the first stream are mainly microscopic, while models in the second stream are mainly macroscopic. This paper aims at merging these two streams of research by developing microscopic passenger-centric models, solution algorithms and lower bounds. Fast iterative algorithms are proposed, based on a decomposition of the problem and on the exact resolution of the sub-problems. A new lower bound is proposed, consisting of the resolution of a set of min-cost flow problems with activation constraints. Computational experiments, based on a real-world Dutch railway network, show that good quality solutions and lower bounds can be found within a limited computation time.
Corman, F., Pacciarelli, D., D’Ariano, A., & Samà, M. (2015). Rescheduling railway traffic taking into account minimization of passengers’ discomfort. In Lecture Notes in Computer Science (pp. 602-616) [10.1007/978-3-319-24264-4_41].
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: http://hdl.handle.net/11590/313784
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? 5
social impact