Paper Info
Title
Hybrid heuristics for Examination Timetabling problem
Abstract
Simulated Annealing (SA), Tabu Search (TS), Genetic Algorithm (GA), and Ant Colony System (ACS) are four of the main algorithms for solving challenging problems of intelligent systems. In this paper, we apply these four techniques and three novel hybrid combinations of them to a classical Examination Timetabling problem (ETP), an NP complete problem. The novel hybrid algorithms consist of a Sequential TS-ACS, a Hybrid ACS/TS, and a Sequential ACS-TS algorithms. These various hybrid combinations are then tested on 10 different scenarios of the classical ETP. Statistical comparative analysis conclude that all of the three proposed novel techniques are significantly better than each of their non-hybrid competitors, and furthermore the Sequential ACS-TS provides the superior solution of all.
Year
DOI
Venue
2005
10.1016/j.amc.2003.10.061
Applied Mathematics and Computation
Keywords
Field
DocType
hybrid methods,timetabling,tabu search,ant colony system,genetic algorithm,simulated annealing,hybrid algorithm,np complete problem,comparative analysis
Simulated annealing,Mathematical optimization,Search algorithm,Intelligent decision support system,Algorithm,Heuristics,Timetabling problem,Ant colony,Tabu search,Genetic algorithm,Mathematics
Journal
Volume
Issue
ISSN
163
2
Applied Mathematics and Computation
Citations 
PageRank 
References 
23
0.87
12
Authors
1
Name
Order
Citations
PageRank
Zahra Naji Azimi11367.51