TY - GEN
T1 - Harmony Search-based Hyper-heuristic for examination timetabling
AU - Anwar, Khairul
AU - Khader, Ahamad Tajudin
AU - Al-Betar, Mohammed Azmi
AU - Awadallah, Mohammed A.
PY - 2013
Y1 - 2013
N2 - In this paper we proposed a Harmony Search-based Hyper-heuristic (HSHH) method for examination timetabling problems. The Harmony Search Algorithm (HSA) is a relatively new metaheuristic algorithm inspired by the musical improvisation process. The Hyper-heuristic is a new trend in optimization that uses a high level heuristic selected from a set of low-level heuristic methods. Examination timetabling is a combinatorial optimization problem which belongs to NP-hard class in almost all of its variations. In HSHH approach, the HSA will operate at a high level of abstraction which intelligently evolves a sequence of improvement low-level heuristics to use for examination timetabling problem. Each low-level heuristics represents a move and swap strategies. We test the proposed method using ITC-2007 benchmark datasets that has 12 de facto datasets of different complexity and size. The proposed method produced competitively comparable results.
AB - In this paper we proposed a Harmony Search-based Hyper-heuristic (HSHH) method for examination timetabling problems. The Harmony Search Algorithm (HSA) is a relatively new metaheuristic algorithm inspired by the musical improvisation process. The Hyper-heuristic is a new trend in optimization that uses a high level heuristic selected from a set of low-level heuristic methods. Examination timetabling is a combinatorial optimization problem which belongs to NP-hard class in almost all of its variations. In HSHH approach, the HSA will operate at a high level of abstraction which intelligently evolves a sequence of improvement low-level heuristics to use for examination timetabling problem. Each low-level heuristics represents a move and swap strategies. We test the proposed method using ITC-2007 benchmark datasets that has 12 de facto datasets of different complexity and size. The proposed method produced competitively comparable results.
KW - Examination Timetabling Problems
KW - Harmony Search Algorithm
KW - Hyper-heuristic methods
UR - https://www.scopus.com/pages/publications/84881058658
U2 - 10.1109/CSPA.2013.6530037
DO - 10.1109/CSPA.2013.6530037
M3 - Conference contribution
AN - SCOPUS:84881058658
SN - 9781467356091
T3 - Proceedings - 2013 IEEE 9th International Colloquium on Signal Processing and its Applications, CSPA 2013
SP - 176
EP - 181
BT - Proceedings - 2013 IEEE 9th International Colloquium on Signal Processing and its Applications, CSPA 2013
T2 - 2013 IEEE 9th International Colloquium on Signal Processing and its Applications, CSPA 2013
Y2 - 8 March 2013 through 10 March 2013
ER -