Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/147981
Title: Lamarckian memetic algorithms : local optimum and connectivity structure analysis
Authors: Le, Minh Nghia
Ong, Yew-Soon
Jin, Yaochu
Sendhoff, Bernhard
Keywords: Engineering::Computer science and engineering
Issue Date: 2009
Source: Le, M. N., Ong, Y., Jin, Y. & Sendhoff, B. (2009). Lamarckian memetic algorithms : local optimum and connectivity structure analysis. Memetic Computing, 1(3), 175-190. https://dx.doi.org/10.1007/s12293-009-0016-9
Journal: Memetic Computing
Abstract: Memetic algorithms (MAs) represent an emerging field that has attracted increasing research interest in recent times. Despite the popularity of the field, we remain to know rather little of the search mechanisms of MAs. Given the limited progress made on revealing the intrinsic properties of some commonly used complex benchmark problems and working mechanisms of Lamarckian memetic algorithms in general non-linear programming, we introduce in this work for the first time the concepts of local optimum structure and generalize the notion of neighborhood to connectivity structure for analysis of MAs. Based on the two proposed concepts, we analyze the solution quality and computational efficiency of the core search operators in Lamarckian memetic algorithms. Subsequently, the structure of local optimums of a few representative and complex benchmark problems is studied to reveal the effects of individual learning on fitness landscape and to gain clues into the success or failure of MAs. The connectivity structure of local optimum for different memes or individual learning procedures in Lamarckian MAs on the benchmark problems is also investigated to understand the effects of choice of memes in MA design.
URI: https://hdl.handle.net/10356/147981
ISSN: 1865-9284
DOI: 10.1007/s12293-009-0016-9
Rights: © 2009 Springer-Verlag. This is a post-peer-review, pre-copyedit version of an article published in Memetic Computing. The final authenticated version is available online at: http://dx.doi.org/10.1007/s12293-009-0016-9.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Journal Articles

Files in This Item:
File Description SizeFormat 
Lamarckian memetic algorithms local optimum and connectivity structure analysis.pdf644.4 kBAdobe PDFView/Open

Page view(s)

99
Updated on May 17, 2022

Download(s)

11
Updated on May 17, 2022

Google ScholarTM

Check

Altmetric


Plumx

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.