Transfer-oriented dispatching optimization of rail transit network
From MaRDI portal
Recommendations
- Optimizing urban rail transit network operation plans based on transport capacity coordination
- Timetable coordination in a rail transit network with time-dependent passenger demand
- Publication:4889086
- Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem
- A simulated annealing algorithm for first train transfer problem in urban railway networks
Cited in
(10)- Distributionally robust last-train coordination planning problem with dwell time adjustment strategy
- Timetable coordination in a rail transit network with time-dependent passenger demand
- Strategic timetable scheduling for last trains in urban railway transit networks
- Last train timetabling optimization for minimizing passenger transfer failures in urban rail transit networks: a time period based approach
- Analysis of the parameters of transfers in rapid transit network design
- Optimizing urban rail transit network operation plans based on transport capacity coordination
- On a Rail Transportation Model with Scheduled Services
- A Re-optimization Approach for Train Dispatching
- Train coordinated adjustment method for operation delay of urban rail transit meeting passenger flow demand
- scientific article; zbMATH DE number 915572 (Why is no real title available?)
This page was built for publication: Transfer-oriented dispatching optimization of rail transit network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3132116)