Wahid, Juliana and Mohd Hussin, Naimah (2012) Harmony annealing algorithm for curriculum-based course timetabling problem. In: 2012 International Conference on Computer & Information Science (ICCIS), 12-14 June 2012, Kuala Lumpur, Convention Centre.

PDF Restricted to Repository staff only Download (237kB)

Abstract

This research article presents the adaption of the harmony annealing algorithm for solving timetabling problems, with particular focus on the curriculum-based course timetabling that formed part of the competition track 3 of the 2nd International Timetabling Competition in 2007 (ITC-2007). An attempt to solve these problems was made via an approach broken down into two parts; first, constructive algorithm with saturation degree approach was used to ensure a feasible solution, where the hard constraints are satisfied.Secondly, Harmony annealing algorithm was used to further improve the results obtained.The algorithm produced results that were not comparatively better than those previously known as best solution.With proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.

Item Type:	Conference or Workshop Item (Paper)
Additional Information:	ISBN 978-1-4673-1936-2 (vol 1)
Subjects:	Q Science > QA Mathematics > QA76 Computer software
Divisions:	College of Arts and Sciences
Depositing User:	Mrs. Juliana Wahid
Date Deposited:	31 Dec 2012 01:24
Last Modified:	31 Dec 2012 01:24
URI:	https://repo.uum.edu.my/id/eprint/6719

Actions (login required)

View Item