Abstract

This paper is concerned with the global adaptive harmony search (GAHS) algorithms for solving optimization problems. GAHS employs global information to the adaptive harmony search algorithm. The proposed GAHS algorithm is tested numerically and contrasted with improved harmony search (AHS) algorithm, and particle swarm optimization (PSO). Our simulation results reveal that GAHS is superior to AHS and PSO in terms of robustness and efficiency.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call