The Connectedness of Clash-free Timetables

Beitrag bei einer Tagung
(Originalarbeit)


Details zur Publikation

Autor(en): Mühlenthaler M, Wanka R
Jahr der Veröffentlichung: 2014
Tagungsband: Proc. 10th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT)
Seitenbereich: 330-346
Sprache: Englisch


Abstract


We investigate the connectedness of clash-free timetables with respect to the Kempe-exchange operation. This investigation is related to the connectedness of the search space of timetabling problem instances, which is a desirable property, for example for twostep algorithms using the Kempe-exchange during the optimization step. The theoretical framework for our investigations is based on the study of reconfiguration graphs, which model the search space of timetabling problems. We contribute to this framework by including period availability requirements in the analysis and we derive improved conditions for the connectedness of clash-free timetables in this setting. We further show that the diameter of the reconfiguration graphs increases only linearly due to the period availability requirements. We apply the theoretical insights to establish the connectedness of clash-free timetables for a number of benchmark instances.



FAU-Autoren / FAU-Herausgeber

Mühlenthaler, Moritz Dr.-Ing.
Lehrstuhl für Informatik 12 (Hardware-Software-Co-Design)
Wanka, Rolf Prof. Dr.
Professur für Informatik (Effiziente Algorithmen und Kombinatorische Optimierung)


Zitierweisen

APA:
Mühlenthaler, M., & Wanka, R. (2014). The Connectedness of Clash-free Timetables. In Proc. 10th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT) (pp. 330-346). York, UK.

MLA:
Mühlenthaler, Moritz, and Rolf Wanka. "The Connectedness of Clash-free Timetables." Proceedings of the Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT), York, UK 2014. 330-346.

BibTeX: 

Zuletzt aktualisiert 2018-08-08 um 00:53