An elite decision making harmony search algorithm for optimization problem

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper describes a new variant of harmony search algorithm which is inspired by a well-known item "elite decision making". In the new algorithm, the good information captured in the current global best and the second best solutions can be well utilized to generate new solutions, following some probability rule. The generated new solution vector replaces the worst solution in the solution set, only if its fitness is better than that of the worst solution. The generating and updating steps and repeated until the near-optimal solution vector is obtained. Extensive computational comparisons are carried out by employing various standard benchmark optimization problems, including continuous design variables and integer variables minimization problems from the literature. The computational results show that the proposed new algorithm is competitive in finding solutions with the state-of-the-art harmony search variants. Copyright © 2012 Lipu Zhang et al.

Cite

CITATION STYLE

APA

Zhang, L., Xu, Y., & Liu, Y. (2012). An elite decision making harmony search algorithm for optimization problem. Journal of Applied Mathematics, 2012. https://doi.org/10.1155/2012/860681

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free