Harmony Search as a Metaheuristic Algorithm
Author:
Preprint
Abstract
This first chapter intends to review and analyze the powerful new Harmony Search (HS) algorithm in the context of metaheuristic algorithms. I will first outline the fundamental steps of Harmony Search, and how it works. I then try to identify the characteristics of metaheuristics and analyze why HS is a good meta-heuristic algorithm. I then review briefly other popular metaheuristics such as par-ticle swarm optimization so as to find their similarities and differences from HS. Finally, I will discuss the ways to improve and develop new variants of HS, and make suggestions for further research including open questions.Keywords
All Related Versions
This publication has 11 references indexed in Scilit:
- Global-best harmony searchApplied Mathematics and Computation, 2008
- On the performance of artificial bee colony (ABC) algorithmApplied Soft Computing, 2008
- An adaptive heuristic cross-entropy algorithm for optimal design of water distribution systemsEngineering Optimization, 2007
- Optimal cost design of water distribution networks using harmony searchEngineering Optimization, 2006
- Nonlinear inertia weight variation for dynamic adaptation in particle swarm optimizationComputers & Operations Research, 2006
- Ant colony optimization theory: A surveyTheoretical Computer Science, 2005
- A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practiceComputer Methods in Applied Mechanics and Engineering, 2005
- A New Heuristic Optimization Algorithm: Harmony SearchSIMULATION, 2001
- Genetic Algorithms + Data Structures = Evolution ProgramsJournal of the American Statistical Association, 2000
- No free lunch theorems for optimizationIEEE Transactions on Evolutionary Computation, 1997