A dual-population multi operators harmony search algorithm for dynamic optimization problems

Ayad Turky, Salwani Abdullah, Anas Dawod

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

Dynamic optimization problems (DOPs) have been widely researched in recent years. This is due to its numerous practical applications in real-life conditions. To solve DOPs, the optimizer should be able to track the changes and simultaneously seek for global optima in the search space. This paper proposes a dual population multi operators harmony search algorithm for DOPs to deal with changes in the problem landscape. The main difference between the proposed algorithm and other techniques are twofold: dual population for exploring and exploiting the search space, and the use of multi operators at different points of the search. Extensive experiments were conducted on the Moving Peaks Benchmark (MPB) and six dynamic test functions proposed in the IEEE Congress on Evolutionary Computation (CEC 2009) were used to evaluate the performance of the proposed algorithm. Empirical results indicate the superiority of the proposed algorithm when compared to state-of-the-art algorithms from the literature.

Original languageEnglish
Pages (from-to)19-28
Number of pages10
JournalComputers and Industrial Engineering
Volume117
DOIs
Publication statusPublished - 1 Mar 2018

Fingerprint

Mathematical operators
Evolutionary algorithms
Experiments

Keywords

  • Algorithm
  • Dual population
  • Dynamic optimization
  • Harmony search
  • Multi operators

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this

A dual-population multi operators harmony search algorithm for dynamic optimization problems. / Turky, Ayad; Abdullah, Salwani; Dawod, Anas.

In: Computers and Industrial Engineering, Vol. 117, 01.03.2018, p. 19-28.

Research output: Contribution to journalArticle

@article{411925b1569049b48d08a9d8bcef0084,
title = "A dual-population multi operators harmony search algorithm for dynamic optimization problems",
abstract = "Dynamic optimization problems (DOPs) have been widely researched in recent years. This is due to its numerous practical applications in real-life conditions. To solve DOPs, the optimizer should be able to track the changes and simultaneously seek for global optima in the search space. This paper proposes a dual population multi operators harmony search algorithm for DOPs to deal with changes in the problem landscape. The main difference between the proposed algorithm and other techniques are twofold: dual population for exploring and exploiting the search space, and the use of multi operators at different points of the search. Extensive experiments were conducted on the Moving Peaks Benchmark (MPB) and six dynamic test functions proposed in the IEEE Congress on Evolutionary Computation (CEC 2009) were used to evaluate the performance of the proposed algorithm. Empirical results indicate the superiority of the proposed algorithm when compared to state-of-the-art algorithms from the literature.",
keywords = "Algorithm, Dual population, Dynamic optimization, Harmony search, Multi operators",
author = "Ayad Turky and Salwani Abdullah and Anas Dawod",
year = "2018",
month = "3",
day = "1",
doi = "10.1016/j.cie.2018.01.003",
language = "English",
volume = "117",
pages = "19--28",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",

}

TY - JOUR

T1 - A dual-population multi operators harmony search algorithm for dynamic optimization problems

AU - Turky, Ayad

AU - Abdullah, Salwani

AU - Dawod, Anas

PY - 2018/3/1

Y1 - 2018/3/1

N2 - Dynamic optimization problems (DOPs) have been widely researched in recent years. This is due to its numerous practical applications in real-life conditions. To solve DOPs, the optimizer should be able to track the changes and simultaneously seek for global optima in the search space. This paper proposes a dual population multi operators harmony search algorithm for DOPs to deal with changes in the problem landscape. The main difference between the proposed algorithm and other techniques are twofold: dual population for exploring and exploiting the search space, and the use of multi operators at different points of the search. Extensive experiments were conducted on the Moving Peaks Benchmark (MPB) and six dynamic test functions proposed in the IEEE Congress on Evolutionary Computation (CEC 2009) were used to evaluate the performance of the proposed algorithm. Empirical results indicate the superiority of the proposed algorithm when compared to state-of-the-art algorithms from the literature.

AB - Dynamic optimization problems (DOPs) have been widely researched in recent years. This is due to its numerous practical applications in real-life conditions. To solve DOPs, the optimizer should be able to track the changes and simultaneously seek for global optima in the search space. This paper proposes a dual population multi operators harmony search algorithm for DOPs to deal with changes in the problem landscape. The main difference between the proposed algorithm and other techniques are twofold: dual population for exploring and exploiting the search space, and the use of multi operators at different points of the search. Extensive experiments were conducted on the Moving Peaks Benchmark (MPB) and six dynamic test functions proposed in the IEEE Congress on Evolutionary Computation (CEC 2009) were used to evaluate the performance of the proposed algorithm. Empirical results indicate the superiority of the proposed algorithm when compared to state-of-the-art algorithms from the literature.

KW - Algorithm

KW - Dual population

KW - Dynamic optimization

KW - Harmony search

KW - Multi operators

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

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

U2 - 10.1016/j.cie.2018.01.003

DO - 10.1016/j.cie.2018.01.003

M3 - Article

AN - SCOPUS:85042905226

VL - 117

SP - 19

EP - 28

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

ER -