Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems

Malek Alzaqebah, Salwani Abdullah

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

Abstract

Artificial Bee Colony (ABC) is a population-based algorithm that employed the natural metaphors, based on foraging behavior of honey bee swarm. In ABC algorithm, there are three categories of bees. Employed bees select a random solution and apply a random neighborhood structure (exploration process), onlooker bees choose a food source depending on a selection strategy (exploitation process), and scout bees involves to search for new food sources (scouting process). In this paper, firstly we introduce a disruptive selection strategy for onlooker bees, to improve the diversity of the population and the premature convergence, and also a local search (i.e. simulated annealing) is introduced, in order to attain a balance between exploration and exploitation processes. Furthermore, a self adaptive strategy for selecting neighborhood structures is added to further enhance the local intensification capability. Experimental results show that the hybrid ABC with disruptive selection strategy outperforms the ABC algorithm alone when tested on examination timetabling problems.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages31-45
Number of pages15
Volume6831 LNCS
DOIs
Publication statusPublished - 2011
Event5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011 - Zhangjiajie
Duration: 4 Aug 20116 Aug 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6831 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011
CityZhangjiajie
Period4/8/116/8/11

Fingerprint

Timetabling
Search Algorithm
Exploitation
Simulated annealing
Adaptive Strategies
Premature Convergence
Foraging
Swarm
Simulated Annealing
Local Search
Choose
Experimental Results
Strategy

Keywords

  • Artificial Bee Colony
  • Disruptive Selection
  • Examination Timetabling Problems
  • Simulated Annealing

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Alzaqebah, M., & Abdullah, S. (2011). Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6831 LNCS, pp. 31-45). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6831 LNCS). https://doi.org/10.1007/978-3-642-22616-8_3

Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems. / Alzaqebah, Malek; Abdullah, Salwani.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6831 LNCS 2011. p. 31-45 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 6831 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Alzaqebah, M & Abdullah, S 2011, Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 6831 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 6831 LNCS, pp. 31-45, 5th Annual International Conference on Combinatorial Optimization and Applications, COCOA 2011, Zhangjiajie, 4/8/11. https://doi.org/10.1007/978-3-642-22616-8_3
Alzaqebah M, Abdullah S. Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6831 LNCS. 2011. p. 31-45. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-22616-8_3
Alzaqebah, Malek ; Abdullah, Salwani. / Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 6831 LNCS 2011. pp. 31-45 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{b1cbc2cb49b44adcb432fec64428cc48,
title = "Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems",
abstract = "Artificial Bee Colony (ABC) is a population-based algorithm that employed the natural metaphors, based on foraging behavior of honey bee swarm. In ABC algorithm, there are three categories of bees. Employed bees select a random solution and apply a random neighborhood structure (exploration process), onlooker bees choose a food source depending on a selection strategy (exploitation process), and scout bees involves to search for new food sources (scouting process). In this paper, firstly we introduce a disruptive selection strategy for onlooker bees, to improve the diversity of the population and the premature convergence, and also a local search (i.e. simulated annealing) is introduced, in order to attain a balance between exploration and exploitation processes. Furthermore, a self adaptive strategy for selecting neighborhood structures is added to further enhance the local intensification capability. Experimental results show that the hybrid ABC with disruptive selection strategy outperforms the ABC algorithm alone when tested on examination timetabling problems.",
keywords = "Artificial Bee Colony, Disruptive Selection, Examination Timetabling Problems, Simulated Annealing",
author = "Malek Alzaqebah and Salwani Abdullah",
year = "2011",
doi = "10.1007/978-3-642-22616-8_3",
language = "English",
isbn = "9783642226151",
volume = "6831 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "31--45",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Hybrid artificial bee colony search algorithm based on disruptive selection for examination timetabling problems

AU - Alzaqebah, Malek

AU - Abdullah, Salwani

PY - 2011

Y1 - 2011

N2 - Artificial Bee Colony (ABC) is a population-based algorithm that employed the natural metaphors, based on foraging behavior of honey bee swarm. In ABC algorithm, there are three categories of bees. Employed bees select a random solution and apply a random neighborhood structure (exploration process), onlooker bees choose a food source depending on a selection strategy (exploitation process), and scout bees involves to search for new food sources (scouting process). In this paper, firstly we introduce a disruptive selection strategy for onlooker bees, to improve the diversity of the population and the premature convergence, and also a local search (i.e. simulated annealing) is introduced, in order to attain a balance between exploration and exploitation processes. Furthermore, a self adaptive strategy for selecting neighborhood structures is added to further enhance the local intensification capability. Experimental results show that the hybrid ABC with disruptive selection strategy outperforms the ABC algorithm alone when tested on examination timetabling problems.

AB - Artificial Bee Colony (ABC) is a population-based algorithm that employed the natural metaphors, based on foraging behavior of honey bee swarm. In ABC algorithm, there are three categories of bees. Employed bees select a random solution and apply a random neighborhood structure (exploration process), onlooker bees choose a food source depending on a selection strategy (exploitation process), and scout bees involves to search for new food sources (scouting process). In this paper, firstly we introduce a disruptive selection strategy for onlooker bees, to improve the diversity of the population and the premature convergence, and also a local search (i.e. simulated annealing) is introduced, in order to attain a balance between exploration and exploitation processes. Furthermore, a self adaptive strategy for selecting neighborhood structures is added to further enhance the local intensification capability. Experimental results show that the hybrid ABC with disruptive selection strategy outperforms the ABC algorithm alone when tested on examination timetabling problems.

KW - Artificial Bee Colony

KW - Disruptive Selection

KW - Examination Timetabling Problems

KW - Simulated Annealing

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

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

U2 - 10.1007/978-3-642-22616-8_3

DO - 10.1007/978-3-642-22616-8_3

M3 - Conference contribution

AN - SCOPUS:80052001403

SN - 9783642226151

VL - 6831 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 31

EP - 45

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -