Show simple item record

dc.contributor.authorFourie, Jacoen
dc.contributor.authorGreen, R.en
dc.contributor.authorGeem, Z. W.en
dc.date.accessioned2017-06-23T04:49:28Z
dc.date.issued2013en
dc.identifier.citationFourie, J., Green, R., & Geem, Z.W. (2013). Generalised adaptive harmony search: a comparative analysis of modern harmony search. Journal of Applied Mathematics, 2013(380985). doi:10.1155/2013/380985en
dc.identifier.issn1110-757Xen
dc.identifier.urihttps://hdl.handle.net/10182/8224
dc.description.abstractHarmony search (HS) was introduced in 2001 as a heuristic population-based optimisation algorithm. Since then HS has become a popular alternative to other heuristic algorithms like simulated annealing and particle swarm optimisation. However, some flaws, like the need for parameter tuning, were identified and have been a topic of study for much research over the last 10 years. Many variants of HS were developed to address some of these flaws, and most of them have made substantial improvements. In this paper we compare the performance of three recent HS variants: exploratory harmony search, self-adaptive harmony search, and dynamic local-best harmony search. We compare the accuracy of these algorithms, using a set of well-known optimisation benchmark functions that include both unimodal and multimodal problems. Observations from this comparison led us to design a novel hybrid that combines the best attributes of these modern variants into a single optimiser called generalised adaptive harmony search.en
dc.format.extent13en
dc.language.isoenen
dc.publisherHindawi Publishing Corporationen
dc.relationThe original publication is available from - Hindawi Publishing Corporation - https://doi.org/10.1155/2013/380985 - https://www.hindawi.com/journals/jam/2013/380985/en
dc.relation.urihttps://doi.org/10.1155/2013/380985en
dc.rightsCopyright © 2013 Jaco Fourie et al. This is an open access article distributed under the Creative Commons Attribution License,which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.en
dc.rightsAttribution-NonCommercial-ShareAlike 4.0 International*
dc.subjectalgorithmen
dc.subjectharmony searchen
dc.subjectexploratory harmony searchen
dc.subjectself-adaptive harmony searchen
dc.subjectdynamic local-best harmony searchen
dc.subjectApplied Mathematicsen
dc.titleGeneralised adaptive harmony search: A comparative analysis of modern harmony searchen
dc.typeJournal Article
lu.contributor.unitLincoln Universityen
lu.contributor.unitLincoln Agritechen
dc.identifier.doi10.1155/2013/380985en
dc.subject.anzsrc0102 Applied Mathematicsen
dc.subject.anzsrc0103 Numerical and Computational Mathematicsen
dc.relation.isPartOfJournal of Applied Mathematicsen
pubs.notesArticle ID 380985 Accepted 22 Mar 2013en
pubs.organisational-group/LU
pubs.organisational-group/LU/Lincoln Agritech
pubs.organisational-group/LU/Research Management Office
pubs.organisational-group/LU/Research Management Office/QE18
pubs.publication-statusPublisheden
pubs.publisher-urlhttps://www.hindawi.com/journals/jam/2013/380985/en
pubs.volume2013en
dc.identifier.eissn1687-0042en
lu.identifier.orcid0000-0002-7734-8262


Files in this item

Default Thumbnail

This item appears in the following Collection(s)

Show simple item record