Optimal Train Dispatching by Benders’-Like Reformulation

References

• Balas E (1979) Disjunctive programming. Ann. Discrete Math. 5:3–51.Crossref, Google Scholar
• Boccia M, Mannino C, Vasiliev I (2013) The dispatching problem on multitrack territories: Heuristic approaches based on mixed integer linear programming. Networks 62(4):315–326.Crossref, Google Scholar
• Borndörfer R, Schlechte T (2007) Models for railway track allocation. Liebchen C, Ahuja RK, Mesa JA, eds. ATMOS 2007—7th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, Dagstuhl, Germany.Google Scholar
• Brännlund U, Lindberg PO, Nõu A, Nilsson J-E (1998) Railway timetabling using Lagrangian relaxation. Transportation Sci. 32(4):358–369.Link, Google Scholar
• Cacchiani V, Caprara A, Fischetti M (2012) A Lagrangian heuristic for robustness, with an application to train timetabling. Transportation Sci. 46(1):124–133.Link, Google Scholar
• Cacchiani V, Huisman D, Kidd M, Kroon L, Toth P, Veelenturf L, Wagenaar J (2014) An overview of recovery models and algorithms for real-time railway rescheduling. Transportation Res. Part B 63:15–37.Crossref, Google Scholar
• Caimi G, Fuchsberger M, Laumanns M, Luethi M (2012) A model predictive control approach for discrete-time rescheduling in complex central railway station areas. Comput. OR 39:2578–2593.Crossref, Google Scholar
• Caimi G, Chudak F, Fuchsberger M, Laumanns M, Zenklusen R (2011) A new resource-constrained multicommodity flow model for conflict-free train routing and scheduling. Transportation Sci. 45(2):212–227.Link, Google Scholar
• Caprara A, Galli L, Toth P (2011) Solution of the train platforming problem. Transportation Sci. 45(2):246–257.Link, Google Scholar
• Codato G, Fischetti M (2006) Combinatorial Benders’ cuts for mixed-integer linear programming. Oper. Res. 54(4):756–766.Link, Google Scholar
• Corman F, D’Ariano A, Pacciarelli D, Pranzo M (2012) Optimal inter-area coordination of train rescheduling decisions. Transportation Res. Part E 48:71–88.Crossref, Google Scholar
• Corman F, D’Ariano A, Pacciarelli D, Pranzo M (2014) Dispatching and coordination in multi-area railway traffic management. Comput. OR 44:146–160.Crossref, Google Scholar
• D’Ariano A, Pacciarelli D, Pranzo M (2007) A branch and bound algorithm for scheduling trains in a railway network. Eur. J. Oper. Res. 183:643–657.Crossref, Google Scholar
• D’Ariano A, Corman F, Pacciarelli D, Pranzo M (2008) Reordering and local rerouting strategies to manage train traffic in real time. Transportation Sci. 42(4):405–419.Link, Google Scholar
• Dollevoet T, Corman F, D’Ariano A, Huisman D (2014) An iterative optimization framework for delay management and train scheduling. Flexible Services Manufacturing J. 26(4):490–515.Crossref, Google Scholar
• Dollevoet T, Huisman D, Schmidt M, Schöbel A (2012) Delay management with rerouting of passengers. Transportation Sci. 46(1):74–89.Link, Google Scholar
• Dollevoet T, Huisman D, Kroon L, Schmidt M, Schöbel A (2015) Delay management including capacities of stations. Transportation Sci. 49(2):185–203.Link, Google Scholar
• Dyer M, Wolsey L (1990) Formulating the single machine sequencing problem with release dates as a mixed integer program. Discrete Appl. Math. 26(2–3):255–270.Crossref, Google Scholar
• Espinosa-Aranda JL, García-Ródenas R (2013) A demand-based weighted train delay approach for rescheduling railway networks in real time. J. Rail Transport Planning Management 3:1–13.Crossref, Google Scholar
• Fuchsberger M (2012) Algorithms for railway traffic management in complex central station areas. Unpublished doctoral dissertation, ETH Zurich, Zurich.Google Scholar
• Harrod S (2011) Modeling network transition constraints with hypergraphs. Transportation Sci. 45(1):81–97.Link, Google Scholar
• Krasemann JT (2012) Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbances. Transportation Res. Part C 20:62–78.Crossref, Google Scholar
• Krasemann JT, Persson JA (2007) N-tracked railway traffic re-scheduling during disturbances. Transportation Res. Part B 41:342–362.Crossref, Google Scholar
• Kroon LGS, Romeijn HE, Zwaneveld PJ (1997) Routing trains through railway stations: Complexity issues. Eur. J. Oper. Res. 98:485–498.Crossref, Google Scholar
• Lamorgese L, Mannino C (2013) The track formulation for the train dispatching problem. Electronic Notes Discrete Math. 41:559–566.Crossref, Google Scholar
• Lamorgese L, Mannino C (2015) An exact decomposition approach for the real-time train dispatching problem. Oper. Res. 63(1):48–64.Link, Google Scholar
• Luethi M (2009) Improving the efficiency of heavily used railway networks through integrated real-time rescheduling. Unpublished doctoral dissertation, ETH Zurich, Zurich.Google Scholar
• Lusby R, Larsen J, Ryan D, Ehrgott M (2011) Routing trains through railway junctions: A new set-packing approach. Transportation Sci. 45(2):228–245.Link, Google Scholar
• Mannino C (2011) Real-time traffic control in railway systems. Caprara A, Kontogiannis S, eds. Proc. Atmos’11, OASICS, Vol. 20.Google Scholar
• Mannino C, Mascis A (2009) Real-time traffic control in metro stations. Oper. Res. 57(4):1026–1039.Link, Google Scholar
• Mascis A, Pacciarelli D (2002) Job shop scheduling with blocking and no-wait constraints. Eur. J. Oper. Res. 143(3):498–517.Crossref, Google Scholar
• Meng L, Zhou X (2011) Robust single-track train dispatching model under a dynamic and stochastic environment: A scenario-based rolling horizon solution approach. Transportation Res. Part B 45:1080–1102.Crossref, Google Scholar
• Nemhauser GL, Wolsey LA (1999) Integer and Combinatorial Optimization (Wiley-Interscience, New York).Google Scholar
• Pellegrini P, Marlière G, Rodriguez J (2014) Optimal train routing and scheduling for managing traffic perturbations in complex junctions. Transportation Res. Part B 59:58–80.Crossref, Google Scholar
• Rogstad AE (2013) Personal communication with chief dispatcher Trondheim station, Norway.Google Scholar
• Sahin G, Ahuja RK, Cunha CB (2010) Integer programming based approach for the train dispatching problem. Technical report, Sabanci University, Istanbul.Google Scholar
• Schachtebeck M, Schöbel A (2010) To wait or not to wait—And who goes first? Delay management with priority decisions. Transportation Sci. 44(3):307–321.Link, Google Scholar
• Schlechte T (2012) Railway track allocation: Models and algorithms. Unpublished doctoral dissertation, Technische Universität Berlin, Berlin.Google Scholar
• Schrijver A (2003) Combinatorial Optimization (Springer-Verlag, Berlin).Google Scholar
• Vanderbeck F, Wolsey LA (2010) Reformulation and decomposition of integer programs. Jünger M, Liebling T, Naddef D, Nemhauser G, Pulleyblank W, Reinelt G, Rinaldi G, Wolsey L, eds. 50 Years of Integer Programming (Springer-Verlag, Berlin Heidelberg), 431–502.Crossref, Google Scholar
• Zwaneveld PJ, Kroon LGS, Romeijn HE, Salomon M, Dauzère-Pérès S, Van Hoesel SPM, Ambergen HW (1996) Routing trains through railway stations: Model formulation and algorithms. Transportation Sci. 30(3):181–194.Link, Google Scholar