Iterated heuristic algorithms for the classroom assignment problem

Constantino, Ademir Aparecido and Filho, Walter Marcondes and Landa-Silva, Dario (2010) Iterated heuristic algorithms for the classroom assignment problem. In: 2010 International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010), 10-13 August 2010, Belfast, Northern Ireland.

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (276kB) | Preview


We tackle the classroom assignment problem in a large University with the objective of minimising the total distance between all classrooms assigned to teaching activities in the same course. Additional requirements that should be satisfied include: making an efficient utilisation of the space, satisfying room preferences and complying with other administrative requirements. We present two iterated heuristic approaches, each one consisting of an iterative resolution of an assignment problem (the classical assignment problem in the first approach and the bottleneck assignment problem in the second approach) and a third algorithm based on the Variable Neighbourhood Search (VNS) meta-heuristic. We also present and discuss experimental results using real-world data from three consecutive academic sessions.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Published in: Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling, 10-13 August 2010, Queen’s University of Belfast / Edited by Barry McCollum, Edmund Burke, George White. Belfast : Queen’s University Belfast, 2010, p. 152-166. ISBN 0853899733
Keywords: Assignment problem, scheduling and timetabling, heuristics metaheuristics
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Landa-Silva, Dario
Date Deposited: 01 Aug 2016 09:04
Last Modified: 27 Jun 2018 09:34

Actions (Archive Staff Only)

Edit View Edit View