Joe Henry Obit
Non-linear great deluge with reinforcement learning for university course timetabling
Obit, Joe Henry; Landa-Silva, Dario; Sevaux, Marc; Ouelhadj, Djamila
Authors
DARIO LANDA SILVA DARIO.LANDASILVA@NOTTINGHAM.AC.UK
Professor of Computational Optimisation
Marc Sevaux
Djamila Ouelhadj
Contributors
Marco Caserta
Editor
Stefan Voss
Editor
Abstract
This paper describes a non-linear great deluge hyper-heuristic incorporating a reinforcement learning mechanism for the selection of low-level heuristics and a non-linear great deluge acceptance criterion. The proposed hyper-heuristic deals with complete solutions, i.e. it is a solution improvement approach not a constructive one. Two types of reinforcement learning are investigated: learning with static memory length and learning with dynamic memory length. The performance of the proposed algorithm is assessed using eleven test instances of the university course timetabling problem. The experimental results show that the non-linear great deluge hyper-heuristic performs better when using static memory than when using dynamic memory. Furthermore, the algorithm with static memory produced new best results for ?ve of the test instances while the algorithm with dynamic memory produced four best results compared to the best known results from the literature.
Citation
Obit, J. H., Landa-Silva, D., Sevaux, M., & Ouelhadj, D. (2011). Non-linear great deluge with reinforcement learning for university course timetabling. In M. Caserta, & S. Voss (Eds.), Metaheuristics: intelligent decision making. Springer
Publication Date | Jan 1, 2011 |
---|---|
Deposit Date | Apr 4, 2016 |
Peer Reviewed | Peer Reviewed |
Issue | 50 |
Series Title | Operations research/computer science interfaces series |
Book Title | Metaheuristics: intelligent decision making |
ISBN | 9781441979728 |
Keywords | Great deluge, scheduling and timetabling, course timetabling, adaptive algorithms, heuristics metaheuristics, local search |
Public URL | https://nottingham-repository.worktribe.com/output/1011135 |
You might also like
A 0/1 integer programming model for the office space allocation problem
(2010)
Journal Article
Evolutionary multi-objective optimization algorithms with probabilistic representation based on pheromone trails
(2010)
Presentation / Conference Contribution
Iterated heuristic algorithms for the classroom assignment problem
(2010)
Presentation / Conference Contribution
Improved dynamic lexicographic ordering for multi-objective optimisation
(2010)
Presentation / Conference Contribution
CODEA : an agent based multi-objective optimization framework
(2010)
Presentation / Conference Contribution
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: discovery-access-systems@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