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.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
