论文信息 - Solving Even-Parity Problems using Multi Expression Programming

Solving Even-Parity Problems using Multi Expression Programming

In this paper, the Multi Expression Programming (MEP) technique is used for solving even-parity problems. Numerical experiments show that MEP outperforms Genetic Programming (GP) with more than one order of magnitude for the considered test cases.

Mihai Oltean

[1] Gilbert Syswerda,et al. Uniform Crossover in Genetic Algorithms , 1989, ICGA.

[2] Sean R Eddy,et al. What is dynamic programming? , 2004, Nature Biotechnology.

[3] Mihai Oltean,et al. Evolving Evolutionary Algorithms Using Multi Expression Programming , 2003, ECAL.

[4] David W. Corne,et al. No Free Lunch and Free Leftovers Theorems for Multiobjective Optimisation Problems , 2003, EMO.

[5] John R. Koza,et al. Genetic programming 2 - automatic discovery of reusable programs , 1994, Complex Adaptive Systems.

[6] John R. Koza,et al. Genetic programming - on the programming of computers by means of natural selection , 1993, Complex adaptive systems.

[7] Alfred V. Aho,et al. Compilers: Principles, Techniques, and Tools , 1986, Addison-Wesley series in computer science / World student series edition.

[8] M. Oltean,et al. Multi Expression Programming , 2021 .

[9] David H. Wolpert,et al. No free lunch theorems for optimization , 1997, IEEE Trans. Evol. Comput..