A Kind of New Immune Genetic Algorithm and its Application


Article Preview

According to the phenomenon of falling into local optimum during solving large-scale optimization problems and the shortcomings of poor convergence of Immune Genetic Algorithm, a new kind of probability selection method based on the concentration for the genetic operation is presented. Considering the features of chaos optimization method, such like not requiring the solved problems with continuity or differentiability, which is unlike the conventional method, and also with a solving process within a certain range traverse in order to find the global optimal solution, a kind of Chaos Immune Genetic Algorithm based on Logistic map and Hénon map is proposed. Through the application to TSP problem, the results have showed the superior to other algorithms.



Edited by:

Zhixiang Hou






W. J. Ren et al., "A Kind of New Immune Genetic Algorithm and its Application", Applied Mechanics and Materials, Vols. 48-49, pp. 25-28, 2011

Online since:

February 2011




[1] Zhang Guangyu, Guo Pengfei, Wang Peng, in: Present and Forecast of Immune Genetic Algorithm[J]. Journal of Liaoning Institute of Technology, 2007, 26(6): 375~379.

[2] Liu Minghui, Li Weiji, in: On Improvements of Immune Genetic Algorithm and Its Application in Structure Design[J]. Journal of Shanxi University of Technology, 2006, 22(1): 42~47.

[3] Wang Qiwen, Chen Shaoying, in: Research on Chaos[J]. Journal of Hulunbeir College, 2005, 13(6): 41~44.

[4] Wen Qingfang, in: Realization of MATLAB on resolving the traveling salesman problem by virtue of genetic algorithms [J]. Journal of Shaoguan University, 2007, 28(6): 18~22.

[5] Zheng Jiangang, Wang Xingyu, in: DNA-Immune-Genetic Algorithm Based on Information Entropy[J]. Computer Simulation, 2006, 23(6): 165~208.

In order to see related information, you need to Login.