A multi-population electromagnetic algorithm for dynamic optimisation problems

Ayad Mashaan Turky, Salwani Abdullah

Research output: Contribution to journalArticle

15 Citations (Scopus)

Abstract

This paper is derived from an interest in the development of approaches to tackle dynamic optimisation problems. This is a very challenging research area due to the fact that any approaches utilised should be able to track the changes and simultaneously seek for global optima as the search progresses. In this research work, a multi-population electromagnetic algorithm for dynamic optimisation problems is proposed. An electromagnetic algorithm is a population based meta-heuristic method which imitates the attraction and repulsion of the sample points. In order to track the dynamic changes and to effectively explore the search space, the entire population is divided into several sub-populations (referred as multi-population that acts as diversity mechanisms) where each sub-population takes charge in exploring or exploiting the search space. In addition, further investigation are also conducted on the combination of the electromagnetic algorithm with different diversity mechanisms (i.e. random immigrants, memory mechanism and memory based immigrant schemes) with the aim of identifying the most appropriate diversity mechanism for maintaining the diversity of the population in solving dynamic optimisation problems. The proposed approach has been applied and evaluated against the latest methodologies in reviewed literature of research works with respect to the benchmark problems. This study demonstrates that the electromagnetic algorithm with a multi-population diversity mechanism performs better compared to other population diversity mechanisms investigated in our research and produces some of the best known results when tested on Moving Peak Benchmark (MPB) problems.

Original languageEnglish
Pages (from-to)474-482
Number of pages9
JournalApplied Soft Computing Journal
Volume22
DOIs
Publication statusPublished - 2014

Fingerprint

Data storage equipment
Heuristic methods

Keywords

  • Dynamic optimisation problems
  • Electromagnetic algorithm
  • Multi-population based method

ASJC Scopus subject areas

  • Software

Cite this

A multi-population electromagnetic algorithm for dynamic optimisation problems. / Turky, Ayad Mashaan; Abdullah, Salwani.

In: Applied Soft Computing Journal, Vol. 22, 2014, p. 474-482.

Research output: Contribution to journalArticle

@article{8c4f08f88d4743fa8d3ab4a55265f7bb,
title = "A multi-population electromagnetic algorithm for dynamic optimisation problems",
abstract = "This paper is derived from an interest in the development of approaches to tackle dynamic optimisation problems. This is a very challenging research area due to the fact that any approaches utilised should be able to track the changes and simultaneously seek for global optima as the search progresses. In this research work, a multi-population electromagnetic algorithm for dynamic optimisation problems is proposed. An electromagnetic algorithm is a population based meta-heuristic method which imitates the attraction and repulsion of the sample points. In order to track the dynamic changes and to effectively explore the search space, the entire population is divided into several sub-populations (referred as multi-population that acts as diversity mechanisms) where each sub-population takes charge in exploring or exploiting the search space. In addition, further investigation are also conducted on the combination of the electromagnetic algorithm with different diversity mechanisms (i.e. random immigrants, memory mechanism and memory based immigrant schemes) with the aim of identifying the most appropriate diversity mechanism for maintaining the diversity of the population in solving dynamic optimisation problems. The proposed approach has been applied and evaluated against the latest methodologies in reviewed literature of research works with respect to the benchmark problems. This study demonstrates that the electromagnetic algorithm with a multi-population diversity mechanism performs better compared to other population diversity mechanisms investigated in our research and produces some of the best known results when tested on Moving Peak Benchmark (MPB) problems.",
keywords = "Dynamic optimisation problems, Electromagnetic algorithm, Multi-population based method",
author = "Turky, {Ayad Mashaan} and Salwani Abdullah",
year = "2014",
doi = "10.1016/j.asoc.2014.04.032",
language = "English",
volume = "22",
pages = "474--482",
journal = "Applied Soft Computing",
issn = "1568-4946",
publisher = "Elsevier BV",

}

TY - JOUR

T1 - A multi-population electromagnetic algorithm for dynamic optimisation problems

AU - Turky, Ayad Mashaan

AU - Abdullah, Salwani

PY - 2014

Y1 - 2014

N2 - This paper is derived from an interest in the development of approaches to tackle dynamic optimisation problems. This is a very challenging research area due to the fact that any approaches utilised should be able to track the changes and simultaneously seek for global optima as the search progresses. In this research work, a multi-population electromagnetic algorithm for dynamic optimisation problems is proposed. An electromagnetic algorithm is a population based meta-heuristic method which imitates the attraction and repulsion of the sample points. In order to track the dynamic changes and to effectively explore the search space, the entire population is divided into several sub-populations (referred as multi-population that acts as diversity mechanisms) where each sub-population takes charge in exploring or exploiting the search space. In addition, further investigation are also conducted on the combination of the electromagnetic algorithm with different diversity mechanisms (i.e. random immigrants, memory mechanism and memory based immigrant schemes) with the aim of identifying the most appropriate diversity mechanism for maintaining the diversity of the population in solving dynamic optimisation problems. The proposed approach has been applied and evaluated against the latest methodologies in reviewed literature of research works with respect to the benchmark problems. This study demonstrates that the electromagnetic algorithm with a multi-population diversity mechanism performs better compared to other population diversity mechanisms investigated in our research and produces some of the best known results when tested on Moving Peak Benchmark (MPB) problems.

AB - This paper is derived from an interest in the development of approaches to tackle dynamic optimisation problems. This is a very challenging research area due to the fact that any approaches utilised should be able to track the changes and simultaneously seek for global optima as the search progresses. In this research work, a multi-population electromagnetic algorithm for dynamic optimisation problems is proposed. An electromagnetic algorithm is a population based meta-heuristic method which imitates the attraction and repulsion of the sample points. In order to track the dynamic changes and to effectively explore the search space, the entire population is divided into several sub-populations (referred as multi-population that acts as diversity mechanisms) where each sub-population takes charge in exploring or exploiting the search space. In addition, further investigation are also conducted on the combination of the electromagnetic algorithm with different diversity mechanisms (i.e. random immigrants, memory mechanism and memory based immigrant schemes) with the aim of identifying the most appropriate diversity mechanism for maintaining the diversity of the population in solving dynamic optimisation problems. The proposed approach has been applied and evaluated against the latest methodologies in reviewed literature of research works with respect to the benchmark problems. This study demonstrates that the electromagnetic algorithm with a multi-population diversity mechanism performs better compared to other population diversity mechanisms investigated in our research and produces some of the best known results when tested on Moving Peak Benchmark (MPB) problems.

KW - Dynamic optimisation problems

KW - Electromagnetic algorithm

KW - Multi-population based method

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

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

U2 - 10.1016/j.asoc.2014.04.032

DO - 10.1016/j.asoc.2014.04.032

M3 - Article

AN - SCOPUS:84903726648

VL - 22

SP - 474

EP - 482

JO - Applied Soft Computing

JF - Applied Soft Computing

SN - 1568-4946

ER -