Home > Research > Publications & Outputs > An empirical analysis of robustness concepts fo...

Research

Links

Text available via DOI:

Keywords

View graph of relations

An empirical analysis of robustness concepts for timetabling

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Published

Standard

An empirical analysis of robustness concepts for timetabling. / Goerigk, Marc; Schöbel, Anita.
OpenAccess Series in Informatics. Vol. 14 2010. p. 100-113.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review

Harvard

Goerigk, M & Schöbel, A 2010, An empirical analysis of robustness concepts for timetabling. in OpenAccess Series in Informatics. vol. 14, pp. 100-113, 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2010, Liverpool, United Kingdom, 9/09/10. https://doi.org/10.4230/OASIcs.ATMOS.2010.100

APA

Goerigk, M., & Schöbel, A. (2010). An empirical analysis of robustness concepts for timetabling. In OpenAccess Series in Informatics (Vol. 14, pp. 100-113) https://doi.org/10.4230/OASIcs.ATMOS.2010.100

Vancouver

Goerigk M, Schöbel A. An empirical analysis of robustness concepts for timetabling. In OpenAccess Series in Informatics. Vol. 14. 2010. p. 100-113 doi: 10.4230/OASIcs.ATMOS.2010.100

Author

Goerigk, Marc ; Schöbel, Anita. / An empirical analysis of robustness concepts for timetabling. OpenAccess Series in Informatics. Vol. 14 2010. pp. 100-113

Bibtex

@inproceedings{1ff51327a4ec49a8aa50dde1051ac85b,
title = "An empirical analysis of robustness concepts for timetabling",
abstract = "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.",
keywords = "Algorithm engineering, Robust optimization, Timetabling",
author = "Marc Goerigk and Anita Sch{\"o}bel",
year = "2010",
doi = "10.4230/OASIcs.ATMOS.2010.100",
language = "English",
isbn = "9783939897200",
volume = "14",
pages = "100--113",
booktitle = "OpenAccess Series in Informatics",
note = "10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2010 ; Conference date: 09-09-2010 Through 09-09-2010",

}

RIS

TY - GEN

T1 - An empirical analysis of robustness concepts for timetabling

AU - Goerigk, Marc

AU - Schöbel, Anita

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - Algorithm engineering

KW - Robust optimization

KW - Timetabling

U2 - 10.4230/OASIcs.ATMOS.2010.100

DO - 10.4230/OASIcs.ATMOS.2010.100

M3 - Conference contribution/Paper

AN - SCOPUS:84883000832

SN - 9783939897200

VL - 14

SP - 100

EP - 113

BT - OpenAccess Series in Informatics

T2 - 10th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, ATMOS 2010

Y2 - 9 September 2010 through 9 September 2010

ER -