View Article |
Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics
Juliana Wahid1, Naimah Mohd Hussin2.
The construction of population of initial solution is a
crucial task in population-based metaheuristic approach for
solving curriculum-based university course timetabling problem
because it can affect the convergence speed and also the quality
of the final solution. This paper presents an exploration on
combination of graph heuristics in construction approach in
curriculum based course timetabling problem to produce a
population of initial solutions. The graph heuristics were set as
single and combination of two heuristics. In addition, several
ways of assigning courses into room and timeslot are
implemented. All settings of heuristics are then tested on the
same curriculum based course timetabling problem instances and
are compared with each other in terms of number of population
produced. The result shows that combination of largest degree
followed by saturation degree heuristic produce the highest
number of population of initial solutions. The results from this
study can be used in the improvement phase of algorithm that
uses population of initial solutions.
Affiliation:
- Universiti Utara Malaysia, Malaysia
- Universiti Teknologi MARA, Malaysia
Download this article (This article has been downloaded 77 time(s))
|
|
Indexation |
Indexed by |
MyJurnal (2019) |
H-Index
|
0 |
Immediacy Index
|
0.000 |
Rank |
0 |
Indexed by |
Scopus (SCImago Journal Rankings 2016) |
Impact Factor
|
0 |
Rank |
Q4 (Computer Networks and Communications) Q4 (Electrical and Electronic Engineering) Q4 (Hardware and Architecture) |
Additional Information |
0.112 (SJR) |
|
|
|