View article

Artificial bee colony is a population-based search algorithm that mimics a natural behavior of real honey bees to find rich food sources to obtain maximum quantity of nectar and share the information of food sources with other bees in the hive. This paper concerns primarily about how to use artificial bee colony to solve examination timetabling problems which it is known as a NP-hard problem. It deals with assigning exams to a limited number of timeslots while satisfying a set of constraints. This algorithm works based on three categories of bees, that is, employed, onlooker and scout bees that communicate with each other in sharing the information of the food sources. Our computational experiments indicate that the proposed approach produces promising results when tested on two set of instances that have been widely used in literature.