Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11861/7547
DC FieldValueLanguage
dc.contributor.authorWong, Ka-Chunen_US
dc.contributor.authorProf. LEUNG Kwong Saken_US
dc.contributor.authorWong, Man-Honen_US
dc.date.accessioned2023-03-23T04:31:03Z-
dc.date.available2023-03-23T04:31:03Z-
dc.date.issued2009-
dc.identifier.citationProceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009, pp. 923 - 930en_US
dc.identifier.isbn978-160558325-9-
dc.identifier.urihttp://hdl.handle.net/20.500.11861/7547-
dc.description.abstractThis paper presents an evolutionary algorithm, which we call Evolutionary Algorithm with Species-specific Explosion (EASE), for multimodal optimization. EASE is built on the Species Conserving Genetic Algorithm (SCGA), and the design is improved in several ways. In particular, it not only identifies species seeds, but also exploits the species seeds to create multiple mutated copies in order to further converge to the respective optimum for each species. Experiments were conducted to compare EASE and SCGA on four benchmark functions. Cross-comparison with recent rival techniques on another five benchmark functions was also reported. The results reveal that EASE has a competitive edge over the other algorithms tested. Copyright 2009 ACM.en_US
dc.language.isoenen_US
dc.relation.ispartofProceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009en_US
dc.titleAn evolutionary algorithm with species-specific explosion for multimodal optimizationen_US
dc.typeConference Paperen_US
dc.identifier.doi10.1145/1569901.1570027-
item.fulltextNo Fulltext-
crisitem.author.deptDepartment of Applied Data Science-
Appears in Collections:Applied Data Science - Publication
Show simple item record

SCOPUSTM   
Citations

21
checked on Nov 17, 2024

Page view(s)

34
Last Week
0
Last month
checked on Nov 21, 2024

Google ScholarTM

Impact Indices

Altmetric

PlumX

Metrics


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