Paper Info
Title
Heuristic Factors in Ant System Algorithm for Course Timetabling Problem
Abstract
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.
Year
DOI
Venue
2009
10.1109/ISDA.2009.62
ISDA
Keywords
Field
DocType
ant system algorithm,graph characteristic,course timetable element,bipartite graph,heuristic factor,original ant system algorithm,course timetabling problem,negative pheromone,direct ant,dead end,proposed algorithm,heuristic factors,ant system,heuristic,optimization,algorithm design and analysis,schedules,data mining
Graph,Heuristic,Mathematical optimization,Algorithm design,Computer science,Bipartite graph,Algorithm,Schedule,Artificial intelligence,Timetabling problem,Machine learning
Conference
ISSN
Citations 
PageRank 
2164-7143
2
0.43
References 
Authors
5
2
Name
Order
Citations
PageRank
Djasli Djamarus130.84
Ku Ruhana Ku Mahamud2229.33