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

基于元胞自动机的线性遗传程序设计算法
引用本文:周恺卿,乐晓波,潘小海,莫礼平.基于元胞自动机的线性遗传程序设计算法[J].计算机工程,2011,37(16):161-163.
作者姓名:周恺卿  乐晓波  潘小海  莫礼平
作者单位:1. 长沙理工大学计算机与通信工程学院,长沙,410114
2. 拓维信息系统有限公司,长沙,410205
3. 吉首大学数学与计算机科学学院,湖南吉首,416000
基金项目:湖南省自然科学基金资助项目
摘    要:为维持进化过程中的种群多样性,并进一步提高求解问题的精确度,在SGP算法的基础上引入元胞自动机模型理论,提出一种能够实现具有细粒度并行的CSGP算法.该算法可提高求解问题的成功率以及减少进化代数,对比实验表明,CSGP算法较GEP算法和SGP算法在求解符号回归的问题上有较好的性能优势.

关 键 词:线性遗传编程  基因表达式编程  元胞自动机  符号回归
收稿时间:2011-01-28

Linear Genetic Programming Algorithm Based on Cellular Automata
ZHOU Kai-qing,YUE Xiao-bo,PAN Xiao-hai,MO Li-ping.Linear Genetic Programming Algorithm Based on Cellular Automata[J].Computer Engineering,2011,37(16):161-163.
Authors:ZHOU Kai-qing  YUE Xiao-bo  PAN Xiao-hai  MO Li-ping
Affiliation:1.School of Computer and Communication Engineering,Changsha University of Science and Technology,Changsha 410114,China;2.Talkweb Information System Co.,Ltd.,Changsha 410205,China;3.College of Mathematics and Computer Science,Jishou University,Jishou 416000,China)
Abstract:For keeping various of population dynamics in the process of evolution and improving the definition of solution of problems,a fine particle parallel algorithm which called CSGP(Cellular Symbol Genetic Programming) is proposed based on the SGP(Symbol Genetic Programming) algorithm and cellular automaton model.This algorithm has higher success rate and need less computation time.Experiments as symbolic regression and so on are given.The result indicates that the GSCP algorithm has more efficiency and precisely in cost and precision than GEP and SGP.
Keywords:Linear Genetic Programming(LGP)  gene expression programming  cellular automata  symbolic regression
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《计算机工程》浏览原始摘要信息
点击此处可从《计算机工程》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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