The Patch-Levy-Based Bees Algorithm Applied to Dynamic Optimization Problems

Research output: Contribution to journalArticle

Abstract

Many real-world optimization problems are actually of dynamic nature. These problems change over time in terms of the objective function, decision variables, constraints, and so forth. Therefore, it is very important to study the performance of a metaheuristic algorithm in dynamic environments to assess the robustness of the algorithm to deal with real-word problems. In addition, it is important to adapt the existing metaheuristic algorithms to perform well in dynamic environments. This paper investigates a recently proposed version of Bees Algorithm, which is called Patch-Levy-based Bees Algorithm (PLBA), on solving dynamic problems, and adapts it to deal with such problems. The performance of the PLBA is compared with other BA versions and other state-of-the-art algorithms on a set of dynamic multimodal benchmark problems of different degrees of difficulties. The results of the experiments show that PLBA achieves better results than the other BA variants. The obtained results also indicate that PLBA significantly outperforms some of the other state-of-the-art algorithms and is competitive with others.

Original languageEnglish
Article number5678393
JournalDiscrete Dynamics in Nature and Society
Volume2017
DOIs
Publication statusPublished - 2017

Fingerprint

Dynamic Optimization Problems
Patch
Dynamic Environment
Metaheuristics
Word problem
Dynamic Problem
Objective function
Benchmark
Robustness
Optimization Problem

ASJC Scopus subject areas

  • Modelling and Simulation

Cite this

@article{00cc8fc5706b434eaefa6f6323c999cd,
title = "The Patch-Levy-Based Bees Algorithm Applied to Dynamic Optimization Problems",
abstract = "Many real-world optimization problems are actually of dynamic nature. These problems change over time in terms of the objective function, decision variables, constraints, and so forth. Therefore, it is very important to study the performance of a metaheuristic algorithm in dynamic environments to assess the robustness of the algorithm to deal with real-word problems. In addition, it is important to adapt the existing metaheuristic algorithms to perform well in dynamic environments. This paper investigates a recently proposed version of Bees Algorithm, which is called Patch-Levy-based Bees Algorithm (PLBA), on solving dynamic problems, and adapts it to deal with such problems. The performance of the PLBA is compared with other BA versions and other state-of-the-art algorithms on a set of dynamic multimodal benchmark problems of different degrees of difficulties. The results of the experiments show that PLBA achieves better results than the other BA variants. The obtained results also indicate that PLBA significantly outperforms some of the other state-of-the-art algorithms and is competitive with others.",
author = "Hussein, {Wasim A.} and {Sheikh Abdullah}, {Siti Norul Huda} and Shahnorbanun Sahran",
year = "2017",
doi = "10.1155/2017/5678393",
language = "English",
volume = "2017",
journal = "Discrete Dynamics in Nature and Society",
issn = "1026-0226",
publisher = "Hindawi Publishing Corporation",

}

TY - JOUR

T1 - The Patch-Levy-Based Bees Algorithm Applied to Dynamic Optimization Problems

AU - Hussein, Wasim A.

AU - Sheikh Abdullah, Siti Norul Huda

AU - Sahran, Shahnorbanun

PY - 2017

Y1 - 2017

N2 - Many real-world optimization problems are actually of dynamic nature. These problems change over time in terms of the objective function, decision variables, constraints, and so forth. Therefore, it is very important to study the performance of a metaheuristic algorithm in dynamic environments to assess the robustness of the algorithm to deal with real-word problems. In addition, it is important to adapt the existing metaheuristic algorithms to perform well in dynamic environments. This paper investigates a recently proposed version of Bees Algorithm, which is called Patch-Levy-based Bees Algorithm (PLBA), on solving dynamic problems, and adapts it to deal with such problems. The performance of the PLBA is compared with other BA versions and other state-of-the-art algorithms on a set of dynamic multimodal benchmark problems of different degrees of difficulties. The results of the experiments show that PLBA achieves better results than the other BA variants. The obtained results also indicate that PLBA significantly outperforms some of the other state-of-the-art algorithms and is competitive with others.

AB - Many real-world optimization problems are actually of dynamic nature. These problems change over time in terms of the objective function, decision variables, constraints, and so forth. Therefore, it is very important to study the performance of a metaheuristic algorithm in dynamic environments to assess the robustness of the algorithm to deal with real-word problems. In addition, it is important to adapt the existing metaheuristic algorithms to perform well in dynamic environments. This paper investigates a recently proposed version of Bees Algorithm, which is called Patch-Levy-based Bees Algorithm (PLBA), on solving dynamic problems, and adapts it to deal with such problems. The performance of the PLBA is compared with other BA versions and other state-of-the-art algorithms on a set of dynamic multimodal benchmark problems of different degrees of difficulties. The results of the experiments show that PLBA achieves better results than the other BA variants. The obtained results also indicate that PLBA significantly outperforms some of the other state-of-the-art algorithms and is competitive with others.

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

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

U2 - 10.1155/2017/5678393

DO - 10.1155/2017/5678393

M3 - Article

AN - SCOPUS:85019862605

VL - 2017

JO - Discrete Dynamics in Nature and Society

JF - Discrete Dynamics in Nature and Society

SN - 1026-0226

M1 - 5678393

ER -