Lamarckian memetic algorithms : local optimum and connectivity structure analysis
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 co...
Saved in:
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/147981 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-147981 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1479812021-04-16T02:43:59Z Lamarckian memetic algorithms : local optimum and connectivity structure analysis Le, Minh Nghia Ong, Yew-Soon Jin, Yaochu Sendhoff, Bernhard School of Computer Science and Engineering Engineering::Computer science and engineering Memetic Algorithms Lamarckian Evolution 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. Accepted version M.N. Le is grateful for the financial support from Honda Research Institute Europe. 2021-04-16T02:43:59Z 2021-04-16T02:43:59Z 2009 Journal Article 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 1865-9284 https://hdl.handle.net/10356/147981 10.1007/s12293-009-0016-9 2-s2.0-77951287415 3 1 175 190 en Memetic Computing © 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. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Computer science and engineering Memetic Algorithms Lamarckian Evolution |
spellingShingle |
Engineering::Computer science and engineering Memetic Algorithms Lamarckian Evolution Le, Minh Nghia Ong, Yew-Soon Jin, Yaochu Sendhoff, Bernhard Lamarckian memetic algorithms : local optimum and connectivity structure analysis |
description |
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. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Le, Minh Nghia Ong, Yew-Soon Jin, Yaochu Sendhoff, Bernhard |
format |
Article |
author |
Le, Minh Nghia Ong, Yew-Soon Jin, Yaochu Sendhoff, Bernhard |
author_sort |
Le, Minh Nghia |
title |
Lamarckian memetic algorithms : local optimum and connectivity structure analysis |
title_short |
Lamarckian memetic algorithms : local optimum and connectivity structure analysis |
title_full |
Lamarckian memetic algorithms : local optimum and connectivity structure analysis |
title_fullStr |
Lamarckian memetic algorithms : local optimum and connectivity structure analysis |
title_full_unstemmed |
Lamarckian memetic algorithms : local optimum and connectivity structure analysis |
title_sort |
lamarckian memetic algorithms : local optimum and connectivity structure analysis |
publishDate |
2021 |
url |
https://hdl.handle.net/10356/147981 |
_version_ |
1698713637278973952 |