Olivia Rossi-Doria
A comparison of the performance of different metaheuristics on the timetabling problem.
Rossi-Doria, Olivia; Sampels, Michael; Birattari, Mauro; Chiarandini, Marco; Dorigo, Marco; Gambardella, Luca Maria; Knowles, Joshua; Manfrin, Max; Mastrolilli, Monaldo; Paechter, Ben; Paquete, Luis; Stutzle, Thomas
Authors
Michael Sampels
Mauro Birattari
Marco Chiarandini
Marco Dorigo
Luca Maria Gambardella
Joshua Knowles
Max Manfrin
Monaldo Mastrolilli
Prof Ben Paechter B.Paechter@napier.ac.uk
Professor
Luis Paquete
Thomas Stutzle
Contributors
Edmund Burke
Editor
P Causmaecker
Editor
Abstract
The main goal of this paper is to attempt an unbiased comparison of the performance of straightforward implementations of five different metaheuristics on a university course timetabling problem. In particular, the metaheuristics under consideration are Evolutionary Algorithms, Ant Colony Optimization, Iterated Local Search, Simulated Annealing, and Tabu Search. To attempt fairness, the implementations of all the algorithms use a common solution representation, and a common neighbourhood structure or local search. The results show that no metaheuristic is best on all the timetabling instances considered. Moreover, even when instances are very similar, from the point of view of the instance generator, it is not possible to predict the best metaheuristic, even if some trends appear when focusing on particular instance classes. These results underline the difficulty of finding the best metaheuristics even for very restricted classes of timetabling problem.
Citation
Rossi-Doria, O., Sampels, M., Birattari, M., Chiarandini, M., Dorigo, M., Gambardella, L. M., Knowles, J., Manfrin, M., Mastrolilli, M., Paechter, B., Paquete, L., & Stutzle, T. (2002, August). A comparison of the performance of different metaheuristics on the timetabling problem
Start Date | Aug 21, 2002 |
---|---|
End Date | Aug 23, 2002 |
Publication Date | 2003-08 |
Deposit Date | May 11, 2010 |
Peer Reviewed | Peer Reviewed |
Volume | 2740 |
Pages | 329-351 |
Book Title | Practice and Theory of AutomatedTimetabling IV |
ISBN | 978-3-540-40699-0 |
DOI | https://doi.org/10.1007/978-3-540-45157-0_22 |
Keywords | university timetabling; evolutionary algorithms; ant colony optimization; iterated local search; simulated annealing; tabu search; |
Public URL | http://researchrepository.napier.ac.uk/id/eprint/3348 |
Publisher URL | http://dx.doi.org/10.1007/978-3-540-45157-0_22 |
You might also like
Accelerating neural network architecture search using multi-GPU high-performance computing
(2022)
Journal Article
A Cross-Domain Method for Generation of Constructive and Perturbative Heuristics
(2021)
Book Chapter
A Lifelong Learning Hyper-heuristic Method for Bin Packing
(2015)
Journal Article
Learning to solve bin packing problems with an immune inspired hyper-heuristic.
(2013)
Presentation / Conference Contribution
Downloadable Citations
About Edinburgh Napier Research Repository
Administrator e-mail: repository@napier.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