Deterministic Parameter Control in Harmony Search

Ren Diao, Qiang Shen

Research output: Chapter in Book/Report/Conference proceedingConference Proceeding (Non-Journal item)

3 Citations (Scopus)
127 Downloads (Pure)

Abstract

Harmony search is a recently developed meta heuristic capable of solving discrete and continuous valued optimisation problems. However, the nature of pre-defined constant parameters limits the exploitation of the algorithm. This paper proposes a number of deterministic parameter control rules to fine-tune these parameters individually and dynamically, making Harmony Search a more dynamic algorithm which is able to achieve better results. A combined approach that implements all the proposed rules is then applied to various benchmarks and engineering problems. Experimental results reveal that the combined approach can find better solutions when compared to the original harmony search and several other heuristics, making harmony search a strong mechanism to perform optimisation tasks.
Original languageEnglish
Title of host publication2010 UK Workshop on Computational Intelligence (UKCI)
ISBN (Electronic)978-1-4244-8773-8
DOIs
Publication statusPublished - Sept 2010
Event2010 UK Workshop on Computational Intelligence - Colchester, United Kingdom of Great Britain and Northern Ireland
Duration: 08 Sept 201010 Sept 2010

Conference

Conference2010 UK Workshop on Computational Intelligence
Country/TerritoryUnited Kingdom of Great Britain and Northern Ireland
CityColchester
Period08 Sept 201010 Sept 2010

Fingerprint

Dive into the research topics of 'Deterministic Parameter Control in Harmony Search'. Together they form a unique fingerprint.

Cite this