World Scientific
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×

System Upgrade on Tue, May 28th, 2024 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at customercare@wspc.com for any enquiries.

LAMARCKIAN LEARNING IN CLONAL SELECTION ALGORITHM FOR NUMERICAL OPTIMIZATION

    https://doi.org/10.1142/S0218213010000029Cited by:8 (Source: Crossref)

    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.