摘要
A modified algorithm which realized the tent map on the computer was proposed to deal effectively with the problem of fixed point and the small periodic of the tent map, which affected by the finite word-length of computer. The chaos research algorithm based on the modified Tent map was introduced to the multi-objective genetic algorithm. Firstly, the chaos sequence was applied to assign the initial population value to enhance the convergence ability. Then, the chaos search optimization algorithm was adopted to improve the diversity of the population. The benchmark problems were tested by the basic and the modified algorithm respectively. The statistical results show that the improved algorithm could seek the solution more efficiently, and achieve better convergence and diversity than basic NSGA-II.
源语言 | 英语 |
---|---|
页(从-至) | 1010-1016 |
页数 | 7 |
期刊 | Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics |
卷 | 38 |
期 | 8 |
出版状态 | 已出版 - 8月 2012 |