A PARALLEL HEURISTIC FOR FAST TRAIN DISPATCHING DURING RAILWAY TRAFFIC DISTURBANCES: EARLY RESULTS

Syed Muhammad Zeeshan Iqbal, Håkan Grahn, Johanna Törnquist Krasemann

2012

Abstract

Railways are an important part of the infrastructure in most countries. As the railway networks become more and more saturated, even small traffic disturbances can propagate and have severe consequences. Therefore, efficient re-scheduling support for the traffic managers is needed. In this paper, the train real-time re-scheduling problem is studied in order to minimize the total delay, subject to a set of safety and operational constraints. We propose a parallel greedy algorithm based on a depth-first branch-and-bound search strategy. A number of comprehensive numerical experiments are conducted to compare the parallel implementation to the sequential implementation of the same algorithm in terms of the quality of the solution and the number of nodes evaluated. The comparison is based on 20 disturbance scenarios from three different types of disturbances. Our results show that the parallel algorithm; (i) efficiently covers a larger portion of the search space by exchanging information about improvements, and (ii) finds better solutions for more complicated disturbances such as infrastructure problems. Our results show that the parallel implementation significantly improves the solution for 5 out of 20 disturbance scenarios, as compared to the sequential algorithm.

References

  1. Clausen, J. and Perregaard, M. (1999). On the best search strategy in parallel branch-and-bound: BestFirst search versus lazy Depth-First search. Annals of Operations Research, 90:1-17.
  2. Conte, C. (2008). Identifying dependencies among delays. PhD thesis, Niedersächsische Staats-und Universitätsbibliothek Göttingen, Germany.
  3. Corman, F. (2010). Real-time Railway Traffic Management: Dispatching in complex, large and busy railway networks. Ph.D. thesis, Technische Universiteit Delft, The Netherlands. 90-5584-133-1.
  4. Grahn, H. and T örnquist Krasemann, J. (2011). A parallel re-scheduling algorithm for railway traffic disturbance management - initial results. In Proc. of the 2nd Int'l Conference on Models and Technologies for Intelligent Transportation Systems, pages XX-YY.
  5. Grama, A. and Kumar, V. (2002). State of the art in parallel search techniques for discrete optimization problems. IEEE Trans. on Knowledge and Data Engineering, 11(1):28-35.
  6. Lee, Y. and Chen, C.-Y. (2009). A heuristic for the train pathing and timetabling problem. Transportation Research Part B: Methodological, 43(8-9):837 - 851.
  7. Liu, S. Q. and Kozan, E. (2009). Scheduling trains as a blocking parallel-machine job shop scheduling problem. Computers & Operations Research, 36(10):2840 - 2852.
  8. Perron, L. (2004). Search procedures and parallelism in constraint programming. In Principles and Practice of Constraint Programming (CP'99), pages 346-361.
  9. Schachtebeck, M. (2009). Delay Management in Public Transportation: Capacities, Robustness, and Integration. PhD thesis, Niedersächsische Staats-und Universitätsbibliothek Göttingen, Germany.
  10. Shinano, Y., Harada, K., and Hirabayashi, R. (1997). Control schemes in a generalized utility for parallel branch-and-bound algorithms. In Proc. of the 11th Int'l Parallel Processing Symp., page 621.
  11. T örnquist, J. (2005). Computer-based decision support for railway traffic scheduling and dispatching: A review of models and algorithms. In 5th Workshop on Algorithmic Methods and Models for Optimization of Railways.
  12. T örnquist, J. and Persson, J. A. (2007). N-tracked railway traffic re-scheduling during disturbances. Transportation Research Part B: Methodological, 41(3):342- 362.
  13. T örnquist Krasemann, J. (2010). Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbances. Transportation Research Part C: Emerging Technologies, In Press, Corrected Proof.
  14. Zhou, X. and Zhong, M. (2007). Single-track train timetabling with guaranteed optimality: Branchand-bound algorithms with enhanced lower bounds. Transportation Research Part B: Methodological, 41(3):320 - 341.
Download


Paper Citation


in Harvard Style

Muhammad Zeeshan Iqbal S., Grahn H. and Törnquist Krasemann J. (2012). A PARALLEL HEURISTIC FOR FAST TRAIN DISPATCHING DURING RAILWAY TRAFFIC DISTURBANCES: EARLY RESULTS . In Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-8425-97-3, pages 405-414. DOI: 10.5220/0003756904050414


in Bibtex Style

@conference{icores12,
author={Syed Muhammad Zeeshan Iqbal and Håkan Grahn and Johanna Törnquist Krasemann},
title={A PARALLEL HEURISTIC FOR FAST TRAIN DISPATCHING DURING RAILWAY TRAFFIC DISTURBANCES: EARLY RESULTS},
booktitle={Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2012},
pages={405-414},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003756904050414},
isbn={978-989-8425-97-3},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A PARALLEL HEURISTIC FOR FAST TRAIN DISPATCHING DURING RAILWAY TRAFFIC DISTURBANCES: EARLY RESULTS
SN - 978-989-8425-97-3
AU - Muhammad Zeeshan Iqbal S.
AU - Grahn H.
AU - Törnquist Krasemann J.
PY - 2012
SP - 405
EP - 414
DO - 10.5220/0003756904050414