MREP: Multi-Reference Expression Programming
MEP is a variant of genetic program applied to solve the symbol regression and classification problems. It can encode multiple solutions of a problem in a single chromosome. However, when the ratio of genes reuse is low, it may not get a high accuracy result within limited iterations and may fall into the trap of local optimum. Therefore, we proposed a novel genetic evolutionary algorithm named MREP (multi-reference expression programming). The MREP chromosome is encoded in a two-dimensional structure and each gene in one chromosome can refer other sub-layer’s gene randomly. The main contribution can be described as follows: Firstly, a novel chromosome encoding scheme is proposed based on a two-dimensional structure. Secondly, two different cross-layer reference strategies are designed to enhance the code reuse of genes located at different layers in one chromosome. Two groups experiments were conducted on eight symbol regression functions. The statistical results reveal that the MREP performs better than the compared algorithms and can solve the symbol regression functions problem efficiently.
KeywordsMulti-expression programming Cross-layer-reference Two dimensional operators Genetic programming Symbol regression
This work was supported by National Natural Science Foundation of China under Grant No. 61572230, No. 61173078, No. 61573166 and Shandong Provincial Natural Science Foundation under Grant ZR2015JL025. The authors would like to thank the anonymous reviewers for providing comments to help us improve the contents of this paper.
- 1.Kallel, L., Bart, N., Alex, R.: Theoretical aspects of evolutionary computing. Springer Science & Business Media, New York (2013)Google Scholar
- 2.Koza, B.J.: Evolving caching algorithms in C by GP. In: Genetic Programming. MIT Press (2010)Google Scholar
- 3.Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming: An Introduction: On the Automatic Evolution of Computer Programs and Its Applications, December 1998Google Scholar
- 4.Ryan, C., Neill, M.O.: Grammatical evolution: a steady state approach. Late Breaking Papers Genetic Programming, pp. 180–185 (1998)Google Scholar
- 5.Ferreira, C.: Gene expression programming: a new adaptive algorithm for solving problems. Eprint Arxiv Cs (2), 87–129 (2001)Google Scholar
- 6.Miller, J.F.: Gecco 2013 tutorial: Cartesian genetic programming. In: Conference Companion on Genetic and Evolutionary Computation, pp. 715–740 (2013)Google Scholar
- 7.Paterson, N.R.: Genetic programming with context sensitive grammars. In: Proc. Eurogp Lncs 63(84), 113117 (2002)Google Scholar
- 10.Groan, C., Abraham, A., Ramos, V., Han, S.Y.: Stock market prediction using multi expression programming. In: Portuguese Conference on Artificial Intelligence, EPIA 2005, pp. 73–78 (2006)Google Scholar
- 13.Cattani, P.T., Johnson, C.G.: ME-CGP: multi expression Cartesian genetic programming. In: IEEE Congress on Evolutionary Computation, CEC 2010, Barcelona, Spain, 18–23 July, pp. 1–6 (2010)Google Scholar
- 15.Yang, B., Zhang, Q., Wang, L., Li, Y.: Inference of differential equations by MMEP for cement hydration modeling. In: IEEE International Conference on Computer Supported Cooperative Work in Design, pp. 4–10 (2013)Google Scholar