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.
Original language | English |
---|---|
Pages | 538-544 |
Number of pages | 7 |
DOIs | |
Publication status | Published - 1 Dec 2013 |
Event | 2013 16th IEEE International Conference on Computational Science and Engineering, CSE 2013 - Sydney, NSW, Australia Duration: 3 Dec 2013 → 5 Dec 2013 |
Conference
Conference | 2013 16th IEEE International Conference on Computational Science and Engineering, CSE 2013 |
---|---|
Country/Territory | Australia |
City | Sydney, NSW |
Period | 3/12/13 → 5/12/13 |
Keywords
- Control
- Harmony Search
- Multidimensional Knapsack Problems
ASJC Scopus subject areas
- Computer Science (miscellaneous)