Delay Management Problem: Complexity Results and Robust Algorithms

DOI10.1007/978-3-540-85097-7_43zbMATH Open1168.90344OpenAlexW1592331772MaRDI QIDQ5505683FDOQ5505683

Authors: Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Daniele Frigioni 

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_43

Recommendations

• Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
• Evaluation of recoverable-robust timetables on tree networks
• Computing delay resistant railway timetables
• Recoverable Robust Timetables on Trees
• A bicriteria approach for robust timetabling

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Transportation, logistics and supply chain management (90B06)

Cites Work

• The Price of Robustness
• Robust optimization - a comprehensive survey
• Robust algorithms and price of robustness in shunting problems
• Optimization models for the single delay management problem in public transportation
• Algorithm Theory - SWAT 2004
• Graph-Theoretic Concepts in Computer Science

Cited In (20)

• Robust train routing and online re-scheduling
• Robust algorithms and price of robustness in shunting problems
• Graph-Theoretic Concepts in Computer Science
• Recoverable Robust Timetables on Trees
• Algorithm Theory - SWAT 2004
• Determining operations affected by delay in predictive train timetables
• Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
• Delay-robust event scheduling
• An experimental investigation of a primal-dual exterior point simplexalgorithm
• Recoverable robust timetable information
• The price of robustness in timetable information
• Extensions to online delay management on a single train line: New bounds for delay minimization and profit maximization
• Engineering graph-based models for dynamic timetable information systems
• Computing delay resistant railway timetables
• Evaluation of recoverable-robust timetables on tree networks
• A bicriteria approach for robust timetabling
• A survey on robustness in railway planning
• Entry and Exit Decision Problem with Implementation Delay
• Extending concepts of reliability. Network creation games, real-time scheduling, and robust optimization
• An empirical analysis of robustness concepts for timetabling

This page was built for publication: Delay Management Problem: Complexity Results and Robust Algorithms

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