A local-best harmony search algorithm with dynamic subpopulations

Thumbnail
Date
2010
Author
Pan, Q.K.
Suganthan, P.N.
Liang, J.J.
Tasgetiren, M.F.
Metadata
Show full item record
Abstract
This article presents a local-best harmony search algorithm with dynamic subpopulations (DLHS) for solving the bound-constrained continuous optimization problems. Unlike existing harmony search algorithms, the DLHS algorithm divides the whole harmony memo
URI
https://www.scopus.com/inward/record.uri?eid=2-s2.0-77951136650&doi=10.1080%2f03052150903104366&partnerID=40&md5=37fd6b7cdc519789540b2ad4586f54fa
https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10683
Collections