A Novel Self-Adaptive Harmony Search Algorithm

The harmony search algorithm is a music-inspired optimization technology and has been successfully applied to diverse scientific and engineering problems. However, like other metaheuristic algorithms, it still faces two difficulties: parameter setting and finding the optimal balance between diversit...

Full description

Saved in:
Bibliographic Details
Main Author: Kaiping Luo
Format: Article
Language:English
Published: Wiley 2013-01-01
Series:Journal of Applied Mathematics
Online Access:http://dx.doi.org/10.1155/2013/653749
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1832568196129882112
author Kaiping Luo
author_facet Kaiping Luo
author_sort Kaiping Luo
collection DOAJ
description The harmony search algorithm is a music-inspired optimization technology and has been successfully applied to diverse scientific and engineering problems. However, like other metaheuristic algorithms, it still faces two difficulties: parameter setting and finding the optimal balance between diversity and intensity in searching. This paper proposes a novel, self-adaptive search mechanism for optimization problems with continuous variables. This new variant can automatically configure the evolutionary parameters in accordance with problem characteristics, such as the scale and the boundaries, and dynamically select evolutionary strategies in accordance with its search performance. The new variant simplifies the parameter setting and efficiently solves all types of optimization problems with continuous variables. Statistical test results show that this variant is considerably robust and outperforms the original harmony search (HS), improved harmony search (IHS), and other self-adaptive variants for large-scale optimization problems and constrained problems.
format Article
id doaj-art-0c990c9c961d45629fc6448aa5370011
institution Kabale University
issn 1110-757X
1687-0042
language English
publishDate 2013-01-01
publisher Wiley
record_format Article
series Journal of Applied Mathematics
spelling doaj-art-0c990c9c961d45629fc6448aa53700112025-02-03T00:59:34ZengWileyJournal of Applied Mathematics1110-757X1687-00422013-01-01201310.1155/2013/653749653749A Novel Self-Adaptive Harmony Search AlgorithmKaiping Luo0School of Economics & Management, Beihang University, Beijing 100191, ChinaThe harmony search algorithm is a music-inspired optimization technology and has been successfully applied to diverse scientific and engineering problems. However, like other metaheuristic algorithms, it still faces two difficulties: parameter setting and finding the optimal balance between diversity and intensity in searching. This paper proposes a novel, self-adaptive search mechanism for optimization problems with continuous variables. This new variant can automatically configure the evolutionary parameters in accordance with problem characteristics, such as the scale and the boundaries, and dynamically select evolutionary strategies in accordance with its search performance. The new variant simplifies the parameter setting and efficiently solves all types of optimization problems with continuous variables. Statistical test results show that this variant is considerably robust and outperforms the original harmony search (HS), improved harmony search (IHS), and other self-adaptive variants for large-scale optimization problems and constrained problems.http://dx.doi.org/10.1155/2013/653749
spellingShingle Kaiping Luo
A Novel Self-Adaptive Harmony Search Algorithm
Journal of Applied Mathematics
title A Novel Self-Adaptive Harmony Search Algorithm
title_full A Novel Self-Adaptive Harmony Search Algorithm
title_fullStr A Novel Self-Adaptive Harmony Search Algorithm
title_full_unstemmed A Novel Self-Adaptive Harmony Search Algorithm
title_short A Novel Self-Adaptive Harmony Search Algorithm
title_sort novel self adaptive harmony search algorithm
url http://dx.doi.org/10.1155/2013/653749
work_keys_str_mv AT kaipingluo anovelselfadaptiveharmonysearchalgorithm
AT kaipingluo novelselfadaptiveharmonysearchalgorithm