Heuristic factors in ant system algorithm for course timetabling problem
This paper presents an algorithm that is based on ant system to solve the course timetabling problem.The problem is modeled using the bipartite graph.Four heuristic factors are derived from the graph characteristic, are used to direct ants as the agent in finding course timetable elements The concep...
Saved in:
Main Authors: | , |
---|---|
Format: | Conference or Workshop Item |
Published: |
2009
|
Subjects: | |
Online Access: | http://repo.uum.edu.my/9243/ http://dx.doi.org/10.1109/ISDA.2009.62 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.uum.repo.9243 |
---|---|
record_format |
eprints |
spelling |
my.uum.repo.92432013-10-27T06:01:00Z http://repo.uum.edu.my/9243/ Heuristic factors in ant system algorithm for course timetabling problem Djamarus, Djasli Ku-Mahamud, Ku Ruhana QA75 Electronic computers. Computer science This paper presents an algorithm that is based on ant system to solve the course timetabling problem.The problem is modeled using the bipartite graph.Four heuristic factors are derived from the graph characteristic, are used to direct ants as the agent in finding course timetable elements The concept of negative pheromone was also applied to ensure that paths leading to dead ends are not chosen.The performance of this proposed algorithm is promising when comparison of performance was made with the original ant system algorithm. 2009 Conference or Workshop Item PeerReviewed Djamarus, Djasli and Ku-Mahamud, Ku Ruhana (2009) Heuristic factors in ant system algorithm for course timetabling problem. In: Ninth International Conference on Intelligent Systems Design and Applications 2009 (ISDA '09), November 30 2009 - December 02 2009, Pisa, Italy . http://dx.doi.org/10.1109/ISDA.2009.62 doi:10.1109/ISDA.2009.62 |
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/ |
topic |
QA75 Electronic computers. Computer science |
spellingShingle |
QA75 Electronic computers. Computer science Djamarus, Djasli Ku-Mahamud, Ku Ruhana Heuristic factors in ant system algorithm for course timetabling problem |
description |
This paper presents an algorithm that is based on ant system to solve the course timetabling problem.The problem is modeled using the bipartite graph.Four heuristic factors are derived from the graph characteristic, are used to direct ants as the agent in finding course timetable elements The concept of negative pheromone was also applied to ensure that paths leading to dead ends are not chosen.The performance of this proposed algorithm is promising when comparison of performance was made with the original ant system algorithm.
|
format |
Conference or Workshop Item |
author |
Djamarus, Djasli Ku-Mahamud, Ku Ruhana |
author_facet |
Djamarus, Djasli Ku-Mahamud, Ku Ruhana |
author_sort |
Djamarus, Djasli |
title |
Heuristic factors in ant system algorithm for course timetabling problem |
title_short |
Heuristic factors in ant system algorithm for course timetabling problem |
title_full |
Heuristic factors in ant system algorithm for course timetabling problem |
title_fullStr |
Heuristic factors in ant system algorithm for course timetabling problem |
title_full_unstemmed |
Heuristic factors in ant system algorithm for course timetabling problem |
title_sort |
heuristic factors in ant system algorithm for course timetabling problem |
publishDate |
2009 |
url |
http://repo.uum.edu.my/9243/ http://dx.doi.org/10.1109/ISDA.2009.62 |
_version_ |
1644280055439818752 |
score |
13.18916 |