Patch-Levy-based initialization algorithm for Bees Algorithm

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

The Bees Algorithm (BA) is a population-based metaheuristic algorithm inspired by the foraging behavior of honeybees. This algorithm has been successfully used as an optimization tool in combinatorial and functional optimization fields. In addition, its behavior very closely mimics the actual behavior that occurs in nature, and it is very simple and easy to implement. However, its convergence speed to the optimal solution still needs further improvement and it also needs a mechanism to obviate getting trapped in local optima. In this paper, a novel initialization algorithm based on the patch concept and Levy flight distribution is proposed to initialize the population of bees in BA. Consequently, we incorporate this initialization procedure into a proposed enhanced BA variant. The proposed variant is more natural than conventional variants of BA. It mimics the patch environment in nature and Levy flight, which is believed to characterize the foraging patterns of bees in nature. The results of experiments conducted on several widely used high-dimensional benchmarks indicate that our proposed enhanced BA variant significantly outperforms other BA variants and state-of-the-art variants of the Artificial Bee Colony (ABC) algorithm in terms of solution quality, convergence speed, and success rate. In addition, the results of experimental analyses conducted indicate that our proposed enhanced BA is very stable, has the ability to deal with differences in search ranges, and rapidly converges without getting stuck in local optima.

Original languageEnglish
Pages (from-to)104-121
Number of pages18
JournalApplied Soft Computing Journal
Volume23
DOIs
Publication statusPublished - 2014

Fingerprint

Experiments

Keywords

  • Bees Algorithm
  • Levy flight
  • Metaheuristic algorithm
  • Patch environment
  • Population initialization

ASJC Scopus subject areas

  • Software

Cite this

Patch-Levy-based initialization algorithm for Bees Algorithm. / Hussein, Wasim A.; Sahran, Shahnorbanun; Sheikh Abdullah, Siti Norul Huda.

In: Applied Soft Computing Journal, Vol. 23, 2014, p. 104-121.

Research output: Contribution to journalArticle

@article{018dc26560ab4562aa673417dd96cc3b,
title = "Patch-Levy-based initialization algorithm for Bees Algorithm",
abstract = "The Bees Algorithm (BA) is a population-based metaheuristic algorithm inspired by the foraging behavior of honeybees. This algorithm has been successfully used as an optimization tool in combinatorial and functional optimization fields. In addition, its behavior very closely mimics the actual behavior that occurs in nature, and it is very simple and easy to implement. However, its convergence speed to the optimal solution still needs further improvement and it also needs a mechanism to obviate getting trapped in local optima. In this paper, a novel initialization algorithm based on the patch concept and Levy flight distribution is proposed to initialize the population of bees in BA. Consequently, we incorporate this initialization procedure into a proposed enhanced BA variant. The proposed variant is more natural than conventional variants of BA. It mimics the patch environment in nature and Levy flight, which is believed to characterize the foraging patterns of bees in nature. The results of experiments conducted on several widely used high-dimensional benchmarks indicate that our proposed enhanced BA variant significantly outperforms other BA variants and state-of-the-art variants of the Artificial Bee Colony (ABC) algorithm in terms of solution quality, convergence speed, and success rate. In addition, the results of experimental analyses conducted indicate that our proposed enhanced BA is very stable, has the ability to deal with differences in search ranges, and rapidly converges without getting stuck in local optima.",
keywords = "Bees Algorithm, Levy flight, Metaheuristic algorithm, Patch environment, Population initialization",
author = "Hussein, {Wasim A.} and Shahnorbanun Sahran and {Sheikh Abdullah}, {Siti Norul Huda}",
year = "2014",
doi = "10.1016/j.asoc.2014.06.004",
language = "English",
volume = "23",
pages = "104--121",
journal = "Applied Soft Computing",
issn = "1568-4946",
publisher = "Elsevier BV",

}

TY - JOUR

T1 - Patch-Levy-based initialization algorithm for Bees Algorithm

AU - Hussein, Wasim A.

AU - Sahran, Shahnorbanun

AU - Sheikh Abdullah, Siti Norul Huda

PY - 2014

Y1 - 2014

N2 - The Bees Algorithm (BA) is a population-based metaheuristic algorithm inspired by the foraging behavior of honeybees. This algorithm has been successfully used as an optimization tool in combinatorial and functional optimization fields. In addition, its behavior very closely mimics the actual behavior that occurs in nature, and it is very simple and easy to implement. However, its convergence speed to the optimal solution still needs further improvement and it also needs a mechanism to obviate getting trapped in local optima. In this paper, a novel initialization algorithm based on the patch concept and Levy flight distribution is proposed to initialize the population of bees in BA. Consequently, we incorporate this initialization procedure into a proposed enhanced BA variant. The proposed variant is more natural than conventional variants of BA. It mimics the patch environment in nature and Levy flight, which is believed to characterize the foraging patterns of bees in nature. The results of experiments conducted on several widely used high-dimensional benchmarks indicate that our proposed enhanced BA variant significantly outperforms other BA variants and state-of-the-art variants of the Artificial Bee Colony (ABC) algorithm in terms of solution quality, convergence speed, and success rate. In addition, the results of experimental analyses conducted indicate that our proposed enhanced BA is very stable, has the ability to deal with differences in search ranges, and rapidly converges without getting stuck in local optima.

AB - The Bees Algorithm (BA) is a population-based metaheuristic algorithm inspired by the foraging behavior of honeybees. This algorithm has been successfully used as an optimization tool in combinatorial and functional optimization fields. In addition, its behavior very closely mimics the actual behavior that occurs in nature, and it is very simple and easy to implement. However, its convergence speed to the optimal solution still needs further improvement and it also needs a mechanism to obviate getting trapped in local optima. In this paper, a novel initialization algorithm based on the patch concept and Levy flight distribution is proposed to initialize the population of bees in BA. Consequently, we incorporate this initialization procedure into a proposed enhanced BA variant. The proposed variant is more natural than conventional variants of BA. It mimics the patch environment in nature and Levy flight, which is believed to characterize the foraging patterns of bees in nature. The results of experiments conducted on several widely used high-dimensional benchmarks indicate that our proposed enhanced BA variant significantly outperforms other BA variants and state-of-the-art variants of the Artificial Bee Colony (ABC) algorithm in terms of solution quality, convergence speed, and success rate. In addition, the results of experimental analyses conducted indicate that our proposed enhanced BA is very stable, has the ability to deal with differences in search ranges, and rapidly converges without getting stuck in local optima.

KW - Bees Algorithm

KW - Levy flight

KW - Metaheuristic algorithm

KW - Patch environment

KW - Population initialization

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

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

U2 - 10.1016/j.asoc.2014.06.004

DO - 10.1016/j.asoc.2014.06.004

M3 - Article

VL - 23

SP - 104

EP - 121

JO - Applied Soft Computing

JF - Applied Soft Computing

SN - 1568-4946

ER -