A study of harmony search algorithms: Exploration and convergence ability

Abstract

Harmony Search Algorithm (HSA) has shown to be simple, efficient and strong optimization algorithm. The exploration ability of any optimization algorithm is one of the key points. In this article a new methodology is proposed to measure the exploration ability of the HS algorithm. To understand the searching ability potential exploration range for HS algorithm is designed. Four HS variants are selected and their searching ability is tested based on the choice of improvised harmony. An empirical analysis of the proposed method is tested along with the justification of theoretical findings and experimental results.