A novel and effective algorithm for numerical optimization: Melody Search (MS)
Authors:
- 1 December 2011
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 109-114
Abstract
This paper introduces Melody Search Algorithm which is an innovative optimization algorithm, inspired by basic concepts applied in Harmony Search algorithm. The new algorithm mimics performance processes of the group improvisation for finding the best succession of pitches in a melody. Utilizing different player memories and their interactive process, makes the algorithm very capable while, the possible range of variables can be varied going through the algorithm iterations. In order to show the performance of the new algorithm, it is successfully applied to various benchmarking optimization problems. Numerical results reveal that the proposed algorithm is capable of finding better solutions when compared with well-known GA, PSO, PS-EA, ABC and HS algorithms.Keywords
This publication has 7 references indexed in Scilit:
- Novel global harmony search algorithm for unconstrained problemsNeurocomputing, 2010
- A self-adaptive global best harmony search algorithm for continuous optimization problemsApplied Mathematics and Computation, 2010
- Global-best harmony searchApplied Mathematics and Computation, 2008
- An improved harmony search algorithm for solving optimization problemsApplied Mathematics and Computation, 2007
- A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithmJournal of Global Optimization, 2007
- 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