Artificial bee colony search algorithm for examination timetabling problems

Malek Alzaqebah, Salwani Abdullah

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)4264-4272
Number of pages9
JournalInternational Journal of Physical Sciences
Volume6
Issue number17
Publication statusPublished - 2 Sep 2011

Fingerprint

bees
examination
food
Plant Nectar
Computational complexity
Experiments

Keywords

  • Artificial bee colony
  • Examination timetabling
  • Honeybees algorithms
  • Metaheuristics

ASJC Scopus subject areas

  • Physics and Astronomy(all)
  • Electronic, Optical and Magnetic Materials

Cite this

Artificial bee colony search algorithm for examination timetabling problems. / Alzaqebah, Malek; Abdullah, Salwani.

In: International Journal of Physical Sciences, Vol. 6, No. 17, 02.09.2011, p. 4264-4272.

Research output: Contribution to journalArticle

@article{ccff9ce40e7e4a6380e3b6dc4f9c6c02,
title = "Artificial bee colony search algorithm for examination timetabling problems",
abstract = "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.",
keywords = "Artificial bee colony, Examination timetabling, Honeybees algorithms, Metaheuristics",
author = "Malek Alzaqebah and Salwani Abdullah",
year = "2011",
month = "9",
day = "2",
language = "English",
volume = "6",
pages = "4264--4272",
journal = "International Journal of Physical Sciences",
issn = "1992-1950",
publisher = "Academic Journals",
number = "17",

}

TY - JOUR

T1 - Artificial bee colony search algorithm for examination timetabling problems

AU - Alzaqebah, Malek

AU - Abdullah, Salwani

PY - 2011/9/2

Y1 - 2011/9/2

N2 - 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.

AB - 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.

KW - Artificial bee colony

KW - Examination timetabling

KW - Honeybees algorithms

KW - Metaheuristics

UR - http://www.scopus.com/inward/record.url?scp=80052995167&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80052995167&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:80052995167

VL - 6

SP - 4264

EP - 4272

JO - International Journal of Physical Sciences

JF - International Journal of Physical Sciences

SN - 1992-1950

IS - 17

ER -