DC FieldValueLanguage
dc.contributorDepartment of Civil and Environmental Engineeringen_US
dc.creatorWang, WCen_US
dc.creatorXu, Len_US
dc.creatorChau, KWen_US
dc.creatorXu, DMen_US
dc.date.accessioned2021-06-23T07:38:21Z-
dc.date.available2021-06-23T07:38:21Z-
dc.identifier.issn0957-4174en_US
dc.identifier.urihttp://hdl.handle.net/10397/90358-
dc.language.isoenen_US
dc.publisherPergamon Pressen_US
dc.subjectCauchy mutationen_US
dc.subjectCEC 2013 benchmark functionsen_US
dc.subjectEngineering optimization problemsen_US
dc.subjectGNS strategyen_US
dc.subjectRandom attraction modelen_US
dc.subjectYin-Yang firefly algorithmen_US
dc.titleYin-Yang firefly algorithm based on dimensionally Cauchy mutationen_US
dc.typeJournal/Magazine Articleen_US
dc.identifier.volume150en_US
dc.identifier.doi10.1016/j.eswa.2020.113216en_US
dcterms.abstractFirefly algorithm (FA) is a classical and efficient swarm intelligence optimization method and has a natural capability to address multimodal optimization. However, it suffers from premature convergence and low stability in the solution quality. In this paper, a Yin-Yang firefly algorithm (YYFA) based on dimensionally Cauchy mutation is proposed for performance improvement of FA. An initial position of fireflies is specified by the good nodes set (GNS) strategy to ensure the spatial representativeness of the firefly population. A designed random attraction model is then used in the proposed work to reduce the time complexity of the algorithm. Besides, a key self-learning procedure on the brightest firefly is undertaken to strike a balance between exploration and exploitation. The performance of the proposed algorithm is verified by a set of CEC 2013 benchmark functions used for the single objective real parameter algorithm competition. Experimental results are compared with those of other the state-of-the-art variants of FA. Nonparametric statistical tests on the results demonstrate that YYFA provides highly competitive performance in terms of the tested algorithms. In addition, the application in constrained engineering optimization problems shows the practicability of YYFA algorithm.en_US
dcterms.accessRightsembargoed accessen_US
dcterms.bibliographicCitationExpert systems with applications, July 2020, v. 150, 113216en_US
dcterms.isPartOfExpert systems with applicationsen_US
dcterms.issued2020-07-
dc.identifier.scopus2-s2.0-85079320597-
dc.identifier.eissn1873-6793en_US
dc.identifier.artn113216en_US
dc.description.validate202106 bchyen_US
dc.description.oaNot applicableen_US
dc.identifier.FolderNumbera0938-n02-
dc.identifier.SubFormID2181-
dc.description.fundingSourceRGCen_US
dc.description.fundingText25202719en_US
dc.description.pubStatusPublisheden_US
dc.date.embargo2022.07.15en_US
Appears in Collections:Journal/Magazine Article
Access
View full-text via PolyU eLinks SFX Query
Show simple item record

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.