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

加权编码遗传算法线性函数能力分析
引用本文:莫鸿强,李向阳,万国成,田翔.加权编码遗传算法线性函数能力分析[J].计算机工程与应用,2007,43(8):85-87.
作者姓名:莫鸿强  李向阳  万国成  田翔
作者单位:[1]华南理工大学自动化科学与工程学院,广州510641 [2]华南理工大学数学系,广州510641
基金项目:教育部回国人员科研启动项目
摘    要:引入基因座系数作为基因座上一阶模式适应度差别的衡量指标;通过基因座系数和一阶积木块的对应关系,分析了线性加权编码用于线性函数编码时生成一阶积木块的能力。分析结果给出了基因座系数的一个上限与加权值的关系,结果同时表明,为保证计算精度,无论加权值如何变化,总有部分基因座上的基因座系数接近于1,因此在相当部分的搜索子空间中搜索随机性强、效率低。

关 键 词:遗传算法  局部搜索  编码  GA-难
文章编号:1002-8331(2007)08-0085-03
修稿时间:2006-05

On limitation of linear-weighted-coded genetic algorithms in the optimication of linear functions
MO Hong-qiang,LI Xiang-yang,WAN Guo-cheng,TIAN Xiang.On limitation of linear-weighted-coded genetic algorithms in the optimication of linear functions[J].Computer Engineering and Applications,2007,43(8):85-87.
Authors:MO Hong-qiang  LI Xiang-yang  WAN Guo-cheng  TIAN Xiang
Affiliation:1.Department of Automatic Control Engineering,South China University of Technology,Guangzhou 510641,China; 2.Department of Mathemetics,South China University of Technology,Guangzhou 510641,China
Abstract:In this paper,a concept of locus factor is introduced to measure the fitness differences among/between the order-1 schemata at a certain locus.According to the relationship between locus factor and order-1 building block,the ability of the linear-weighted coding employed to a linear fitness function to generate order-1 building blocks is analyzed.An upper limit of the locus factor at a particular locus in terms of the weights is given.The results show that,in order to guarantee the calculation accuracy,there always exist loci at which locus factors are very close to 1,not matter what the weights are.As a result,the local search efficiency of the linear-weighted-encoded genetic algorithms employed to a linear function is unavoidably low.
Keywords:Genetic Algorithms  local search  coding  GA-hard
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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