Abstract
Harmony search (HS) algorithm is a good meta-heuristic intelligent optimization method, which has been paid much attention recently. However, intelligent optimization methods are easily trapped into local optima, HS is no exception. In order to improve the performance of HS, a new variant of harmony search algorithm with random mutation strategy (HSRM) is proposed in this paper. The HSRM uses a random mutation strategy to replace the pitch adjusting operation, and dynamically adjust the key parameter pitch adjusting rate (PAR). Experiment results demonstrated that the proposed method is superior to the HS and recently developed variants (IHS, and GHS) and other meta-heuristic algorithm.
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.
