Abstract
The Harmony Search (HS) method is an emerging meta-heuristic optimization algorithm. In this chapter, we propose two modified HS methods to handle the multi-modal and constrained optimization problems. The first modified HS method employs a novel HS memory management approach to handle the multi-modal problems. The second modified HS method utilizes the Pareto-dominance technique, and it targets at the constrained problems. Several simulation examples are used to demonstrate and verify the effectiveness of our new HS methods.KeywordsHarmony SearchMulti-Modal OptimizationConstrained OptimizationArtificial Fish SwarmPareto Dominance
Published Version
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.
