A Cooperative Harmony Search Algorithm for Function OptimizationReport as inadecuate

A Cooperative Harmony Search Algorithm for Function Optimization - Download this document for free, or read online. Document in PDF available to download.

Mathematical Problems in Engineering - Volume 2014 2014, Article ID 587820, 12 pages -

Research ArticleCollege of Automation, Harbin Engineering University, Harbin 150001, China

Received 12 December 2013; Accepted 26 January 2014; Published 6 March 2014

Academic Editor: Rongni Yang

Copyright © 2014 Gang Li and Qingzhong Wang. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Harmony search algorithm HS is a new metaheuristic algorithm which is inspired by a process involving musical improvisation. HS is a stochastic optimization technique that is similar to genetic algorithms GAs and particle swarm optimizers PSOs. It has been widely applied in order to solve many complex optimization problems, including continuous and discrete problems, such as structure design, and function optimization. A cooperative harmony search algorithm CHS is developed in this paper, with cooperative behavior being employed as a significant improvement to the performance of the original algorithm. Standard HS just uses one harmony memory and all the variables of the object function are improvised within the harmony memory, while the proposed algorithm CHS uses multiple harmony memories, so that each harmony memory can optimize different components of the solution vector. The CHS was then applied to function optimization problems. The results of the experiment show that CHS is capable of finding better solutions when compared to HS and a number of other algorithms, especially in high-dimensional problems.

Author: Gang Li and Qingzhong Wang

Source: https://www.hindawi.com/


Related documents