Recoverable robust timetable information

DOI10.4230/OASICS.ATMOS.2013.1MaRDI QIDQ5397837zbMATH OpenOpenAlexFDO

Authors Marc Goerigk, Hesse, Marie Schmidt, Anita Schöbel, Matthias Müller-Hannemann

Publication date 24 February 2014

Full work available at URL https://inria.hal.science/hal-00871789

zbMATH Keywords

recoverable robustnesstimetable informationdelay scenarios

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Traffic problems in operations research (90B20)

Recommendations

• The price of robustness in timetable information
• Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
• Recoverable Robust Timetables on Trees
• Evaluation of recoverable-robust timetables on tree networks
• Delay Management Problem: Complexity Results and Robust Algorithms

Cited in

(9)

• Efficient Timetable Information in the Presence of Delays
• Recoverable Robustness in Shunting and Timetabling
• Minmax robustness for multi-objective optimization problems
• Concepts of efficiency for uncertain multi-objective optimization problems based on set order relations
• Connection Scan Algorithm
• The fastest itinerary in time-dependent decentralized travel information systems
• Recoverable robust timetabling for single delay: Complexity and polynomial algorithms for special cases
• On the recoverable robust traveling salesman problem
• The price of robustness in timetable information

This page was built for publication: Recoverable robust timetable information

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