LAMARCKIAN LEARNING IN CLONAL SELECTION ALGORITHM FOR NUMERICAL OPTIMIZATION

• DOI: 10.1142/s0218213010000029
• Publication Date: 2010-02-25T11:01:10Z
• Authors: MAOGUO GONG; LICHENG JIAO; JIE YANG; FANG LIU
• Keywords: 0202 electrical engineering, electronic engineering, information engineering; 02 engineering and technology

In this paper, we introduce Lamarckian learning theory into the Clonal Selection Algorithm and propose a sort of Lamarckian Clonal Selection Algorithm, termed as LCSA. The major aim is to utilize effectively the information of each individual to reinforce the exploitation with the help of Lamarckian local search. Recombination operator and tournament selection operator are incorporated into LCSA to further enhance the ability of global exploration. We compare LCSA with the Clonal Selection Algorithm in solving twenty benchmark problems to evaluate the performance of LCSA. The results demonstrate that the Lamarckian local search makes LCSA more effective and efficient in solving numerical optimization problems.