Reordering and local rerouting strategies to manage train traffic in real time

Transportation Science

Volumn 42, Issue 4, 2008, Pages 405-419

  D'Ariano, Andrea ^a   Corman, Francesco ^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; Job shop scheduling; Local search; Real time railway traffic management; Train scheduling and routing

Indexed keywords

BRANCH AND BOUND METHOD; ITERATIVE METHODS; JOB SHOP SCHEDULING; LOCAL SEARCH (OPTIMIZATION); RAILROAD TRANSPORTATION; RAILROADS; SCHEDULING; TRANSPORTATION;

ALTERNATIVE GRAPHS; BRANCH-AND-BOUND ALGORITHMS; COMPUTATIONAL STUDIES; LOCAL SEARCH; LOCAL SEARCH ALGORITHM; OPERATIONAL CONSTRAINTS; RAILWAY TRAFFIC MANAGEMENT; TRAIN SCHEDULING;

OPTIMIZATION;

EID: 70449635732     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1080.0247     Document Type: Article

References (32)

1. Adenso-Díaz, B., M. O. González, P. González-Torre. 1999. On-line timetable re-scheduling in regional train services. Transportation Res. Part B 33 387-398.
2. Balas, E. 1969. Machine sequencing via disjunctive graphs: An implicit enumeration approach. Oper. Res. 17 941-957.
3. Berends, N., N. Ouburg. 2005. Beschrijving ARI-functionaliteit. Technical report, ProRail Internal Specification. (In Dutch).
4. Bertsimas, D., S. S. Patterson. 2000. The traffic flow management rerouting problem in air traffic control: A dynamic network flow approach. Transportation Sci. 34 (3)239-255.
5. Bianco, L., P. Dell'Olmo, S. Giordani. 2006. Scheduling models for air traffic control in terminal areas. J. Scheduling 9 223-253.
6. Caimi, G., D. Burkolter, T. Herrmann. 2005. Finding delay-tolerant train routings through stations. H. Fleuren, ed. Oper. Res. Proc. 2004: Selected Papers of the Annual Internat. Conf. German Oper. Res. Soc. (GOR), Springer Verlag, Tilburg, The Netherlands, 136-143.
7. Carey, M., S. Carville. 2003. Scheduling and platforming trains at busy complex stations. Transportation Res. Part A 37 (3)195-224.
8. Cordeau, J. F., P. Toth, D. Vigo. 1998. A survey of optimization models for train routing and scheduling. Transportation Sci. 32 (4)380-420.
9. D'Ariano, A., D. Pacciarelli, M. Pranzo. 2007. A branch and bound algorithm for scheduling trains in a railway network. Eur. J. Oper. Res. 183 643-657.
10. Delorme, X. 2003. Modélisation et résolution de problèmes liés à l'exploitation d'infrastructures ferroviaires. Ph. D. thesis, Universite de Valenciennes, Valenciennes, France.
11. Delorme, X., J. Rodriguez, X. Gandibleux. 2001. Heuristics for railway infrastructure saturation. Electronic Notes Theoret. Comput. Sci. 50 (1)39-53.
12. Dessouky M. M., Q. Lu, J. Zhao, R. C. Leachman. 2006. An exact solution procedure to determine the optimal dispatching times for complex rail networks. IIE Trans. 38 (2)141-152.
13. Dorfman, M. J., J. Medanic. 2004. Scheduling trains on a railway network using a discrete event model of railway traffic. Transportation Res. Part B 38 81-98.
14. Fioole, P., L. G. Kroon, G. Maroti, A. Schrijver. 2006. A rolling stock circulation model for combining and splitting of passenger trains. Eur. J. Oper. Res. 174 (2)1281-1297.
15. Gandibleux, X., J. Jorge, S. Angibaud, X. Delorme, J. Rodriguez. 2005. An ant colony optimization inspired algorithm for the set packing problem with application to railway infrastructure. Proc. SixthMetaheuristics Internat. Conf. (MIC2005), Vienna, 390-396.
16. Higgins, A., E. Kozan. 1997. Heuristic techniques for single line train scheduling. J. Heuristics 3 43-62.
17. Higgins, A., E. Kozan, L. Ferreira. 1996. Optimal scheduling of trains on a single line track. Transportation Res. Part B 30 147-161. (Pubitemid 27035196)
18. Hooghiemstra, J. S., L. G. Kroon, M. A. Odijk, M. Salomon, P. J. Zwaneveld. 1999. Decision support systems support the search for win-win solutions in railway network design. Interfaces 29 (2)15-32.
19. Kroon, L. G., H. Romeijn, P. J. Zwaneweld. 1997. Routing trains through railway networks: Complexity issues. Eur. J. Oper. Res. 98 485-498.
20. Lusby R., J. Larsen, D. Ryan, M. Ehrgott. 2006. Routing trains through railway junctions: A new set packing approach. Technical Report 2006-21, Informatics and Mathematical Modelling, Technical University of Denmark, Copenhagen.
21. Mascis, A., D. Pacciarelli. 2002. Job shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143 (3)498-517.
22. Mascis, A., D. Pacciarelli, M. Pranzo. 2008. Scheduling models for short-term railway traffic optimization. M. Hickman, P. Mirchandani, S. Voss, eds. Lecture Notes in Economics and Mathematical Systems 600: Computer-Aided Systems in Public Transport. Springer, Berlin, 71-90.
23. Mazzarello, M., E. Ottaviani. 2007. A traffic management system for real-time traffic optimization in railways. Transportation Res. Part B 41 (2)246-274.
24. Nie, L., I. A. Hansen. 2005. System analysis of train operations and track occupancy at railway stations. Eur. J. Transport Infrastructure Res. 5 (1)31-54.
25. Oliveira, E., B. M. Smith. 2000. A job-shop scheduling model for the single-track railway scheduling problem. School of Computing Research Report 2000.21, University of Leeds, Leeds, UK.
26. Pachl, J. 2002. Railway Operation and Control. VTD Rail Publishing, Mountlake Terrace, WA.
27. Rodriguez, J. 2007. A constraint programming model for real-time trains scheduling at junctions. Transportation Res. Part B 41 (2)231-245.
28. şahin, İ. 1999. Railway traffic control and train scheduling based on inter-train conflict management. Transportation Res. Part B 33 511-534.
29. Schöbel, A. 2001. A model for the delay management problem based on mixed-integer-programming. Electron. Notes Theor. Comput. Sci. 50 (1)1-10.
30. Szpigel, B. 1973. Optimal train scheduling on a single track railway. M. Ross, ed. Operational Research '72. North Holland Publishing Co., Amsterdam, 343-352.
31. Törnquist, J., J. A. Persson. 2007. N-tracked railway traffic rescheduling during disturbances. Transportation Res. Part B 41 (3)342-362.
32. Zwaneveld, P. J., L. G. Kroon, S. P. M. van Hoesel. 2001. Routing trains through a railway station based on a node packing model. Eur. J. Oper. Res. 128 14-33.