Adaptive harmony search algorithm utilizing differential evolution and opposition-based learning

An adaptive harmony search algorithm utilizing differential evolution and opposition based learning (AHS-DE-OBL) is proposed to overcome the drawbacks of the harmony search (HS) algorithm, such as its low fine-tuning ability, slow convergence speed, and easily falling into a local optimum. In AHS-DE-OBL, three main innovative strategies are adopted. First, inspired by the differential evolution algorithm, the differential harmonies in the population are used to randomly perturb individuals to improve the fine-tuning ability. Then, the search domain is adaptively adjusted to accelerate the algorithm convergence. Finally, an opposition-based learning strategy is introduced to prevent the algorithm from falling into a local optimum. The experimental results show that the proposed algorithm has a better global search ability and faster convergence speed than other selected improved harmony search algorithms and selected metaheuristic approaches.

Automated summary

The AHS-DE-OBL algorithm proposed in this study utilizes innovative strategies such as differential evolution, adaptive adjustment of search domain, and opposition-based learning to improve upon the limitations of the harmony search algorithm, resulting in better global search ability and faster convergence speed.