Study on a Novel Crowding Niche Genetic Algorithm
This paper proposes a new crowding niche genetic algorithm to make up the shortages of bad stability, poor local search ability, and inferior universality in conventional crowding niche genetic algorithms. The new algorithm develops a new crowding strategy based on the most similar individuals to maintain the population diversity, designs an improved mutation probability adaptive adjustment method in accordance with the change law of sigmoid function curve to accelerate the convergence speed, and introduces the gradient operator into computation process to enhance the local search capability. Four typical complex functions are selected as test functions and two conventional algorithms are applied as contrast algorithms to assess the performance of algorithm. Test experiments and comparative analysis show that the proposed algorithm has an outstanding performance for maintaining population diversity; it is very effective and universal for solving complex problems. The new algorithm generally outperforms conventional crowding niche genetic algorithms.
minimum Euclidean distance gradient adaptive mutation crowding niche genetic algorithm
Zhang Hu Zhang Yi Lu Chao Han Jun
Hubei Key Laboratory of Hydroelectric Machinery Design & Maintenance China Three Gorges University Yichang 443002, China
国际会议
武汉
英文
238-241
2011-08-20（万方平台首次上网日期，不代表论文的发表时间）