Ademir Aparecido Constantino
Iterated heuristic algorithms for the classroom assignment problem
Constantino, Ademir Aparecido; Filho, Walter Marcondes; Landa-Silva, Dario
Authors
Walter Marcondes Filho
DARIO LANDA SILVA DARIO.LANDASILVA@NOTTINGHAM.AC.UK
Professor of Computational Optimisation
Abstract
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.
Citation
Constantino, A. A., Filho, W. M., & Landa-Silva, D. (2010). Iterated heuristic algorithms for the classroom assignment problem.
Conference Name | 2010 International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010) |
---|---|
End Date | Aug 13, 2010 |
Acceptance Date | May 10, 2010 |
Publication Date | Aug 13, 2010 |
Deposit Date | Aug 1, 2016 |
Publicly Available Date | Mar 28, 2024 |
Peer Reviewed | Peer Reviewed |
Keywords | Assignment problem, scheduling and timetabling, heuristics metaheuristics |
Public URL | https://nottingham-repository.worktribe.com/output/706614 |
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 |
Files
dls_patat2010_2.pdf
(277 Kb)
PDF
You might also like
Evolving Deep CNN-LSTMs for Inventory Time Series Prediction
(2019)
Conference Proceeding
An agent based modelling approach for the office space allocation problem
(2018)
Conference Proceeding
Lookahead policy and genetic algorithm for solving nurse rostering problems
(2018)
Conference Proceeding
A genetic algorithm with composite chromosome for shift assignment of part-time employees
(2018)
Conference Proceeding
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: digital-library-support@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search