An adaptive multi-population artificial bee colony algorithm for dynamic optimisation problems

Shams K. Nseef, Salwani Abdullah, Ayad Turky, Graham Kendall

Research output: Contribution to journalArticle

57 Citations (Scopus)

Abstract

Recently, interest in solving real-world problems that change over the time, so called dynamic optimisation problems (DOPs), has grown due to their practical applications. A DOP requires an optimisation algorithm that can dynamically adapt to changes and several methodologies have been integrated with population-based algorithms to address these problems. Multi-population algorithms have been widely used, but it is hard to determine the number of populations to be used for a given problem. This paper proposes an adaptive multi-population artificial bee colony (ABC) algorithm for DOPs. ABC is a simple, yet efficient, nature inspired algorithm for addressing numerical optimisation, which has been successfully used for tackling other optimisation problems. The proposed ABC algorithm has the following features. Firstly it uses multi-populations to cope with dynamic changes, and a clearing scheme to maintain the diversity and enhance the exploration process. Secondly, the number of sub-populations changes over time, to adapt to changes in the search space. The moving peaks benchmark DOP is used to verify the performance of the proposed ABC. Experimental results show that the proposed ABC is superior to the ABC on all tested instances. Compared to state of the art methodologies, our proposed ABC algorithm produces very good results.

Original languageEnglish
Pages (from-to)14-23
Number of pages10
JournalKnowledge-Based Systems
Volume104
DOIs
Publication statusPublished - 15 Jul 2016

Fingerprint

Optimization problem
Dynamic optimization
Methodology
Numerical optimization
Nature
Benchmark
Population change
Integrated

Keywords

  • Adaptive multi-population method
  • Artificial bee colony algorithm
  • Dynamic optimisation
  • Meta-heuristics

ASJC Scopus subject areas

  • Management Information Systems
  • Software
  • Information Systems and Management
  • Artificial Intelligence

Cite this

An adaptive multi-population artificial bee colony algorithm for dynamic optimisation problems. / Nseef, Shams K.; Abdullah, Salwani; Turky, Ayad; Kendall, Graham.

In: Knowledge-Based Systems, Vol. 104, 15.07.2016, p. 14-23.

Research output: Contribution to journalArticle

@article{093467008a64478e8c34378fefe30f9b,
title = "An adaptive multi-population artificial bee colony algorithm for dynamic optimisation problems",
abstract = "Recently, interest in solving real-world problems that change over the time, so called dynamic optimisation problems (DOPs), has grown due to their practical applications. A DOP requires an optimisation algorithm that can dynamically adapt to changes and several methodologies have been integrated with population-based algorithms to address these problems. Multi-population algorithms have been widely used, but it is hard to determine the number of populations to be used for a given problem. This paper proposes an adaptive multi-population artificial bee colony (ABC) algorithm for DOPs. ABC is a simple, yet efficient, nature inspired algorithm for addressing numerical optimisation, which has been successfully used for tackling other optimisation problems. The proposed ABC algorithm has the following features. Firstly it uses multi-populations to cope with dynamic changes, and a clearing scheme to maintain the diversity and enhance the exploration process. Secondly, the number of sub-populations changes over time, to adapt to changes in the search space. The moving peaks benchmark DOP is used to verify the performance of the proposed ABC. Experimental results show that the proposed ABC is superior to the ABC on all tested instances. Compared to state of the art methodologies, our proposed ABC algorithm produces very good results.",
keywords = "Adaptive multi-population method, Artificial bee colony algorithm, Dynamic optimisation, Meta-heuristics",
author = "Nseef, {Shams K.} and Salwani Abdullah and Ayad Turky and Graham Kendall",
year = "2016",
month = "7",
day = "15",
doi = "10.1016/j.knosys.2016.04.005",
language = "English",
volume = "104",
pages = "14--23",
journal = "Knowledge-Based Systems",
issn = "0950-7051",
publisher = "Elsevier",

}

TY - JOUR

T1 - An adaptive multi-population artificial bee colony algorithm for dynamic optimisation problems

AU - Nseef, Shams K.

AU - Abdullah, Salwani

AU - Turky, Ayad

AU - Kendall, Graham

PY - 2016/7/15

Y1 - 2016/7/15

N2 - Recently, interest in solving real-world problems that change over the time, so called dynamic optimisation problems (DOPs), has grown due to their practical applications. A DOP requires an optimisation algorithm that can dynamically adapt to changes and several methodologies have been integrated with population-based algorithms to address these problems. Multi-population algorithms have been widely used, but it is hard to determine the number of populations to be used for a given problem. This paper proposes an adaptive multi-population artificial bee colony (ABC) algorithm for DOPs. ABC is a simple, yet efficient, nature inspired algorithm for addressing numerical optimisation, which has been successfully used for tackling other optimisation problems. The proposed ABC algorithm has the following features. Firstly it uses multi-populations to cope with dynamic changes, and a clearing scheme to maintain the diversity and enhance the exploration process. Secondly, the number of sub-populations changes over time, to adapt to changes in the search space. The moving peaks benchmark DOP is used to verify the performance of the proposed ABC. Experimental results show that the proposed ABC is superior to the ABC on all tested instances. Compared to state of the art methodologies, our proposed ABC algorithm produces very good results.

AB - Recently, interest in solving real-world problems that change over the time, so called dynamic optimisation problems (DOPs), has grown due to their practical applications. A DOP requires an optimisation algorithm that can dynamically adapt to changes and several methodologies have been integrated with population-based algorithms to address these problems. Multi-population algorithms have been widely used, but it is hard to determine the number of populations to be used for a given problem. This paper proposes an adaptive multi-population artificial bee colony (ABC) algorithm for DOPs. ABC is a simple, yet efficient, nature inspired algorithm for addressing numerical optimisation, which has been successfully used for tackling other optimisation problems. The proposed ABC algorithm has the following features. Firstly it uses multi-populations to cope with dynamic changes, and a clearing scheme to maintain the diversity and enhance the exploration process. Secondly, the number of sub-populations changes over time, to adapt to changes in the search space. The moving peaks benchmark DOP is used to verify the performance of the proposed ABC. Experimental results show that the proposed ABC is superior to the ABC on all tested instances. Compared to state of the art methodologies, our proposed ABC algorithm produces very good results.

KW - Adaptive multi-population method

KW - Artificial bee colony algorithm

KW - Dynamic optimisation

KW - Meta-heuristics

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

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

U2 - 10.1016/j.knosys.2016.04.005

DO - 10.1016/j.knosys.2016.04.005

M3 - Article

AN - SCOPUS:84992310437

VL - 104

SP - 14

EP - 23

JO - Knowledge-Based Systems

JF - Knowledge-Based Systems

SN - 0950-7051

ER -