A hybrid self-adaptive bees algorithm for examination timetabling problems

Salwani Abdullah, Malek Alzaqebah

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

A hybrid self-adaptive bees algorithm is proposed for the examination timetabling problems. The bees algorithm (BA) is a population-based algorithm inspired by the way that honey bees forage for food. The algorithm presents a type of neighbourhood search that includes a random search that can be used for optimisation problems. In the BA, the bees search randomly for food sites and return back to the hive carrying the information about the food sites (fitness values); then, other bees will select the sites based on their information (more bees are recruited to the best sites) and will start a random search. We propose three techniques (i.e. disruptive, tournament and rank selection strategies) for selecting the sites, rather than using the fitness value, to improve the diversity of the population. Additionally, a self-adaptive strategy for directing the neighbourhood search is added to further enhance the local intensification capability. Finally, a modified bees algorithm is combined with a local search (i.e. simulated annealing, late acceptance hill climbing) to quickly descend to the optimum solution. Experimental results comparing our proposed modifications with each other and with the basic BA show that all of the modifications outperform the basic BA; an overall comparison has been made with the best known results on two examination timetabling benchmark datasets, which shows that our approach is competitive and works well across all of the problem instances.

Original languageEnglish
Pages (from-to)3608-3620
Number of pages13
JournalApplied Soft Computing Journal
Volume13
Issue number8
DOIs
Publication statusPublished - 2013

Fingerprint

Adaptive algorithms
Simulated annealing

Keywords

  • Bees algorithm
  • Examination timetabling problems
  • Late acceptance hill climbing algorithm
  • Selection strategy
  • Self-adaptive mechanism
  • Simulated annealing algorithm

ASJC Scopus subject areas

  • Software

Cite this

A hybrid self-adaptive bees algorithm for examination timetabling problems. / Abdullah, Salwani; Alzaqebah, Malek.

In: Applied Soft Computing Journal, Vol. 13, No. 8, 2013, p. 3608-3620.

Research output: Contribution to journalArticle

@article{191b2791b74f49b09a00b4af6606244b,
title = "A hybrid self-adaptive bees algorithm for examination timetabling problems",
abstract = "A hybrid self-adaptive bees algorithm is proposed for the examination timetabling problems. The bees algorithm (BA) is a population-based algorithm inspired by the way that honey bees forage for food. The algorithm presents a type of neighbourhood search that includes a random search that can be used for optimisation problems. In the BA, the bees search randomly for food sites and return back to the hive carrying the information about the food sites (fitness values); then, other bees will select the sites based on their information (more bees are recruited to the best sites) and will start a random search. We propose three techniques (i.e. disruptive, tournament and rank selection strategies) for selecting the sites, rather than using the fitness value, to improve the diversity of the population. Additionally, a self-adaptive strategy for directing the neighbourhood search is added to further enhance the local intensification capability. Finally, a modified bees algorithm is combined with a local search (i.e. simulated annealing, late acceptance hill climbing) to quickly descend to the optimum solution. Experimental results comparing our proposed modifications with each other and with the basic BA show that all of the modifications outperform the basic BA; an overall comparison has been made with the best known results on two examination timetabling benchmark datasets, which shows that our approach is competitive and works well across all of the problem instances.",
keywords = "Bees algorithm, Examination timetabling problems, Late acceptance hill climbing algorithm, Selection strategy, Self-adaptive mechanism, Simulated annealing algorithm",
author = "Salwani Abdullah and Malek Alzaqebah",
year = "2013",
doi = "10.1016/j.asoc.2013.04.010",
language = "English",
volume = "13",
pages = "3608--3620",
journal = "Applied Soft Computing",
issn = "1568-4946",
publisher = "Elsevier BV",
number = "8",

}

TY - JOUR

T1 - A hybrid self-adaptive bees algorithm for examination timetabling problems

AU - Abdullah, Salwani

AU - Alzaqebah, Malek

PY - 2013

Y1 - 2013

N2 - A hybrid self-adaptive bees algorithm is proposed for the examination timetabling problems. The bees algorithm (BA) is a population-based algorithm inspired by the way that honey bees forage for food. The algorithm presents a type of neighbourhood search that includes a random search that can be used for optimisation problems. In the BA, the bees search randomly for food sites and return back to the hive carrying the information about the food sites (fitness values); then, other bees will select the sites based on their information (more bees are recruited to the best sites) and will start a random search. We propose three techniques (i.e. disruptive, tournament and rank selection strategies) for selecting the sites, rather than using the fitness value, to improve the diversity of the population. Additionally, a self-adaptive strategy for directing the neighbourhood search is added to further enhance the local intensification capability. Finally, a modified bees algorithm is combined with a local search (i.e. simulated annealing, late acceptance hill climbing) to quickly descend to the optimum solution. Experimental results comparing our proposed modifications with each other and with the basic BA show that all of the modifications outperform the basic BA; an overall comparison has been made with the best known results on two examination timetabling benchmark datasets, which shows that our approach is competitive and works well across all of the problem instances.

AB - A hybrid self-adaptive bees algorithm is proposed for the examination timetabling problems. The bees algorithm (BA) is a population-based algorithm inspired by the way that honey bees forage for food. The algorithm presents a type of neighbourhood search that includes a random search that can be used for optimisation problems. In the BA, the bees search randomly for food sites and return back to the hive carrying the information about the food sites (fitness values); then, other bees will select the sites based on their information (more bees are recruited to the best sites) and will start a random search. We propose three techniques (i.e. disruptive, tournament and rank selection strategies) for selecting the sites, rather than using the fitness value, to improve the diversity of the population. Additionally, a self-adaptive strategy for directing the neighbourhood search is added to further enhance the local intensification capability. Finally, a modified bees algorithm is combined with a local search (i.e. simulated annealing, late acceptance hill climbing) to quickly descend to the optimum solution. Experimental results comparing our proposed modifications with each other and with the basic BA show that all of the modifications outperform the basic BA; an overall comparison has been made with the best known results on two examination timetabling benchmark datasets, which shows that our approach is competitive and works well across all of the problem instances.

KW - Bees algorithm

KW - Examination timetabling problems

KW - Late acceptance hill climbing algorithm

KW - Selection strategy

KW - Self-adaptive mechanism

KW - Simulated annealing algorithm

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

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

U2 - 10.1016/j.asoc.2013.04.010

DO - 10.1016/j.asoc.2013.04.010

M3 - Article

VL - 13

SP - 3608

EP - 3620

JO - Applied Soft Computing

JF - Applied Soft Computing

SN - 1568-4946

IS - 8

ER -