摘要
针对遗传算法GA(geneticalgorithm)欺骗问题的某些特点,从理论上对变异算子进行分析,提出了解决GA欺骗问题的一种新的方法.该算法能够在遗传搜索过程中改变变异算子的方向和概率,使变异算子可调,这样可以有效地消除遗传算法中的欺骗性条件,保持群体的多样性,使GA能顺利地收敛到全局最优解.
In this paper, some characteristics of GA(genetic algorithm) deceptive problems are discussed, the performance of the mutation operators is analyzed theoretically, and a new method for solving GA deceptive problems is proposed. The proposed method can change the direction and the possibility of the mutation operators in the process of the genetic searching, making mutation operators adjustable. In this way, GAs can eliminate effectively their deceptive conditions, keep the diversity of population, and thereby converge conveniently on global solutions.
出处
《软件学报》
EI
CSCD
北大核心
1999年第2期216-219,共4页
Journal of Software