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

位重要性进化算法
引用本文:洪毅,任庆生,曾进.位重要性进化算法[J].计算机学报,2006,29(6):992-997.
作者姓名:洪毅  任庆生  曾进
作者单位:1. 上海交通大学计算机科学与工程系,上海,200030
2. 上海交通大学数学系,上海,200030
摘    要:研究了遗传算法中的位重要性和位收敛顺序性,给出了重要位、模式、参数区间和目标函数四者之间的关系,提出了一种新的进化算法——位重要性进化算法(Bit Importance Evolutionary Algorithm,BIEA).BIEA通过检测组成个体各位的重要性,对于重要位,加快其收敛;对于非重要位,保持其多样性.数据实验表明:BIEA在收敛速度上要优于遗传算法,同时BIEA也可以有效地解决一类遗传算法很难解决的强欺骗性问题.

关 键 词:遗传算法  概率分布估计算法  位重要性  模式  位重要性进化算法
收稿时间:2004-07-28
修稿时间:2004-07-282006-03-26

Bit Importance Evolutionary Algorithm
HONG Yi,REN Qing-Sheng,ZENG Jin.Bit Importance Evolutionary Algorithm[J].Chinese Journal of Computers,2006,29(6):992-997.
Authors:HONG Yi  REN Qing-Sheng  ZENG Jin
Affiliation:1.Department of Computer Science and Engineering, Shanghai Jiaotong University, Shanghai 200030; 2. Department of Mathematics, Shanghai Jiaotong University, Shanghai 200030
Abstract:The bit importance and convergent order of bit in genetic algorithms(GA) are studied.Relationships among important bits,schema,parameter range and target function are presented,and then a novel evolutionary algorithm,called Bit Importance Evolutionary Algorithm(BIEA) is proposed.BIEA detects the important bits in a chromosome at first,and then speeds up the convergence of important bits,while maintaining the diversity of unimportant bits.Numerical experiments show that compared with GA,BIEA has a better convergent velocity and can solve some hard deceptive problems which can't be solved effectively by GA.
Keywords:genetic algorithms  estimation of distribution algorithms  bit importance  schema  bit importance evolutionary algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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