Friedrich-Alexander-Universität DruckenUnivisEnglish FAU-Logo
Techn. Fakultät Willkommen am Department Informatik FAU-Logo
Codesign
Lehrstuhl für Informatik 12
MW14
Department Informatik  >  Informatik 12  >  Personal  >  Rolf Wanka  >  Veröffentlichungen  >  MW14

The Connectedness of Clash-free Timetables

Moritz Mühlenthaler and Rolf Wanka

Department of Computer Science
University of Erlangen-Nuremberg, Germany
{moritz.muehlenthaler,rwanka}@cs.fau.de

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, as a result, 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.


in: Proc. 10th Int. Conf. on the Practice and Theory of Automated Timetabling (PATAT), pp. 330--346, 2014.

Full text pdf


BibTex entry


  Impressum Stand: 09 September 2014.   R.W.