Station Dispatching Problem for a Large Terminal: A Constraint Programming Approach

References

• Balas E (1985) On the facial structure of scheduling polyhedral. Cottle RW, ed. Mathematical Programming Essays in Honor of George B. Dantzig, Part I (Springer, Berlin), 179–218.Crossref, Google Scholar
• Barták R, Salido MA, Rossi F (2010) New trends in constraint satisfaction, planning, and scheduling: A survey. Knowledge Engrg. Rev. 25(3):249–279.Crossref, Google Scholar
• Billionet A (2003) Using integer programming to solve the train-platforming problem. Transportation Sci. 37(2):213–222.Link, Google Scholar
• Brännlund U, Lindberg O, Andreas N, Nilsson J-E (1998) Railway timetabling using Lagrangian relaxation. Transportation Sci. 32(4):358–369.Link, Google Scholar
• Bron C, Kerbosch J (1973) Algorithm 457: Finding all cliques of an undirected graph. Comm. ACM 16(9):575–577.Crossref, Google Scholar
• Burkolter DM (2005) Capacity of railways in station areas using Petri nets. Doctoral dissertation, Swiss Federal Institute of Technology, Zurich.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
• 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
• Cardillo DL, Mione N (1998) k L-list λ colouring of graphs. Eur. J. Oper. Res. 106(1):160–164.Crossref, Google Scholar
• Chakroborty P, Vikram D (2008) Optimum assignment of trains to platforms under partial schedule compliance. Transportation Res. Part B: Methodology 42(1):169–184.Crossref, Google Scholar
• Laborie P, Jerome R (2008) Reasoning with conditional time-intervals. Wilson D, Lane HC, eds. Proc. 21st Internat. FLAIRS Conf. (AAAI Press, Menlo Park, CA), 555–560.Google Scholar
• Laborie P, Jerome R, Shaw P, Vilím P (2009) Reasoning with conditional time-intervals. Part II: An algebraical model for resources. Lane HC, Guesgen HW, eds. Proc. 22nd Internat. FLAIRS Conf. (AAAI Press, Menlo Park, CA), 201–206.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
• Lamorgese L, Mannino C, Piacentini M (2016) Optimal train dispatching by Benders’-like reformulation. Transportation Sci. 50(3):910–925.Link, Google Scholar
• Mannino C, Mascis A (2009) Optimal real-time traffic control in metro stations. Oper. Res. 57(4):1026–1039.Link, Google Scholar
• Pellegrini P, Marliere G, Rodriguez J (2014) Optimal train routing and scheduling for managing traffic perturbations in complex junctions. Transportation Res. Part B: Methodology 59(January):58–80.Crossref, Google Scholar
• Rodriguez J (2007) A constraint programming model for real-time train scheduling at junctions. Transportation Res. Part B: Methodology 41(2):231–245.Crossref, Google Scholar
• Şahin G, Ahuja RK, Cunha CB (2010) Integer programming based solution approaches for the train dispatching problem. Report, Sabancı University, Istanbul.Google Scholar
• Törnquist J, Persson JA (2007) N-tracked railway traffic re-scheduling during disturbances. Transportation Res. Part B: Methodology 41(3):342–362.Crossref, Google Scholar
• Zwaneveld PJ, Kroon LG, Romeijn HE, Salomon M, Dauzere-Peres 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