A multi-population harmony search algorithm with external archive for dynamic optimization problems

Ayad Mashaan Turky, Salwani Abdullah

Research output: Contribution to journalArticle

60 Citations (Scopus)

Abstract

Dynamic optimization problems present great challenges to the research community because their parameters are either revealed or changed during the course of an ongoing optimization process. These problems are more challenging than static problems in real-world applications because the latter are usually dynamic, with the environment constantly subjected to change or the size of a problem increasing sporadically. In solving dynamic optimization problems in the real world, proposed solutions should be able to monitor the movement of the optimal point and the changes in the landscape solutions. In this paper, a multi-population harmony search algorithm with external archive for dynamic optimization problems is proposed. Harmony search algorithm is a population-based meta-heuristic optimization technique that is similar to a musical process when a musician is attempting to find a state of harmony. To tackle the problem of dynamism, the population of solutions is divided into several sub-populations such that each sub-population takes charge exploring or exploiting the search space. To enhance the algorithm performance further, an external archive is used to save the best solutions for later use. These solutions will then be used to replace redundant solutions in the harmony memory. The proposed algorithm is tested on the Moving Peak Benchmark. Empirical results show that the proposed algorithm produces better results than several of the current state-of-the-art algorithms.

Original languageEnglish
Pages (from-to)84-95
Number of pages12
JournalInformation Sciences
Volume272
DOIs
Publication statusPublished - 10 Jul 2014

Fingerprint

Harmony Search
Dynamic Optimization Problems
Search Algorithm
Heuristic Optimization
Process Optimization
Real-world Applications
Metaheuristics
Search Space
Optimization Techniques
Monitor
Charge
Archives
Harmony
Dynamic optimization
Optimization problem
Benchmark
Data storage equipment

Keywords

  • Dynamic optimization problems
  • External archive
  • Harmony search algorithm
  • Multi-population

ASJC Scopus subject areas

  • Artificial Intelligence
  • Software
  • Control and Systems Engineering
  • Theoretical Computer Science
  • Computer Science Applications
  • Information Systems and Management

Cite this

A multi-population harmony search algorithm with external archive for dynamic optimization problems. / Turky, Ayad Mashaan; Abdullah, Salwani.

In: Information Sciences, Vol. 272, 10.07.2014, p. 84-95.

Research output: Contribution to journalArticle

@article{644d8be226614ac59b31c04b960e0577,
title = "A multi-population harmony search algorithm with external archive for dynamic optimization problems",
abstract = "Dynamic optimization problems present great challenges to the research community because their parameters are either revealed or changed during the course of an ongoing optimization process. These problems are more challenging than static problems in real-world applications because the latter are usually dynamic, with the environment constantly subjected to change or the size of a problem increasing sporadically. In solving dynamic optimization problems in the real world, proposed solutions should be able to monitor the movement of the optimal point and the changes in the landscape solutions. In this paper, a multi-population harmony search algorithm with external archive for dynamic optimization problems is proposed. Harmony search algorithm is a population-based meta-heuristic optimization technique that is similar to a musical process when a musician is attempting to find a state of harmony. To tackle the problem of dynamism, the population of solutions is divided into several sub-populations such that each sub-population takes charge exploring or exploiting the search space. To enhance the algorithm performance further, an external archive is used to save the best solutions for later use. These solutions will then be used to replace redundant solutions in the harmony memory. The proposed algorithm is tested on the Moving Peak Benchmark. Empirical results show that the proposed algorithm produces better results than several of the current state-of-the-art algorithms.",
keywords = "Dynamic optimization problems, External archive, Harmony search algorithm, Multi-population",
author = "Turky, {Ayad Mashaan} and Salwani Abdullah",
year = "2014",
month = "7",
day = "10",
doi = "10.1016/j.ins.2014.02.084",
language = "English",
volume = "272",
pages = "84--95",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",

}

TY - JOUR

T1 - A multi-population harmony search algorithm with external archive for dynamic optimization problems

AU - Turky, Ayad Mashaan

AU - Abdullah, Salwani

PY - 2014/7/10

Y1 - 2014/7/10

N2 - Dynamic optimization problems present great challenges to the research community because their parameters are either revealed or changed during the course of an ongoing optimization process. These problems are more challenging than static problems in real-world applications because the latter are usually dynamic, with the environment constantly subjected to change or the size of a problem increasing sporadically. In solving dynamic optimization problems in the real world, proposed solutions should be able to monitor the movement of the optimal point and the changes in the landscape solutions. In this paper, a multi-population harmony search algorithm with external archive for dynamic optimization problems is proposed. Harmony search algorithm is a population-based meta-heuristic optimization technique that is similar to a musical process when a musician is attempting to find a state of harmony. To tackle the problem of dynamism, the population of solutions is divided into several sub-populations such that each sub-population takes charge exploring or exploiting the search space. To enhance the algorithm performance further, an external archive is used to save the best solutions for later use. These solutions will then be used to replace redundant solutions in the harmony memory. The proposed algorithm is tested on the Moving Peak Benchmark. Empirical results show that the proposed algorithm produces better results than several of the current state-of-the-art algorithms.

AB - Dynamic optimization problems present great challenges to the research community because their parameters are either revealed or changed during the course of an ongoing optimization process. These problems are more challenging than static problems in real-world applications because the latter are usually dynamic, with the environment constantly subjected to change or the size of a problem increasing sporadically. In solving dynamic optimization problems in the real world, proposed solutions should be able to monitor the movement of the optimal point and the changes in the landscape solutions. In this paper, a multi-population harmony search algorithm with external archive for dynamic optimization problems is proposed. Harmony search algorithm is a population-based meta-heuristic optimization technique that is similar to a musical process when a musician is attempting to find a state of harmony. To tackle the problem of dynamism, the population of solutions is divided into several sub-populations such that each sub-population takes charge exploring or exploiting the search space. To enhance the algorithm performance further, an external archive is used to save the best solutions for later use. These solutions will then be used to replace redundant solutions in the harmony memory. The proposed algorithm is tested on the Moving Peak Benchmark. Empirical results show that the proposed algorithm produces better results than several of the current state-of-the-art algorithms.

KW - Dynamic optimization problems

KW - External archive

KW - Harmony search algorithm

KW - Multi-population

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

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

U2 - 10.1016/j.ins.2014.02.084

DO - 10.1016/j.ins.2014.02.084

M3 - Article

AN - SCOPUS:84899491832

VL - 272

SP - 84

EP - 95

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

ER -