Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.11861/7612
DC FieldValueLanguage
dc.contributor.authorProf. LEUNG Kwong Saken_US
dc.contributor.authorLiang, Yongen_US
dc.date.accessioned2023-03-27T04:48:26Z-
dc.date.available2023-03-27T04:48:26Z-
dc.date.issued2004-
dc.identifier.citationInternational Conference on Intelligent Data Engineering and Automated Learning, 2004, pp. 303 - 312.en_US
dc.identifier.isbn9783540405504-
dc.identifier.urihttp://hdl.handle.net/20.500.11861/7612-
dc.description.abstractThrough identifying the main causes of low efficiency of the currently known evolutionary algorithms for difficult function optimization problem, the complementary efficiency speed-up strategy - Fourier series auxiliary function technique is suggested, analyzed, and partially explored. The Fourier series auxiliary function could guide an algorithm to search for optima with small attraction basins efficiently. Incorporation of this technique with any known evolutionary algorithm leads to an accelerated version of the algorithm for the difficult function optimization. As a case study, the developed technique has been incorporated with evolution strategies (ES), yielding accelerated Fourier series auxiliary function evolution strategies: the FES. The experiments demonstrate that the FES consistently outperforms the standard ES in efficiency and solution quality. © Springer-Verlag 2003.en_US
dc.language.isoenen_US
dc.titleEvolution strategies with a fourier series auxiliary function for difficult function optimizationen_US
dc.typeConference Paperen_US
dc.relation.conferenceInternational Conference on Intelligent Data Engineering and Automated Learningen_US
dc.identifier.doi10.1007/978-3-540-45080-1_40-
item.fulltextNo Fulltext-
crisitem.author.deptDepartment of Applied Data Science-
Appears in Collections:Publication
Show simple item record

Page view(s)

17
checked on Jan 3, 2024

Google ScholarTM

Impact Indices

Altmetric

PlumX

Metrics


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