A hybrid harmony search algorithm for solving dynamic optimisation problems

Ayad Mashaan Turky, Salwani Abdullah, Nasser R. Sabar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

15 Citations (Scopus)

Abstract

Many optimisation problems are dynamic in the sense that changes occur during the optimisation process, and therefore are more challenging than the stationary problems. To solve dynamic optimisation problems, the proposed approaches should not only attempt to s eek the global optima but be able to also keep track of changes in the track record of landscape solutions. In this research work, one of the most recent new population-based meta-heuristic optimisation technique called a harmony search algorithm for dynamic optimization problems is investigated. This technique mimics the musical process when a musician attempts to find a state of harmony. In order to cope with a dynamic behaviour, the proposed harmony search algorithm was hybridised with a (i) random immigrant, (ii) memory mechanism and (iii) memory based immigrant scheme. The performance of the proposed harmony search is verified by using the well-known dynamic test problem called the Moving Peak Benchmark (MPB) with a variety of peaks. The empirical results demonstrate that the proposed algorithm is able to obtain competitive results, but not the best for most of the cases, when compared to the best known results in the scientific literature published so far.

Original languageEnglish
Title of host publicationProcedia Computer Science
PublisherElsevier
Pages1926-1936
Number of pages11
Volume29
DOIs
Publication statusPublished - 2014
Event14th Annual International Conference on Computational Science, ICCS 2014 - Cairns, QLD, Australia
Duration: 10 Jun 201412 Jun 2014

Other

Other14th Annual International Conference on Computational Science, ICCS 2014
CountryAustralia
CityCairns, QLD
Period10/6/1412/6/14

Fingerprint

Data storage equipment

Keywords

  • Dynamic optimization problems
  • Harmony search algorithm
  • Meta-heuristic

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Turky, A. M., Abdullah, S., & Sabar, N. R. (2014). A hybrid harmony search algorithm for solving dynamic optimisation problems. In Procedia Computer Science (Vol. 29, pp. 1926-1936). Elsevier. https://doi.org/10.1016/j.procs.2014.05.177

A hybrid harmony search algorithm for solving dynamic optimisation problems. / Turky, Ayad Mashaan; Abdullah, Salwani; Sabar, Nasser R.

Procedia Computer Science. Vol. 29 Elsevier, 2014. p. 1926-1936.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Turky, AM, Abdullah, S & Sabar, NR 2014, A hybrid harmony search algorithm for solving dynamic optimisation problems. in Procedia Computer Science. vol. 29, Elsevier, pp. 1926-1936, 14th Annual International Conference on Computational Science, ICCS 2014, Cairns, QLD, Australia, 10/6/14. https://doi.org/10.1016/j.procs.2014.05.177
Turky AM, Abdullah S, Sabar NR. A hybrid harmony search algorithm for solving dynamic optimisation problems. In Procedia Computer Science. Vol. 29. Elsevier. 2014. p. 1926-1936 https://doi.org/10.1016/j.procs.2014.05.177
Turky, Ayad Mashaan ; Abdullah, Salwani ; Sabar, Nasser R. / A hybrid harmony search algorithm for solving dynamic optimisation problems. Procedia Computer Science. Vol. 29 Elsevier, 2014. pp. 1926-1936
@inproceedings{e232f729a1454cd08962c178c4cafa68,
title = "A hybrid harmony search algorithm for solving dynamic optimisation problems",
abstract = "Many optimisation problems are dynamic in the sense that changes occur during the optimisation process, and therefore are more challenging than the stationary problems. To solve dynamic optimisation problems, the proposed approaches should not only attempt to s eek the global optima but be able to also keep track of changes in the track record of landscape solutions. In this research work, one of the most recent new population-based meta-heuristic optimisation technique called a harmony search algorithm for dynamic optimization problems is investigated. This technique mimics the musical process when a musician attempts to find a state of harmony. In order to cope with a dynamic behaviour, the proposed harmony search algorithm was hybridised with a (i) random immigrant, (ii) memory mechanism and (iii) memory based immigrant scheme. The performance of the proposed harmony search is verified by using the well-known dynamic test problem called the Moving Peak Benchmark (MPB) with a variety of peaks. The empirical results demonstrate that the proposed algorithm is able to obtain competitive results, but not the best for most of the cases, when compared to the best known results in the scientific literature published so far.",
keywords = "Dynamic optimization problems, Harmony search algorithm, Meta-heuristic",
author = "Turky, {Ayad Mashaan} and Salwani Abdullah and Sabar, {Nasser R.}",
year = "2014",
doi = "10.1016/j.procs.2014.05.177",
language = "English",
volume = "29",
pages = "1926--1936",
booktitle = "Procedia Computer Science",
publisher = "Elsevier",

}

TY - GEN

T1 - A hybrid harmony search algorithm for solving dynamic optimisation problems

AU - Turky, Ayad Mashaan

AU - Abdullah, Salwani

AU - Sabar, Nasser R.

PY - 2014

Y1 - 2014

N2 - Many optimisation problems are dynamic in the sense that changes occur during the optimisation process, and therefore are more challenging than the stationary problems. To solve dynamic optimisation problems, the proposed approaches should not only attempt to s eek the global optima but be able to also keep track of changes in the track record of landscape solutions. In this research work, one of the most recent new population-based meta-heuristic optimisation technique called a harmony search algorithm for dynamic optimization problems is investigated. This technique mimics the musical process when a musician attempts to find a state of harmony. In order to cope with a dynamic behaviour, the proposed harmony search algorithm was hybridised with a (i) random immigrant, (ii) memory mechanism and (iii) memory based immigrant scheme. The performance of the proposed harmony search is verified by using the well-known dynamic test problem called the Moving Peak Benchmark (MPB) with a variety of peaks. The empirical results demonstrate that the proposed algorithm is able to obtain competitive results, but not the best for most of the cases, when compared to the best known results in the scientific literature published so far.

AB - Many optimisation problems are dynamic in the sense that changes occur during the optimisation process, and therefore are more challenging than the stationary problems. To solve dynamic optimisation problems, the proposed approaches should not only attempt to s eek the global optima but be able to also keep track of changes in the track record of landscape solutions. In this research work, one of the most recent new population-based meta-heuristic optimisation technique called a harmony search algorithm for dynamic optimization problems is investigated. This technique mimics the musical process when a musician attempts to find a state of harmony. In order to cope with a dynamic behaviour, the proposed harmony search algorithm was hybridised with a (i) random immigrant, (ii) memory mechanism and (iii) memory based immigrant scheme. The performance of the proposed harmony search is verified by using the well-known dynamic test problem called the Moving Peak Benchmark (MPB) with a variety of peaks. The empirical results demonstrate that the proposed algorithm is able to obtain competitive results, but not the best for most of the cases, when compared to the best known results in the scientific literature published so far.

KW - Dynamic optimization problems

KW - Harmony search algorithm

KW - Meta-heuristic

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

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

U2 - 10.1016/j.procs.2014.05.177

DO - 10.1016/j.procs.2014.05.177

M3 - Conference contribution

AN - SCOPUS:84902771701

VL - 29

SP - 1926

EP - 1936

BT - Procedia Computer Science

PB - Elsevier

ER -