An Efficient Adaptive Strategy for Melody Search Algorithm

Abstract

An efficient adaptive version of Melody Search algorithm (EAMS) is introduced in this study, which is a powerful tool to solve optimization problems in continuous domains. Melody search (MS) algorithm is a recent newly improved version of harmony search (HS), while the algorithm performance strongly depends on fine-tuning of its parameters. Although MS is more efficient for solving continuous optimization problems than most of other HS-based algorithms, the large number of algorithm parameters makes it difficult to use. Hence, the main objective in this study is to reduce the number of algorithm parameters and improving its efficiency. To achieve this, a novel improvisation scheme is introduced to generate new solutions, a useful procedure is developed to determine the possible variable ranges in different iterations and an adaptive strategy is employed to calculate proper parameters' values and choose suitable memory consideration rules during the evolution process. Extensive computational comparisons are carried out by employing a set of eighteen well-known benchmark optimization problems with various characteristics from the literature. The obtained results reveal that EAMS algorithm can achieve better solutions compared to some other HS variants, basic MS algorithms and certain cases of well-known robust optimization algorithms.