A harmony search algorithm for university course timetabli

Al-Betar, Mohammed Azmi and Khader, Ahamad Tajudin (2012) A harmony search algorithm for university course timetabli. Annals of Operations Research, 194 (3). p. 31. ISSN 0254-5330

Download (1MB) | Preview


One of the main challenges for university administration is building a timetable for course sessions. This is not just about building a timetable that works, but building one that is as good as possible. In general, course timetabling is the process of assigning given courses to given rooms and timeslots under specific constraints. Harmony search algorithm is a new metaheuristic population-based algorithm, mimicking the musical improvisation process where a group of musicians play the pitches of their musical instruments together seeking a pleasing harmony. The major thrust of this algorithm lies in its ability to integrate the key components of population-based methods and local search-based methods in a simple optimization model. In this paper, a harmony search and a modified harmony search algorithm are applied to university course timetabling against standard benchmarks. The results show that the proposed methods are capable of providing viable solutions in comparison to previous works.

Item Type: Article
Uncontrolled Keywords: Course timetabling · Harmony search · Metaheuristic algorithms · Exploration · Exploitation
Subjects: Q Science > QA Mathematics > QA76.73. Computer algorithms and Data structures
Divisions: Pusat Pengajian Sains Komputer (School of Computer Sciences) > Article
Zoom Profil Pakar (Expert Profile) > Ahamad Tajudin Khader (Computer Sciences)
Depositing User: Administrator Automasi
Date Deposited: 18 Apr 2019 02:38
Last Modified: 18 Apr 2019 02:38
URI: http://eprints.usm.my/id/eprint/44124

Actions (login required)

View Item View Item