Abstract
Harmony search (HS) is a novel heuristic algorithm that imitates the improvisation process of musicians. The feasibility of HS algorithm has already been proven on several benchmark problems. In this paper, HS is proposed to solve Loney's solenoid problem. To further enhance the convergence efficiency of HS, the improvisation with a Gaussian factor is employed. The newly developed algorithm, which is named Gaussian HS (GHS), can succeed in solving Loney's solenoid problem according to the numerical simulations. Comparative results show that our proposed GHS outperforms HS and particle swarm optimization in both the convergence speed 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.
