A tabu search algorithm for rerouting trains during rail operations

Transportation Research Part B: Methodological

Volumn 44, Issue 1, 2010, Pages 175-192

  Corman, Francesco ^a   D'Ariano, Andrea ^a,b   Pacciarelli, Dario ^b   Pranzo, Marco ^c  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b ROMA TRE UNIVERSITY   (Italy)

^c UNIVERSITY OF SIENA   (Italy)

Author keywords

Alternative graph; Real time railway traffic management; Routing; Scheduling; Tabu search

Indexed keywords

BRANCH AND BOUND METHOD; LEARNING ALGORITHMS; RAILROAD TRANSPORTATION; RAILROADS; RAILS; SCHEDULING; TABU SEARCH; TRANSPORTATION;

ALTERNATIVE GRAPHS; BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL EXPERIMENT; CONFLICT DETECTION AND RESOLUTION; NEIGHBORHOOD STRUCTURE; RAILWAY TRAFFIC MANAGEMENT; ROUTING; TABU SEARCH ALGORITHMS;

OPTIMIZATION;

ALGORITHM; RAILWAY; REAL TIME; TRAFFIC MANAGEMENT; TRAIN;

EID: 71549158818     PISSN: 01912615     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.trb.2009.05.004     Document Type: Article

References (28)

1. Ahuja, R., Cunha, C., Sahin, G., 2005. Network models in railroad planning and scheduling. In: Greenberg, H., Smith, J. (Eds.), TutORials in Operations Research, vol. 1. pp. 54-101.
2. Balas E. Machine sequencing via disjunctive graphs: an implicit enumeration approach. Operations Research 17 6 (1969) 941-957
3. Balas E. Disjunctive programming. Annals of Discrete Mathematics 5 1 (1979) 3-51
4. Burkolter, D.M., 2005. Capacity of railways in station areas using Petri nets. Dissertation number 16254, Swiss Federal Institute of Technology, Zurich, Switzerland.
5. Caimi, G., Burkolter, D. Herrmann, T., 2005. Finding delay-tolerant train routings through stations. In: Fleuren, H. (Ed.), Selected Papers of the Annual International Conference of the German Operations Research Society Jointly Organized with the Netherlands Society. pp. 136-143.
6. Caprara, A., Kroon, L., Monaci, M., Peeters, M., Toth, P., 2006. Passenger railway optimization. In: Barnhart, C., Laporte, G. (Eds.), Handbooks in Operations Research and Management Science, vol. 14. pp. 129-187.
7. Carey M., and Crawford I. Scheduling trains on a network of busy complex stations. Transportation Research Part B 41 2 (2007) 159-178
8. D'Ariano, A., 2008. Improving real-time train dispatching: models, algorithms and applications. TRAIL Thesis Series, T2008/6, The Netherlands.
9. D'Ariano A., Pacciarelli D., and Pranzo M. A branch and bound algorithm for scheduling trains in a railway network. European Journal of Operational Research 183 2 (2007) 643-657
10. D'Ariano A., Corman F., Pacciarelli D., and Pranzo M. Reordering and local rerouting strategies to manage train traffic in real-time. Transportation Science 42 4 (2008) 405-419
11. Flamini M., and Pacciarelli D. Real time management of a metro rail terminus. European Journal of Operational Research 189 3 (2008) 746-761
12. Frank O. Two-way traffic on a single line of railway. Operations Research 14 5 (1966) 801-811
13. Glover F. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research 13 5 (1986) 533-549
14. Goverde, R.M.P., 2005. Punctuality of railway operation and timetable stability analysis. TRAIL Thesis Series T2005/10, The Netherlands.
15. Hall N.J., and Sriskandarajah C. A survey on machine scheduling problems with blocking and no-wait in process. Operations Research 44 3 (1996) 510-525
16. Hansen I.A. State-of-the-art of railway operations research. In: Allan J., Brebbia C., Rumsey A., Sciutto G., Sone S., and Goodman C. (Eds). Computers in Railways X (2006), WIT Press, Southampton, UK 565-577
17. Lüthi, M., Medeossi, G., Nash, A., 2007. Evaluation of an integrated real-time rescheduling and train control system for heavily used areas. In: Hansen, I.A., Radtke, A., Pachl, J., Wendler, E. (Eds.), Proceedings of the 2nd International Seminar on Railway Operations Modelling and Analysis, Hannover, Germany.
18. Mascis A., and Pacciarelli D. Job shop scheduling with blocking and no-wait constraints. European Journal of Operational Research 143 3 (2002) 498-517
19. Mascis A., Pacciarelli D., and Pranzo M. Scheduling models for short-term railway traffic optimization. In: Hickman M., Mirchandani P., and Voß S. (Eds). Lecture Notes in Economics and Mathematical Systems 600 (1): Computer-Aided Systems in Public Transport (2008), Springer 71-90
20. Mastrolilli M., and Gambardella L.M. Effective neighborhood functions for the flexible job shop problem. Journal of Scheduling 3 1 (2000) 3-20
21. Mazzarello M., and Ottaviani E. A traffic management system for real-time traffic optimisation in railways. Transportation Research Part B 41 2 (2007) 246-274
22. Montigel, M., Kleiner, C., Achermann, E., 2007. Rescheduling in the ETCS Level 2 environment. In: Hansen, I.A., Radtke, A., Pachl, J., Wendler, E. (Eds.), Proceedings of the 2nd International Seminar on Railway Operations Modelling and Analysis, Hannover, Germany.
23. Moreno Pérez J.A., Moreno-Vega J.M., and Rodríguez Martín I. Variable neighborhood tabu search and its application to the median cycle problem. European Journal of Operational Research 151 2 (2003) 365-378
24. Rodriguez J. A constraint programming model for real-time train scheduling at junctions. Transportation Research Part B 41 2 (2007) 231-245
25. Semet Y., and Schoenauer M. An efficient memetic, permutation-based evolutionary algorithm for real-world train timetabling. In Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation (2005) 1761-11768
26. Strotmann, C., 2007. Railway scheduling problems and their decomposition. Ph.D. Thesis, Universität Osnabrück, Germany.
27. Törnquist J., and Persson J.A. N-tracked railway traffic re-scheduling during disturbances. Transportation Research Part B 41 3 (2007) 342-362
28. Zwaneveld P.J., Kroon L.G., and van Hoesel S.P.M. Routing trains through a railway station based on a node packing model. European Journal of Operational Research 128 1 (2001) 14-33