Quantcast

Comparison of metaheuristic algorithms for Examination Timetabling Problem

Research paper by Zahra Naji Azimi

Indexed on: 01 Mar '04Published on: 01 Mar '04Published in: Journal of Applied Mathematics and Computing



Abstract

SA, TS, GA and ACS are four of the main algorithms for solving challenging problems of intelligent systems. In this paper we consider Examination Timetabling Problem that is a common problem for all universities and institutions of higher education. There are many methods to solve this problem, In this paper we use Simulated Annealing, Tabu Search, Genetic Algorithm and Ant Colony System in their basic frameworks for solving this problem and compare results of them with each other.