Cyclic transfers in school timetabling
Post, Gerhard and Ahmadi, Samad and Geertsema, Frederik (2009) Cyclic transfers in school timetabling. [Report]

PDF
227kB 
Abstract:  In this paper we propose a neighbourhood structure based
on sequential/cyclic moves and a Cyclic Transfer algorithm for the high school timetabling problem. This method enables execution of complex moves for improving an existing solution, while dealing with the challenge of exploring the neighbourhood efficiently. An improvement graph is used in which certain negative cycles correspond to the neighbours; these cycles are explored using a recursive method. We address the problem of applying large neighbourhood structure methods on problems where the cost function is not exactly the sum of independent cost functions, as it is in the set partitioning problem. For computational experiments we use four real world datasets for high school timetabling in the Netherlands and England. We present results of the cyclic transfer algorithm with different settings on these datasets. The costs decrease by 8% to 28% if we use the cyclic transfers for local optimization compared to our initial solutions. The quality of the best initial solutions are comparable to the solutions found in practice by timetablers. 
Item Type:  Report 
Faculty:  Electrical Engineering, Mathematics and Computer Science (EEMCS) 
Research Group:  
Link to this item:  http://purl.utwente.nl/publications/68266 
Official URL:  http://www.math.utwente.nl/publications 
Export this item as:  BibTeX EndNote HTML Citation Reference Manager 
Repository Staff Only: item control page