Reduced-GEP: Improving Gene Expression Programming By Gene Reduction
In traditional Gene Expression Programming (GEP), each chromosome is expressed and evaluated on the Expression Tree (ET). The ET-based expression and evaluation are computationally expensive and the intelligibility of the chromosome is low. In this paper, a highly efficient algorithm, Reduced-GEP, is proposed to solve these problems. First, the chromosome is reduced by Reduced-GEP. Second, chromosomes are evaluated directly on the reduced gene without being expressed them into ETs. In this way, the efficiency of the fitness evaluation is greatly improved. Moreover, the result of the evolution by Reduced-GEP is simplified and easier to be understood and explained. Extensive experiments demonstrate that Reduced-GEP algorithm is effective to calculate the fitness and reduce the chromosome.
Reduced-GEP Gene Expression Programming Evolutionary Computation, Fitness Evaluate.
Yu Chen Chang Jie Tang Rui Li Ming Fang Zhu Chuan Li Jie Zuo
School of Computer Science,Sichuan University,Chengdu,610065,China Image Processing Engineer JAI,Inc.San Jose,CA 95134,USA College of Computer Science and Engineering,Jiangsu Teachers University of technology,Changzhou,2130
国际会议
南京
英文
515-518
2010-08-26（万方平台首次上网日期，不代表论文的发表时间）