GEP算法解码结构复用研究  

Study on reutilization of GEP algorithm decoding structure

作　　者：王超[1] 何锫[1,2,3] 

机构地区：[1]长沙理工大学计算机与通信工程学院,长沙410114 [2]北京大学高可信软件技术教育部重点实验室,北京100871 [3]广州大学计算机科学与教育软件学院,广州510006

出　　处：《计算机应用研究》2013年第11期3244-3247,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(61170199);湖南省教育厅重点资助科研项目(11A004);湖南省研究生科研创新项目(CX2012B367)

摘　　要：适应度评价大体可以分成解码和计算适应度值两个部分,是进化计算中运算量最大、重复率最高的过程之一。为了有效利用已有计算结果的角度避免大量重复建树和遍历运算,改进了GEP解码算法基本流程以降低GEP的运算量,达到了提升运算效率的目的。采用仿真的方式对引入复用机制的GEP和传统GEP算法进行了对比实验,从解码次数、解码所用时间等两个方面进行对照,发现引入复用机制的GEP算法在解码次数上比传统GEP有多个数量级的优势,在解码所需时间上也有较大的改进。Fitness evaluation can be generally divided into two parts：decoding and calculating the fitness value. It concludes the largest operation amount and the highest repetition rate in evolutionary computation. From the perspective of the effective utilization of the acquired calculation results to avoid repetitive builds and traversal operation, this paper achieved the goal of reducing the GEP computation and enhancing operation efficiency by improving the basic flow of GEP decoding algorithm. At last, according to simulation method, it conducted a comparative experiment between the GEP algorithm which introduced the reuse mechanism and the original one. The comparison mainly focused on respective decoding times and time. It discovered that via introducing the reuse mechanism into GEP algorithm, the algorithm could significantly reduce the decoding times by several orders of magnitude and save the decoding time to some extent than the original one.

关 键 词：基因表达式程序设计 解码 基因型结构 复用 

分 类 号：TP312[自动化与计算机技术—计算机软件与理论]