基于可调变异算子求解遗传算法的欺骗问题  

A Solution to Deceptive Problems in Genetic Algorithm Based on an Adjustable Mutation Operator

作　　者：黄焱[1,2] 蒋培[1,2] 王嘉松[1,2] 杨敬安 

机构地区：[1]南京大学数学系 [2]合肥工业大学人工智能研究所

出　　处：《软件学报》1999年第2期216-219,共4页Journal of Software

摘　　要：针对遗传算法ＧＡ（ｇｅｎｅｔｉｃａｌｇｏｒｉｔｈｍ）欺骗问题的某些特点，从理论上对变异算子进行分析，提出了解决ＧＡ欺骗问题的一种新的方法．该算法能够在遗传搜索过程中改变变异算子的方向和概率，使变异算子可调，这样可以有效地消除遗传算法中的欺骗性条件，保持群体的多样性，使ＧＡ能顺利地收敛到全局最优解．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.

关 键 词：遗传算法 欺骗问题 可调变异算子 解 

分 类 号：O242.23[理学—计算数学] TP18[理学—数学]