An Empirical Analysis of Robustness Concepts for Timetabling

Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by classical robustness concepts on the other hand. Many different robustness concepts for timetabling have been suggested in the literature, some of them very recently. In this paper we compare such concepts on real-world instances. We also introduce a new approach that is generically applicable to any robustness problem. Nevertheless it is able to adapt the special characteristics of the respective problem structure and hence generates solutions that fit to the needs of the respective problem. 1998 ACM Subject Classification G.2.2 Graph Theory - Network problems Keywords and phrases Timetabling, Robust Optimization, Algorithm Engineering Digital Object Identifier 10.4230/OASIcs.ATMOS.2010.100

• Type: Journal
• Year: 2010
• Where: ATMOS
• Authors: Marc Goerigk, Anita Schöbel
• Keywords: ATMOS 2010, Many Different Robustness, Optimization, Respective Problem, Robustness