Comparing genetic ant system algorithm in course timetabling problem ( hal 56 - 61)
Proceedings ICSIIT 2010: International conference on soft computing intelligent system and information technology 1-2 July 2010 Bali Indonesia
Ant system algorithm, course timetabling problem, genetic algorithm, meta-heuristic
Lokasi : Perpustakaan Fakultas Ilmu Komputer
SEM - 362
Tidak ada review pada koleksi ini: 47832
this paper models the course tmebling problem as a set of tuples each of which consists of four entities , i.e. lecturers, courses roooms and time- slots that have to be matched in order to construct yhe preferences and their expratie as the constraint of the problem. a bipartite graph that conects the four entities is used as the path of ant movement. in this expriment two metaheuristics algorithm, genetic and ant system algorithm is applied to the problem, and the seults ar compared.