DGP: How To Improve Genetic Programming with Duals
In this paper, we present a new approach, improving the performances of a genetic algorithm (GA). Such algorithms are iterative search procedures based on natural genetics. We use an original genetic algorithm that manipulates pairs of twins in its population: DGA, dual-based genetic algorithm. We show that this approach is relevant for genetic programming (GP), which manipulates populations of trees. In particular, we show that duals can transform a deceptive problem into a convergent one. We also prove that using pairs of dual functions in the primitive function set, is more efficient in the problem of learning boolean functions. Here, in order to prove the theoretical interest of our approach (DGP: dual-based genetic programming), we perform a numerical simulation.
KeywordsGenetic Algorithm Genetic Programming Boolean Function Dual Function Internal Function
Unable to display preview. Download preview PDF.
- P. Collard and J.-P. Aurand. DGA: An Efficient Genetic Algorithm. ECAI’94. 1994.Google Scholar
- P. Collard and J.-L. Segapeli. Using a Double-based Genetic Algorithm on a Population of Computer Programs. In ICTAI’94: Proceedings of the 6th IEEE International Conference on Tools with Artificial Intelligence. New Orleans. USA. 1994.Google Scholar
- D.E. Goldberg. Simple Genetic Algorithms and the Minimal Deceptive Problem. Genetic Algorithms and Simulated Annealing. L. Davis ed. 1987.Google Scholar
- D.J. Montana. Strongly Typed Genetic Programming. BBN Technical Report #7866. 1993.Google Scholar
- D. Whitley. An Executable Model of a Simple Genetic Algorithm. Foundations of Genetic Algorithms 2, Morgan Kaufmann. 1993.Google Scholar