期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2011
卷号：11
期号：11
页码：116-123
出版社：International Journal of Computer Science and Network Security
摘要：In this study, we apply our Elitist-Ant System, Big Bang-Big Crunch and Scatter Search heuristics to solve two post-enrolment course timetabling problems (first and second international timetabling competitions) and to compare their performance and consistency. The approaches mainly focus on employing the elite pool and solution combination strategies. Both strategies provide deterministic search guidance by maintaining a balance between diversity and quality of the population. This is achieved by a dynamic changing of the population size and, the utilization of elite solutions and a probabilistic selection procedure in generating good quality and diversity solutions. Experimental results showed that our hybrid approaches produce good quality solutions, and outperforms some best known results reported in the literature including population-based algorithms. In term of solutions�� quality, the Scatter Search ranked first and followed closely by the Elitist-Ant System and Big Bang-Big Crunch heuristics.
