Evolutionary Algorithm Based on Chaos Mutation and Immune Selection
In order to keep the populations diversity, avoid local optimization and improve performance of evolutionary algorithm, a chaos immune evolutionary algorithm is presented. The over-spread character of chaos sequence was used to overcome redundancies, and the chaos initial value sensitivity was used to enlarge the searching space. At the same time, an immune selection operator was used to adjust the density, and vaccinations were used to exert the advantage of individuals. The experimental results show that the algorithm has good performance in the aspects of both convergence speed and the global convergence.
Immune Chaos Evolutionary Algorithm and Initial Value Sensitivity
Nan Zhang Jianhua Zhang Zhishu Li Xianze Yang Bing Wu Chunchang Fu
School of Computer Science and Technology, Southwest University for Nationalities Chengdu, 610041, C School of Computer, Sichuan University Chengdu, 610065, China
国际会议
杭州
英文
418-422
2006-10-12(万方平台首次上网日期,不代表论文的发表时间)