A Novel Multi-Objective Harmony Search Algorithm with Pitch Adjustment by Genotype

In this work, a new version of the Harmony Search algorithm for solving multi-objective optimization problems is proposed, MOHSg, with pitch adjustment using genotype. The main contribution consists of adjusting the pitch using the crowding distance by genotype; that is, the distancing in the search space. This adjustment automatically regulates the exploration-exploitation balance of the algorithm, based on the distribution of the harmonies in the search space during the formation of Pareto fronts. Therefore, MOHSg only requires the presetting of the harmony memory accepting rate and pitch adjustment rate for its operation, avoiding the use of a static bandwidth or dynamic parameters. MOHSg was tested through the execution of diverse test functions, and it was able to produce results similar or better than those generated by algorithms that constitute search variants of harmonies, representative of the state-of-the-art in multi-objective optimization with HS.

Automated summary

The MOHSg algorithm proposes a new method for pitch adjustment using genotype, which automatically regulates the exploration-exploitation balance based on the distribution of harmonies in the search space. The algorithm performs well in solving multi-objective optimization problems, producing results similar or better than state-of-the-art algorithms in this field.