A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling

References

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