Improving the performance of harmony search using opposition-based learning and quadratic interpolation (Q622819)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improving the performance of harmony search using opposition-based learning and quadratic interpolation |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Improving the performance of harmony search using opposition-based learning and quadratic interpolation |
scientific article |
Statements
Improving the performance of harmony search using opposition-based learning and quadratic interpolation (English)
0 references
4 February 2011
0 references
Summary: Harmony search (HS) is a recently spotlighted metaheuristic optimisation method imitating the music improvisation process where musicians improvise their instruments' pitches searching for a perfect state of harmony. In this paper, the effect of using opposition-based learning and quadratic interpolation is investigated. Three variants are proposed and the performance of these methods is investigated and compared with HS and other recent methods when applied to several benchmark functions. The experiments conducted show that the proposed methods generally outperform the other methods when applied to the benchmark problems. Moreover, the performance of the proposed methods when applied to high-dimensional problems is investigated.
0 references
harmony search
0 references
opposition-based learning
0 references
OBL
0 references
quadratic interpolation
0 references
metaheuristics
0 references
phenomenon mimicking algorithms
0 references