Citation

Al-Betar, M. A and Khader, A. T A hybrid harmony search for university course timetabling. Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland, pages 157-179, 2009.

Paper


Abstract

Combinations of metaheuristics to solve highly constrained combinatorial optimisation problems have recently become a promising research area. Some combinations emerge from integrating evolutionary algorithms and local based algorithms to strike the right balance between global exploration of the search region and local exploitation of promising regions. This study presents hybridization between harmony search algorithms and hill climbing optimisers to tackle the university course timetabling problem. The solution is essentially a harmony search algorithm. The hill climbing optimiser is responsible for improving the new harmony vector, obtained from harmony search, with a certain probability. Furthermore, inspired by the practical swarm optimisation, we modified the memory consideration operator to let it improvise rather than always working in the same way. Our algorithm converges significantly faster than does the classical harmony search algorithm. We evaluate our hybrid algorithm with a standard benchmark introduced for UCTP. Our results show that our algorithm can find higher quality solutions than can previous work.


pdf

You can download the pdf of this publication from here


doi

This publication does not have a doi, so we cannot provide a link to the original source

What is a doi?: A doi (Document Object Identifier) is a unique identifier for sicientific papers (and occasionally other material). This provides direct access to the location where the original article is published using the URL http://dx.doi/org/xxxx (replacing xxx with the doi). See http://dx.doi.org/ for more information



URL

This pubication does not have a URL associated with it.

The URL is only provided if there is additional information that might be useful. For example, where the entry is a book chapter, the URL might link to the book itself.


Bibtex

@INPROCEEDINGS{2009-157-179-P, author = {M. A. Al-Betar and A. T. Khader},
title = {A hybrid harmony search for university course timetabling},
booktitle = {Proceedings of the 4th Multidisciplinary International Scheduling Conference: Theory and Applications (MISTA 2009), 10-12 Aug 2009, Dublin, Ireland},
year = {2009},
editor = {J. Blazewicz and M. Drozdowski and G. Kendall and B. McCollum},
pages = {157--179},
note = {Paper},
abstract = {Combinations of metaheuristics to solve highly constrained combinatorial optimisation problems have recently become a promising research area. Some combinations emerge from integrating evolutionary algorithms and local based algorithms to strike the right balance between global exploration of the search region and local exploitation of promising regions. This study presents hybridization between harmony search algorithms and hill climbing optimisers to tackle the university course timetabling problem. The solution is essentially a harmony search algorithm. The hill climbing optimiser is responsible for improving the new harmony vector, obtained from harmony search, with a certain probability. Furthermore, inspired by the practical swarm optimisation, we modified the memory consideration operator to let it improvise rather than always working in the same way. Our algorithm converges significantly faster than does the classical harmony search algorithm. We evaluate our hybrid algorithm with a standard benchmark introduced for UCTP. Our results show that our algorithm can find higher quality solutions than can previous work.},
owner = {gxk},
timestamp = {2010.10.11},
webpdf = {2009-157-179-P.pdf} }