首页 | 本学科首页   官方微博 | 高级检索  
     

基于可调变异算子求解遗传算法的欺骗问题*
引用本文:黄 焱,蒋 培,王嘉松,杨敬安.基于可调变异算子求解遗传算法的欺骗问题*[J].软件学报,1999,10(2):216-219.
作者姓名:黄 焱  蒋 培  王嘉松  杨敬安
作者单位:1. 南京大学数学系,南京,210093
2. 合肥工业大学人工智能研究所,合肥,230009
摘    要:针对遗传算法GA(genetic algorithm)欺骗问题的某些特点,从理论上对变异算子进行分析,提出了解决GA欺骗问题的一种新的方法.该算法能够在遗传搜索过程中改变变异算子的方向和概率,使变异算子可调,这样可以有效地消除遗传算法中的欺骗性条件,保持群体的多样性,使GA能顺利地收敛到全局最优解.

关 键 词:遗传算法  欺骗问题  变异
收稿时间:1997/11/4 0:00:00
修稿时间:1998/2/11 0:00:00

A Solution to Deceptive Problems in Genetic Algorithm Based on an Adjustable Mutation Operator
HUANG Yan,JIANG Pei,WANG Jia-song and YANG Jing-an.A Solution to Deceptive Problems in Genetic Algorithm Based on an Adjustable Mutation Operator[J].Journal of Software,1999,10(2):216-219.
Authors:HUANG Yan  JIANG Pei  WANG Jia-song and YANG Jing-an
Affiliation:HUANG Yan 1 JIANG Pei 2 WANG Jia song 1 YANG Jing an 2 1(Department of Mathematics Nanjing University Nanjing 210093) 2(Institute of Artificial Intelligence Hefei University of Technology Hefei 230009)
Abstract: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.
Keywords:Genetic algorithm  deceptive problem  mutation
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号