Dissemin is shutting down on January 1st, 2025

Published in

Elsevier, European Journal of Operational Research, 3(216), p. 533-543

DOI: 10.1016/j.ejor.2011.08.006

Links

Tools

Export citation

Search in Google Scholar

A Honey-bee Mating Optimization Algorithm for Educational Timetabling Problems

Journal article published in 2012 by Nasser R. Sabar, Masri Ayob, Graham Kendall, Rong Qu ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Orange circle
Postprint: archiving restricted
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

In this work, we propose a variant of the Honey-bee Mating Optimization Algorithm for solving educational timetabling problems. The honey-bee algorithm is a nature inspired algorithm which simulates the process of real honey-bees mating. The performance of the proposed algorithm is tested over two benchmark problems; exam (Carter’s un-capacitated datasets) and course (Socha datasets) timetabling problems. We chose these two datasets as they have been widely studied in the literature and we would also like to evaluate our algorithm across two different, yet related, domains. Results demonstrate that the performance of the honey-bee mating optimization algorithm is comparable with the results of other approaches in the scientific literature. Indeed, the proposed approach obtains best results compared with other approaches on some instances, indicating that the honey-bee mating optimization algorithm is a promising approach in solving educational timetabling problems.