Harmony search algorithm for curriculum-based course timetabling problem
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...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
2013
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/12518/1/vol3.no3.55.pdf http://repo.uum.edu.my/12518/ http://www.jscse.com/papers/?vol=3&no=3&n=55 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.uum.repo.12518 |
---|---|
record_format |
eprints |
spelling |
my.uum.repo.125182014-11-03T04:45:51Z http://repo.uum.edu.my/12518/ Harmony search algorithm for curriculum-based course timetabling problem Wahid, Juliana Mohd Hussin, Naimah QA76 Computer software 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.However, 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. 2013-03 Article PeerReviewed application/pdf en http://repo.uum.edu.my/12518/1/vol3.no3.55.pdf Wahid, Juliana and Mohd Hussin, Naimah (2013) Harmony search algorithm for curriculum-based course timetabling problem. The International Journal of Soft Computing and Software Engineering [JSCSE], 3 (3). pp. 365-371. ISSN 251 - 7545 http://www.jscse.com/papers/?vol=3&no=3&n=55 |
institution |
Universiti Utara Malaysia |
building |
UUM Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Utara Malaysia |
content_source |
UUM Institutionali Repository |
url_provider |
http://repo.uum.edu.my/ |
language |
English |
topic |
QA76 Computer software |
spellingShingle |
QA76 Computer software Wahid, Juliana Mohd Hussin, Naimah Harmony search algorithm for curriculum-based course timetabling problem |
description |
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.However, 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. |
format |
Article |
author |
Wahid, Juliana Mohd Hussin, Naimah |
author_facet |
Wahid, Juliana Mohd Hussin, Naimah |
author_sort |
Wahid, Juliana |
title |
Harmony search algorithm for curriculum-based course timetabling problem |
title_short |
Harmony search algorithm for curriculum-based course timetabling problem |
title_full |
Harmony search algorithm for curriculum-based course timetabling problem |
title_fullStr |
Harmony search algorithm for curriculum-based course timetabling problem |
title_full_unstemmed |
Harmony search algorithm for curriculum-based course timetabling problem |
title_sort |
harmony search algorithm for curriculum-based course timetabling problem |
publishDate |
2013 |
url |
http://repo.uum.edu.my/12518/1/vol3.no3.55.pdf http://repo.uum.edu.my/12518/ http://www.jscse.com/papers/?vol=3&no=3&n=55 |
_version_ |
1644280933045501952 |
score |
13.18916 |