Recoverable Robustness in Shunting and Timetabling

DOI10.1007/978-3-642-05465-5_2MaRDI QIDQ3649158zbMATH OpenOpenAlexFDO

Authors Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Michael Schachtebeck, Anita Schöbel, Daniele Frigioni

Publication date 3 December 2009

Published in Robust and Online Large-Scale Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-05465-5_2

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)

Recommendations

• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
• Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
• Recoverable Robust Timetables: An Algorithmic Approach on Trees
• Recoverable robustness for train shunting problems
• Recoverable Robust Timetables on Trees
• An empirical analysis of robustness concepts for timetabling
• Evaluation of recoverable-robust timetables on tree networks
• Robust algorithms and price of robustness in shunting problems
• Recoverable robust timetable information
• Robust scheduling and robustness measures for the discrete time/cost trade-off problem

Cited in

(27)

• On the computation of robust examination timetables: methods and experimental results
• Robust algorithms and price of robustness in shunting problems
• Combinatorial and robust optimisation models and algorithms for railway applications
• Recoverable robustness for train shunting problems
• Dynamic algorithms for recoverable robustness problems
• Generalized light robustness and the trade-off between robustness and nominal quality
• A biobjective approach to recoverable robustness based on location planning
• Recoverable Robust Timetables on Trees
• On strategic multistage operational two-stage stochastic 0--1 optimization for the rapid transit network design problem
• How to measure the robustness of shunting plans
• Line planning in public transportation: models and methods
• scientific article; zbMATH DE number 7121837 (Why is no real title available?)
• Decomposition approaches for recoverable robust optimization problems
• Formulations and algorithms for the recoverable \({\varGamma}\)-robust knapsack problem
• Online knapsack of unknown capacity. How to optimize energy consumption in smartphones
• Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling
• Delay-robust event scheduling
• Recoverable robust knapsacks: the discrete scenario case
• Multi-stage recovery robustness for optimization problems: A new concept for planning under disturbances
• The concept of recoverable robustness, linear programming recovery, and railway applications
• Engineering graph-based models for dynamic timetable information systems
• Robust algorithms for sorting railway cars
• Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem
• Evaluation of recoverable-robust timetables on tree networks
• Recoverable robustness by column generation
• A survey on robustness in railway planning
• ROPI -- a robust optimization programming interface for C++

This page was built for publication: Recoverable Robustness in Shunting and Timetabling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3649158)