A New Harmony Memory Updating Technique for Harmony Search Optimization Algorithm

Abstract

The paper aims to introduce an innovative method for updating of the harmony
memory. In this manner, the aim of the research is to create modification of the
harmony search or HS algorithm. The potential advantage of this technique is that
compared to the basic technique, the amount of evaluations pertaining to the HS
algorithm for objective function of the HS algorithm are reduced significantly. The new
method is superior to the old one in terms of maximum number of improvisations and
subsequent to it, fast performance convergence. Compared to the older version, the new
method was found to be more effective when assessed by four renowned functions
usually used as test problems to detect performance among optimization algorithms.