首页 | 官方网站   微博 | 高级检索  
     

基于CBR-GA的建筑块重组*
引用本文:邹鹏,闭应洲,杨虎林,刘阿宁,元昌安.基于CBR-GA的建筑块重组*[J].计算机应用研究,2011,28(5):1658-1660.
作者姓名:邹鹏  闭应洲  杨虎林  刘阿宁  元昌安
作者单位:广西师范学院,计算机与信息工程学院,南宁,530004
基金项目:国家自然科学基金项目(60763012,40761027);广西自然科学基金项目 (0991104)
摘    要:为了解决遗传算法(GA)中好的建筑块被破坏的问题,提出基于CBRGA的建筑块重组方法。首先反复运行简单的遗传算法找到多个局部最优解,并选择多个不同的局部最优解构建案例库;然后应用差异化学习方法产生新案例,有效解决了GA中随机交叉对建筑块破坏的问题;最后通过4阶欺骗问题验证了新算法的可行性。

关 键 词:案例推理    遗传算法    欺骗问题
收稿时间:2010/10/30 0:00:00
修稿时间:2011/4/15 0:00:00

Toward recombination of building blocks based on CBR-GA
ZOU Peng,BI Ying-zhou,YANG Hu-lin,LIU A-ning,YUAN Chang-an.Toward recombination of building blocks based on CBR-GA[J].Application Research of Computers,2011,28(5):1658-1660.
Authors:ZOU Peng  BI Ying-zhou  YANG Hu-lin  LIU A-ning  YUAN Chang-an
Affiliation:(College of Computer and Information Engineer, Guangxi Teachers Education University, Nanning 530004, China)
Abstract:Case-Based Reasoning (CBR) is the model of human problem solving using prior experiences (called cases). In order to solve the problem of the destruction of good building blocks in Genetic Algorithm (GA), a novel approach to recombine the building blocks based on CBR-GA is presented: firstly, run simple GA repeatedly to find multiple local optimal solutions, and choose the different local optimal solutions to build the Case-Base; secondly, generate the new case by differentiation learning which effectively solve the problem of the destruction of building block in GA. Finally, the new algorithm is verified with 4-order deceptive problem.
Keywords:Case-Based Reasoning  Genetic Algorithm  Deceptive Problem
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号