Real-Time Rolling Stock and Timetable Rescheduling in Urban Rail Transit Systems

References

• Alfieri A, Groot R, Kroon L, Schrijver A (2006) Efficient circulation of railway rolling stock. Transportation Sci. 40(3):378–391.Link, Google Scholar
• Barnhart C, Johnson L, Nemhauser L, Savelsbergh M, Vance P (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.Link, Google Scholar
• Cadarso L, Marín A (2012) Integration of timetable planning and rolling stock in rapid transit networks. Ann. Oper. Res. 199(1):113–135.Crossref, Google Scholar
• Cadarso L, Marín A, Maróti G (2013) Recovery of disruptions in rapid transit networks. Transportation Res. Part E 53:15–33.Crossref, Google Scholar
• Canca D, Barrena E (2018) The integrated rolling stock circulation and depot location problem in railway rapid transit systems. Transportation Res. Part E 109:115–138.Crossref, Google Scholar
• Cacchiani V, Caprara A, Toth P (2008) A column generation approach to train timetabling on a corridor. 4OR 6(2):125–142.Crossref, Google Scholar
• Cacchiani V, Caprara A, Galli L, Kroon L, Maróti G, Toth P (2012b) Railway rolling stock planning: Robustness against large disruptions. Transportation Sci. 46(2):217–232.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
• Corman F (2010) Real-time railway traffic management: Dispatching in complex, large and busy railway networks. PhD thesis, Technische Universiteit, Delft, Germany.Google Scholar
• Dal Sasso V, Lamorgese L, Mannino C, Tancredi A, Ventura P (2022) Easy cases of deadlock detection in train scheduling. Oper. Res. 70(4):2101–2118.Link, 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(2):646–657.Google Scholar
• Desaulniers G, Villeneuve D (2000) The shortest path problem with time windows and linear waiting costs. Transportation Sci. 34(3):312–319.Link, Google Scholar
• Dollevoet T, Huisman D, Kroon L, Schmidt M, Schöbel A (2014) Delay management including capacities of stations. Transportation Sci. 49(2):185–203.Link, Google Scholar
• Dumas Y, Soumis F, Desrosiers J (1990) Optimizing the schedule for a fixed vehicle path with convex inconvenience costs. Transportation Sci. 24(2):145–152.Link, Google Scholar
• Florio A, Hartl R, Minner S, Salazar-González J (2021) A branch-and-price algorithm for the vehicle routing problem with stochastic demands and probabilistic duration constraints. Transportation Sci. 55(1):122–138.Link, Google Scholar
• Gemander P, Bärmann A, Martin A (2023) A stochastic optimization approach to energy-efficient underground timetabling under uncertain dwell and running times. Transportation Sci. 57(6):1627–1645.Abstract, Google Scholar
• Haahr J, Lusby R, Larsen J, Pisinger D (2014) A branch-and-price framework for railway rolling stock rescheduling during disruptions. Technical report, DTU Management Engineering, Delhi.Google Scholar
• He Q, Irnich S, Song Y (2019) Branch-and-cut-and-price for the vehicle routing problem with time windows and convex node costs. Transportation Sci. 53(5):1409–1426.Link, Google Scholar
• He E, Boland N, Nemhauser G, Savelsbergh M (2021) Dynamic discretization discovery algorithms for time-dependent shortest path problems. INFORMS J. Comput. 34(2):1086–1114.Link, Google Scholar
• Hoogervorst R, Dollevoet T, Maróti G, Huisman D (2020) Reducing passenger delays by rolling stock rescheduling. Transportation Sci. 54(3):762–784.Link, Google Scholar
• Huang Y, Mannino C, Yang L, Tang T (2020) Coupling time-indexed and big-M formulations for real-time train scheduling during metro service disruptions. Transportation Res. Part B 133:38–61.Crossref, Google Scholar
• Ioachim I, Gélinas S, Soumis F, Desrosiers J (1998) A dynamic programming algorithm for the shortest path problem with time windows and linear node costs. Networks 31(3):193–204.Crossref, Google Scholar
• Kroon L, Maróti G, Nielsen L (2015) Rescheduling of railway rolling stock with dynamic passenger flows. Transportation Sci. 49(2):165–184.Link, Google Scholar
• Lai D, Leung JM (2018) Real-time rescheduling and disruption management for public transit. Transportmetrica B Transport Dynamics 6(1):17–33.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
• Lamorgese L, Mannino C (2019) A noncompact formulation for job-shop scheduling problems in traffic management. Oper. Res. 67(6):1586–1609.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
• Liang Z, Chaovalitwongse W, Elsayed E (2014) Sequence assignment model for the flight conflict resolution problem. Transportation Sci. 48(3):334–350.Link, Google Scholar
• Louwerse I, Huisman D (2014) Adjusting a railway timetable in case of partial or complete blockades. Eur. J. Oper. Res. 235(3):583–593.Crossref, Google Scholar
• Luo Z, Liu M, Lim A (2019) A two-phase branch-and-price-and-cut for a dial-a-ride problem in patient transportation. Transportation Sci. 53(1):113–130.Link, Google Scholar
• Lusby R, Haahr J, Larsen J, Pisinger D (2017) A branch-and-price algorithm for railway rolling stock rescheduling. Transportation Res. Part B 99:228–250.Crossref, Google Scholar
• Mannino C, Mascis A (2009) Optimal real-time traffic control in metro stations. Oper. Res. 57(4):1026–1039.Link, Google Scholar
• Martin-Iradi B, Ropke S (2022) A column-generation-based matheuristic for periodic and symmetric train timetabling with integrated passenger routing. Eur. J. Oper. Res. 297(2):511–531.Crossref, Google Scholar
• Muter I, Cordeau J, Laporte G (2014) A branch-and-price algorithm for the multidepot vehicle routing problem with interdepot routes. Transportation Sci. 48(3):425–441.Link, Google Scholar
• Ortega F, Pozo M, Puerto J (2018) On-line timetable rescheduling in a transit line. Transportation Sci. 52(5):1106–1121.Link, Google Scholar
• Righini G, Salani M (2008) New dynamic programming algorithms for the resource constrained elementary shortest path problem. Networks 51(3):258–271.Crossref, Google Scholar
• Savelsbergh M (1997) A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6):831–841.Link, Google Scholar
• Schettini T, Jabali O, Malucelli F (2022) Demand-driven timetabling for a metro corridor using a short-turning acceleration strategy. Transportation Sci. 56(4):919–937.Link, Google Scholar
• Schettini T, Gendreau M, Jabali O, Malucelli F (2024) A pattern-based timetabling strategy for a short-turning metro line. Public Transp. 16(1):1–37.Crossref, Google Scholar
• Schmöcker J, Cooper S, Adeney W (2005) Metro service delay recovery—Comparison of strategies and constraints across systems. Transportation Res. Rec. 1930:30–37.Crossref, Google Scholar
• Van Lieshout R (2021) Integrated periodic timetabling and vehicle circulation scheduling. Transportation Sci. 55(3):768–790.Link, Google Scholar
• Veelenturf L, Kidd M, Cacchiani V, Kroon L, Toth P (2015) A railway timetable rescheduling approach for handling large-scale disruptions. Transportation Sci. 50(3):841–862.Link, Google Scholar
• Wang Y, D’Ariano A, Yin J, Meng L, Tang T, Ning B (2018) Passenger demand oriented train scheduling and rolling stock circulation planning for an urban rail transit line. Transportation Res. Part B 118:193–227.Crossref, Google Scholar
• Wei L, Luo Z, Baldacci R, Lim A (2020) A new branch-and-price-and-cut algorithm for one-dimensional bin-packing problems. INFORMS J. Comput. 32(2):428–443.Link, Google Scholar
• Yin J, D’Ariano A, Wang Y, Tang T, Yang L (2021) Timetable coordination in a rail transit network with time-dependent passenger demand. Eur. J. Oper. Res. 295(1):183–202.Crossref, Google Scholar
• Yin J, Yang L, D’Ariano A, Tang T, Gao Z (2022) Integrated backup rolling stock allocation and timetable rescheduling with uncertain time-variant passenger demand. INFORMS J. Comput. 34(6):3234–3258.Link, Google Scholar
• Yin J, Yang L, Liang Z, D’Ariano A, Gao Z (2025) Real-time rolling stock and timetable rescheduling in urban rail transit systems. 10.1287/ijoc.2023.0391.cd, https://github.com/INFORMSJoC/2023.0391.Google Scholar
• Zhu Y, Goverde R (2019) Railway timetable rescheduling with flexible stopping and flexible short-turn during disruptions. Transportation Res. Part B 123:149–181.Crossref, Google Scholar
• Zhu Y, Goverde R (2021) Dynamic railway timetable rescheduling for multiple connected disruptions. Transportation Res. Part C 125:103080.Crossref, Google Scholar
• Zhuo S, Miao J, Meng L, Yang L, Shang P (2024) Demand-driven integrated train timetabling and rolling stock scheduling on urban rail transit line. Transportmetrica A Transport Sci. 20(3):2181024.Crossref, Google Scholar