New exact algorithm for the integrated train timetabling and rolling stock circulation planning problem with stochastic demand
From MaRDI portal
Publication:6565434
DOI10.1016/J.EJOR.2024.02.017MaRDI QIDQ6565434
Zhe Liang, Hai Yang, Hanchuan Pan, Lixing Yang
Publication date: 2 July 2024
Published in: European Journal of Operational Research (Search for Journal in Brave)
Cites Work
- Partitioning procedures for solving mixed-variables programming problems
- A note on the total unimodularity of matrices
- Integration of timetable planning and rolling stock in rapid transit networks
- Demand-oriented integration optimization of train timetabling and rolling stock circulation planning with flexible train compositions: a column-generation-based approach
- Circulation of railway rolling stock: a branch-and-price approach
- An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands
- Introduction to Stochastic Programming
- Integrated Backup Rolling Stock Allocation and Timetable Rescheduling with Uncertain Time-Variant Passenger Demand Under Disruptive Events
- Balancing a one‐way corridor capacity and safety‐oriented reliability: A stochastic optimization approach for metro train timetabling
This page was built for publication: New exact algorithm for the integrated train timetabling and rolling stock circulation planning problem with stochastic demand
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6565434)