A parallel heuristic for fast train dispatching during railway traffic disturbances: Early results

ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems

Volumn , Issue , 2012, Pages 405-414

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

^a BLEKINGE INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

Disturbance management; Multiprocessor; Optimization; Parallel computing; Railway traffic; Re scheduling

Indexed keywords

BRANCH AND BOUNDS; DEPTH FIRST; GREEDY ALGORITHMS; MULTIPROCESSOR; NUMERICAL EXPERIMENTS; OPERATIONAL CONSTRAINTS; PARALLEL IMPLEMENTATIONS; RAILWAY NETWORK; RAILWAY TRAFFIC; RE-SCHEDULING; SEARCH SPACES; SEARCH STRATEGIES; SEQUENTIAL ALGORITHM; SEQUENTIAL IMPLEMENTATION; TRAFFIC MANAGERS; TRAIN DISPATCHING;

ALGORITHMS; OPTIMIZATION; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS; RAILROADS;

SCHEDULING;

EID: 84861971776     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. Clausen, J. and Perregaard, M. (1999). On the best search strategy in parallel branch-and-bound: Best-First 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: Branch-and-bound algorithms with enhanced lower bounds. Transportation Research Part B: Methodological, 41(3):320 - 341.