Header menu link for other important links
The effect of neighborhood structures on examination timetabling with artificial bee colony
A.L. Bolaji, A.T. Khader, , M.A. Awadallah, J.J. Thomas
Published in SINTEF
Pages: 131 - 144
Artificial Bee Colony (ABC) algorithm is among the most effective nature-inspired algorithms for solving the combinatorial optimization problems. In this paper, ABC is adopted for university examination timetabling problems (UETP) using a defacto dataset established by Carter et al. (1996). ABC has three main operators that drive the search toward the global minima: employed bee, onlooker bee, and scout. For UETP, the employed bee and onlooker bee operators are manipulated to be workable where three neighborhood structures are employed: move, swap and Kempe chain. The effect of these neighborhood structures on the behaviour of ABC for UETP is studied and analyzed in this paper. The experimental design is intentionally made with various convergence cases of different neighborhood structure. The result suggests that the ABC combined with the three neighborhood structures is an effective method for UETP. Comparative evaluation with previous methods is also provided. The results produced by the proposed method are competitive in comparison with state of the art methods. Theoretically, this study contributes to the examination timetabling community through an ABC template which is both efficient and flexible for UETP. © PATAT 2012.
About the journal
JournalPATAT 2012 - Proceedings of the 9th International Conference on the Practice and Theory of Automated Timetabling