TY  - JOUR
T1  - Enhancing Max-Min Ant System for Examination Timetabling Problem
AU - , F. Djannaty AU - , A.R. Mirzaei 
JO  - International Journal of Soft Computing
VL  - 3
IS  - 3
SP  - 230
EP  - 238
PY  - 2008
DA  - 2001/08/19
SN  - 1816-9503
DO  - ijscomp.2008.230.238
UR  - https://makhillpublications.co/view-article.php?doi=ijscomp.2008.230.238
KW  - Ant colony optimization
KW  -examination timetabling
KW  -great deluge algorithm
KW  -local search
KW  -preprocessing
AB  - Examination Timetabling Problem (ETP) is a real life problem encountered in many academic institutions and has attracted the attention of the Operational Research and Artificial Intelligence research communities since the 1960s. In this study, a variant of Ant Colony Optimization (ACO), the Max-Min Ant System (MMAS) is used to solve the Examination timetabling problem. The key feature of our approach is the combination of a simple local search and MMAS. A preprocessing heuristic is utilized to initially sort the exams. Great Deluge algorithm is used as a local search to improve the constructed solutions by MMAS. We applied our algorithm to a number of test problem data sets. The numerical results obtained from our method shows that the quality of the solutions are better than some or tie the best-published results from the literature, especially on capacitated examination timetabling problem.
ER  -