Lamarckian evolution in global optimization

Ko-Hsin LIANG, Xin YAO, C. NEWTON

Research output: Book Chapters | Papers in Conference ProceedingsConference paper (refereed)Researchpeer-review

8 Citations (Scopus)

Abstract

Lamarckian evolution explains how an individual's ability of learning can help to guide the evolutionary process. Performing a local search is regarded as a learning process for an individual. We propose the concept of re-learning based on Lamarckian evolution. After all individuals have learned, the local search information is then collected for a second learning process using approximation techniques. Under the situation of using quadratic approximation, we mathematically analyze the basic algorithm developed under this concept. We also develop a novel algorithm based on the basic algorithm and the analysis results. The experimental results show that the algorithm can provide a more reliable and efficient performance on high dimensional multimodal problems. © 2000 IEEE.
Original languageEnglish
Title of host publicationIECON Proceedings (Industrial Electronics Conference)
PublisherIEEE Computer Society
Pages2975-2980
Number of pages6
Volume1
DOIs
Publication statusPublished - 11 Nov 2002
Externally publishedYes

Fingerprint

Dive into the research topics of 'Lamarckian evolution in global optimization'. Together they form a unique fingerprint.

Cite this