Abstract | ||
---|---|---|
Harmony Search is a new metaheuristic technique that uses fixed improvisation based on music to solve hard problems. We propose in this paper a new method to dynamically control and adapt the improvisation for Harmony Search. The key idea is to adapt the improvisation according to the search evaluation. Our solution provides best results at an affordable computational cost. We illustrate our proposal using the well-known Multidimentional Knapsack Problem, and compare our results with existing Harmony Search algorithms. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1109/CSE.2013.86 | Computational Science and Engineering |
Keywords | Field | DocType |
harmony search algorithm,hard problem,harmony search,well-known multidimentional knapsack problem,on-line control,improve harmony search,best result,search evaluation,affordable computational cost,new metaheuristic technique,key idea,new method,new components,control | Incremental heuristic search,Algorithm design,Improvisation,Computer science,Beam search,Continuous knapsack problem,Harmony search,Artificial intelligence,Knapsack problem,Machine learning,Metaheuristic | Conference |
ISSN | Citations | PageRank |
1949-0828 | 0 | 0.34 |
References | Authors | |
6 | 4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Nicolás Rojas | 1 | 47 | 15.56 |
María Cristina Riff | 2 | 200 | 23.91 |
Xavier Bonnaire | 3 | 85 | 11.88 |
Elizabeth Montero | 4 | 69 | 10.14 |