A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling

Transportation Science

Volumn 45, Issue 2, 2011, Pages 212-227

  Caimi, G ^a   Chudak, F ^b   Fuchsberger, M ^a   Laumanns, M ^a   Zenklusen, R ^c  

^a ETH ZURICH   (Switzerland)

^b D WAVE SYSTEMS INC   (Canada)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Blocking times; Conflict cliques; Conflict graph; Integer linear programming; Multicommodity flow; Train routing; Train scheduling

Indexed keywords

BINARY TREES; FLOW GRAPHS; FORESTRY; INTEGER PROGRAMMING; RAILROAD TRANSPORTATION; RAILROADS; SCHEDULING; TREES (MATHEMATICS);

BLOCKING TIMES; CONFLICT CLIQUES; CONFLICT GRAPH; INTEGER LINEAR PROGRAMMING; MULTI-COMMODITY FLOW; TRAIN ROUTING; TRAIN SCHEDULING;

GRAPH THEORY;

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

References (45)

1. Burkolter, D. 2005. Capacity of railways in station areas using Petri nets. Ph. D. thesis, ETH Zurich, Zurich.
2. Caimi, G., D. Burkolter, T. M. Herrmann. 2005. Finding delaytolerant train routing through stations. H. Fleuren, D. den Hertog, P. Kort, eds. Operations Research Proceedings 2004. GOR, Springer, Berlin, 136-143.
3. Caimi, G., M. Fuchsberger, M. Laumanns, K. Schüpbach. 2011. Periodic railway timetabling with event flexibility. Networks 57 (1) 3-18.
4. Caimi, G., M. Fuchsberger, D. Burkolter, T. Herrmann, R. Wüst, S. Roos. 2009a. Conflict-free train scheduling in a compensation zone exploiting the speed profile. I. Hansen, ed. Proc. 3rd Internat. Seminar Railway Oper. Modelling Anal. (RailZurich 2009), ETH, Zurich, Switzerland.
5. Caimi, G., T. M. Herrmann, D. Burkolter, F. Chudak, M. Laumanns. 2009c. Design of a railway scheduling model for dense services. Networks Spatial Econom. 9 (1) 25-46.
6. Caprara, A., L. Galli, P. Toth. 2007. Solution of the train platforming problem. C. Liebchen, R. Ahuja, J. Mesa, eds. ATMOS 2007. IBFI, Schloss Dagstuhl, Dagstuhl, Germany.
7. Caprara, A., L. Galli, S. Stiller, P. Toth. 2009. Recovery-robust platforming by network buffering. I. Hansen, ed. Proc. 3rd Internat. Seminar Railway Oper. Modelling Anal. (RailZurich 2009), ETH, Zurich, Switzerland.
8. Carey, M. 1994. A model and strategy for train pathing with choice of lines, platforms, and routes. Transportation Res. Part B 28 (5) 333-353.
9. Carey, M., S. Carville. 2003. Scheduling and platforming trains at busy complex stations. Transportation Res. Part A 37 195-224. (Pubitemid 36128978)
10. Chvátal, V. 1975. On certain polytopes associated with graphs. J. Combin. Theory (B) 18 138-154.
11. Corman, F., R. M. Goverde, A. D'Ariano. 2009. Rescheduling dense train traffic over complex station interlocking areas. Robust and Online Large-Scale Optimization, Lecture Notes in Computer Science, Vol. 5868. Springer-Verlarg, Berlin, 369-386.
12. Corman, F., A. D'Ariano, D. Pacciarelli, M. Pranzo. 2010. A tabu search algorithm for rerouting trains during rail operations. Transportation Res. Part B: Methodological 44 (1) 175-192.
13. D'Ariano, A., A. Pacciarelli, M. Pranzo. 2007. A branch and bound algorithm for scheduling trains in a railway network. Eur. J. Oper. Res. 183 (2) 643-657. (Pubitemid 46891151)
14. Fischetti, M., D. Salvagnin, A. Zanette. 2009. Fast approaches to improve the robustness of a railway timetable. Transportation Sci. 43 (3) 321-335.
15. Gély, L., G. Dessagne, P. Pesneau, F. Vanderbeck. 2010. A MultiScalable Model Based on a Connexity Graph Representation. WIT Press, Southampton. Comput. Railways XII. Forthcoming.
16. Golumbic, M. 1980. Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York.
17. Grötschel, M., L. Lovász, A. Schrijver. 1993. Geometric Algorithms and Combinatorial Optimization. Springer, Berlin.
18. Hansen, I., J. Pachl, eds. 2008. Railway Timetable and Traffic: Analysis, Modelling and Simulation. Eurailpress, Hamburg, Germany.
19. Herrmann, T. M. 2005. Stability of timetables and train routings through station regions. Ph. D. thesis, ETH Zurich, Zurich.
20. Kroon, L. G. 2008. Fahrplanoptimierung mit mathematischen Modellen bei den Niederländischen Eisenbahnen. Eisenbahntechnische Rundschau 6 359-362. (In German).
21. Kroon, L. G., G. Maróti. 2008. Robust train routing. Technical report TR-0123, ARRIVAL.
22. Kroon, L. G., R. Dekker, M. J. C. M. Vromans. 2007. Cyclic railway timetabling: A stochastic optimization approach. F. Geraets, L. Kroon, A. Schoebel, D. Wagner, C. Zaroliagis, eds. Algorithmic Methods for Railway Optimization. Springer, Berlin, 41-66.
23. Kroon, L. G., H. E. Romeijn, P. J. Zwaneveld. 1997. Routing trains through railway stations: Complexity issues. Eur. J. Oper. Res. 98 (3) 485-498. (Pubitemid 127392237)
24. Liebchen, C. 2006. Periodic timetable optimization in public transport. Ph. D. thesis, Technische Universität Berlin, Berlin.
25. Liebchen, C., S. Stiller. 2009. Delay resistant timetabling. Public Transport 1 (1) 55-72.
26. Liebchen, C., M. Lübbecke, R. H. Möhring, S. Stiller. 2009a. The concept of recoverable robustness, linear programming recovery, and railway applications. Robust and Online Large-Scale Optimization. Springer, Berlin, 1-27.
27. Liebchen, C., M. Schachtebeck, A. Schöbel, S. Stiller, A. Prigge. 2010. Computing delay resistant railway timetables. Comput. Oper. Res. 37 (5) 857-868.
28. Lusby, R. 2006. Routing trains through railway stations-A new set packing approach. Proc. 41th Annual Conf. Oper. Res. Soc., Christchurch, New Zealand, 49-59.
29. Lusby, R., J. Larsen, D. Ryan, M. Ehrgott. 2006. Routing trains through railway junctions: A new set packing approach. Technical report 2006-21, IMM, Technical University of Denmark, Copenhagen.
30. Lüthi, M., G. Medeossi, A. Nash. 2008. Structure and simulation evaluation of an integrated real-time rescheduling system for railway networks. Networks Spatial Econom. 9 (1) 103-121.
31. Odijk, M., I. Van den Berg. 1994. DONS: Computer aided design of regular service timetables. T. Murthy, C. Brebbia, B. Mellitt, G. Sciutto, S. Sone, eds. Computers in Railways IV, Vol. 2. Railway Operations. WIT Press, Southampton, UK, 109-116.
32. Pachl, J. 2002. Railway Operation and Control. VTD Rail Publishing, Mountlake Terrace, WA.
33. Pachl, J. 2008. Timetable design principles. I. A. Hansen, J. Pachl, eds. Railway, Timetable and Traffic. Analysis, Modeling, Simulation, Chapter 2. Eurailpress, Hamburg, Germany, 9-42.
34. Radtke, A. 2008. Infrastructure modeling. I. A. Hansen, J. Pachl, eds. Railway Timetable and Traffic. Analysis, Modelling, Simulation, Chapter 3. Eurailpress, Hamburg, Germany, 43-57.
35. Radtke, A., D. Hauptmann. 2004. Automated planning of timetables in large railway networks using a microscopic data basis and railway simulation techniques. J. Allan, R. Hill, C. Brebbia, G. Sciutto, S. Sone, eds. Computers in Railways IX. WIT Press, Southampton, UK, 615-625.
36. Rodriguez, J. 2007. A constraint programming model for real-time train scheduling at junctions. Transportation Res. Part B 41 (2) 231-245. (Pubitemid 44391251)
37. SBB. 2008. Geschäftsbericht 2008. Document for the media. (In German).
38. Schrijver, A. 2003. Combinatorial Optimization. Springer, Berlin.
39. Sewcyk, B., A. Radtke, G. Wilfinger. 2007. Combining microscopic and macroscopic infrastructure planning models. Proc. 2nd Internat. Seminar Railway Oper. Modeling Anal., International Association of Railway Operations Research, Hannover, Germany.
40. Tucker, A. C. 1980. An efficient test for circular-arc graphs. SIAM J. Comput. 9 (1) 1-24.
41. UVEK. 2006. Prognosen für den Schienenverkehr. Medienmitteilung. http://www.bav.admin.ch. (In German.)
42. Velasquez, R., M. Ehrgott, D. Ryan, A. Schöbel. 2005. A set-packing approach to routing trains through railway stations. Proc. 40th Annual Conf. Oper. Res. Soc., Wellington, New Zealand, 305-314.
43. Zwaneveld, P. J., L. G. Kroon. 1995. Stations: Final report of phase 1. Technical report 201, Rotterdam School of Management, Rotterdam, The Netherlands.
44. 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 (1) 14-33. (Pubitemid 32022960)
45. Zwaneveld, P. J., L. G. Kroon, H. E. Romeijn, M. Salomon, S. Dauzère-Pérès, S. P. M. van Hoesel, H. W. Ambergen. 1996. Routing trains through railway stations: Model formulation and algorithms. Transportation Sci. 30 (3) 181-194. (Pubitemid 126605103)