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

一类自适应遗传算法
引用本文:孙建永,申建中,徐宗本. 一类自适应遗传算法[J]. 西安交通大学学报, 2000, 34(10): 84-88
作者姓名:孙建永  申建中  徐宗本
作者单位:西安交通大学,710049,西安
摘    要:简要介绍了徐宗本教授新近提出的可分解/可拼接遗传算法编码,并证明了一个得用对偶适应函数判定已知个体是否为相对全局最优解的判据,基于新的编码与判据,分别在种群层次与基因层次发展了动态变异与动态选择操作,进而提出了一类自适应遗传算法,对其原理的分析表明,新算法可用于求解所给问题的任意精度解,且在很大程度上可避免遗传算法早熟现象,此工作是对模拟演化自适应计算技术的有效探索。

关 键 词:可分解 可拼接编码 对偶适应函数 遗传算法

New Adaptive Genetic Algorithm
Sun Jianyong,Shen Jianzhong,Xu Zongben. New Adaptive Genetic Algorithm[J]. Journal of Xi'an Jiaotong University, 2000, 34(10): 84-88
Authors:Sun Jianyong  Shen Jianzhong  Xu Zongben
Abstract:Self adaption is one of the most promising areas of research in the evolutionary computation. The splicing/decomposible encoding scheme proposed by Xu et al is applied to the construction of dynamic selection and mutation operators that were built respectively on the levels of genotype and phonotype of population. A completely new adaptive genetic algorithm is thus developed. The analysis of the principle indicates that the new algorithm can obtain the arbitary resolution of the given problems and can avoid the premature convergence of the genetic algorithm in a great extent. It is a profitable research of the adaptive computation technology.
Keywords:splicing/decomposible encoding  dynamic selection  dynamic mutation  dual fitness function  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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