Meta-optimization of harmony search

In the field of optimization meta-heuristics they have repeatedly demonstrated their abilities as numerical methods appliedin the resolution of their associated models. However, the performance of these methods suffers froma strong dependence on instancesor values assigned toits parameters. This paper presents the implementation the implementation of a proposalthat allows the optimal instantiation Harmony Search Algorithm parameters in conjunction with the generation of information about their behavioris. The results obtained in this study are important and relevant as showing that the parameter settings calculated by the proposal meta-optimizing here implemented provided the Harmony Search Algorithm the ability to solve instances of problems treated with high levels of efficiency and effectiveness.