Lamarckian Polyclonal Programming Algorithm for Global Numerical Optimization

• Published in: Advances in Natural Computation pp. 931 - 940
• Main Authors: He, Wuhong, Du, Haifeng, Jiao, Licheng, Li, Jing
• Format: Book Chapter Conference Proceeding
• Language: English
• Published: Berlin, Heidelberg Springer Berlin Heidelberg 2005; Springer
• Series: Lecture Notes in Computer Science
• Subjects: Antibody Population; Applied sciences; Artificial intelligence; Benchmark Function; Computer science; control theory; systems; Exact sciences and technology; High Quality Solution; Numerical Optimization Problem; Successful Employee; Adaptive algorithm; Scalability; Problem solving; Global optimum; Numerical algorithm; Clone; Mathematical programming
• ISBN: 9783540283256; 3540283250; 3540283234; 9783540283232
• ISSN: 0302-9743; 1611-3349
• DOI: 10.1007/11539117_130

In this paper, Immune Clonal Selection theory and Lamarckism are integrated to form a new algorithm, Lamarckian Polyclonal Programming Algorithm (LPPA), for solving the global numerical optimization problem. The idea that Lamarckian evolution described how organism can evolve through learning, namely the point of “Gain and Convey” is applied, then this kind of learning mechanism is introduced into Adaptive Polyclonal Programming Algorithm (APPA). In the experiments, ten benchmark functions are used to test the performance of LPPA, and the scalability of LPPA along the problem dimension is studied with great care. The results show that LPPA achieves a good performance when the dimensions are increased from 20-10,000. Moreover, even when the dimensions are increased to as high as 10,000, LPPA still can find high quality solutions at a low computation cost. Therefore, LPPA has good scalability and is a competent algorithm for solving high dimensional optimization problems.