A self-adaptive global best harmony search algorithm for continuous optimization problems

dc.contributor.author	Pan, Q.K.
dc.contributor.author	Suganthan, P.N.
dc.contributor.author	Tasgetiren, M.F.
dc.contributor.author	Liang, J.J.
dc.date.accessioned	2021-01-25T20:51:39Z
dc.date.available	2021-01-25T20:51:39Z
dc.date.issued	2010
dc.identifier	10.1016/j.amc.2010.01.088
dc.identifier.issn	00963003
dc.identifier.uri	https://www.scopus.com/inward/record.uri?eid=2-s2.0-77949490771&doi=10.1016%2fj.amc.2010.01.088&partnerID=40&md5=b934b6c6a57f8f627acd56595b7e66b6
dc.identifier.uri	https://dspace.yasar.edu.tr/xmlui/handle/20.500.12742/10680
dc.description.abstract	This paper presents a self-adaptive global best harmony search (SGHS) algorithm for solving continuous optimization problems. In the proposed SGHS algorithm, a new improvisation scheme is developed so that the good information captured in the current glob
dc.language.iso	English
dc.publisher	Applied Mathematics and Computation
dc.title	A self-adaptive global best harmony search algorithm for continuous optimization problems
dc.type	Article
dc.relation.firstpage	830
dc.relation.lastpage	848
dc.relation.volume	216
dc.relation.issue	3
dc.description.affiliations	College of Computer Science, Liaocheng University, Liaocheng, 252059, China; School of Electrical and Electronic Engineering, Nanyang Technological University, 50 Nanyang Ave, 639798 Singapore, Singapore; Department of Industrial Engineering, Yasar Univer

Bu öğenin dosyaları:

Dosyalar	Boyut	Biçim	Göster
Bu öğe ile ilişkili dosya yok.