An empirical analysis of robustness concepts for timetabling
From MaRDI portal
Publication:2917293
Recommendations
Cited in
(19)- Search algorithms for improving the Pareto front in a timetabling problem with a solution network-based robustness measure
- Robustness tests for public transport planning
- Generalized light robustness and the trade-off between robustness and nominal quality
- Recoverable Robustness in Shunting and Timetabling
- A biobjective approach to recoverable robustness based on location planning
- How to measure the robustness of shunting plans
- Robust optimization for routing problems on trees
- Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
- MIP-based approaches for robust storage loading problems with stacking constraints
- Determining operations affected by delay in predictive train timetables
- Robust load planning of trains in intermodal transportation
- Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
- An experimental investigation of a primal-dual exterior point simplexalgorithm
- The price of robustness in timetable information
- A bicriteria approach for robust timetabling
- Timetabling with passenger routing
- Approximate cutting plane approaches for exact solutions to robust optimization problems
- An experimental study of bicriteria models for robust timetabling
- Improving the robustness in railway station areas
This page was built for publication: An empirical analysis of robustness concepts for timetabling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2917293)