Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…In this paper, harmony search algorithm is applied to curriculum-based course timetabling.The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment.In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory.This research used the highest occurrence of the course number to be scheduled in a new harmony.The remaining courses that have not been scheduled by memory consideration will go through random consideration, i.e. will select any feasible location available to be scheduled in the new harmony solution. …”
Get full text

Harmony annealing algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…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). …”
Get full text

Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…In this paper, harmony search algorithm is applied to curriculum-based course timetabling.The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment.In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory.This research used the highest occurrence of the course number to be scheduled in a new harmony.The remaining courses that have not been scheduled by memory consideration will go through random consideration, i.e. will select any feasible location available to be scheduled in the new harmony solution.Each course scheduled out of memory consideration is examined as to whether it should be pitch adjusted with probability of eight procedures. …”
Get full text

Harmony great deluge for solving curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…University course timetabling which has been determined as non deterministic polynomial problem that accept widely as problem that are intractable.An efficient algorithm does not exist that is guaranteed to find an optimal solution for such problems.The design of good algorithm to find new methods and techniques to solve such problem is a very active area of research.This paper presents the adaption of the hybridizing between harmony search with great deluge algorithm for solving curriculum-based course timetabling problems.The algorithm can be adapted to the problem.Results were not comparatively better than those previously known as best solution.Proper modification in terms of the approach in this algorithm would make the algorithm perform better on curriculum-based course timetabling.…”
Get full text

Hybrid harmony search with great deluge for UUM CAS curriculum based course timetabling by Wahid, Juliana, Mohd Hussin, Naimah

“…In this paper, a hybridization of harmony search with a great deluge is proposed to optimize the soft constraints.Harmony search comprised of two main operators such as memory consideration and random consideration operator.The great deluge was applied on the random consideration operator. …”
Get full text

Implementing Kempe chain neighborhood structure in harmony search for solving curriculum based course timetabling by Wahid, Juliana, Mohd Hussin, Naimah

“…The aim of this paper is to implement Kempe chain neighborhood structure together with the other neighborhood structures in harmony search algorithm for solving curriculum-based course timetabling. …”
Get full text

Solving curriculum based course timetabling by hybridizing local search based method within harmony search algorithm by Wahid, Juliana, Mohd Hussin, Naimah

“…Secondly, the soft constraints were fulfilled as much as possible.In this paper we focused to satisfy the soft constraints using a hybridization of harmony search with a great deluge.Harmony search comprised of two main operators such as memory consideration and random consideration operator. …”
Get full text

Hybridizing harmony search with local search based metaheuristic for solving curriculum based university course timetabling / Juliana Wahid by Wahid, Juliana

“…Harmony search algorithm (HSA) is a population-based metaheuristic optimization algorithm that imitates the music improvisation process where musicians improvise their instruments’ pitch by searching for a perfect state of harmony. …”
Get full text

Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…This process is a crucial task because it can affect the convergence speed and also the quality of the final solution (Rahnamayan, Tizhoosh, & Salama, 2007).This study able to produce a set of initial solution, therefore it is able to contribute to the improvement phase of approach that uses population of initial solutions such as ant colony optimization (ACO) (Socha, Joshua, & Michael, 2002), genetic algorithm (GA) (Lewis & Paechter, 2005), and harmony search algorithm (HSA) (Al-Betar & Khader, 2010).The approach in this study also shows that a feasible timetable can be found for numerous data set problems.…”
Get full text