Genetic Programming Theory and Practice III pp 125-140 | Cite as
Running Genetic Programming Backwards
Abstract
Backward chaining evolutionary algorithms (BC-EA) offer the prospect of run-time efficiency savings by reducing the number of fitness evaluations without significantly changing the course of genetic algorithm or genetic programming runs. “Tournament selection, iterated coupon-collection problem, and backward-chaining evolutionary algorithm,” Poli, FOGA, 2005 describes how BC-EA does this by avoiding the generation and evaluation of individuals which never appear in selection tournaments. It suggests the largest savings occur in very large populations, short runs, small tournament sizes and shows actual savings in fixed-length binary GAS. Here, we provide a generational GP implementation, including mutation and two offspring crossover of BC-EA and empirically investigate its efficiency in terms of both fitness evaluations and effectiveness.
Keywords
Backward-Chaining genetic programming tournament selection efficient algorithmsPreview
Unable to display preview. Download preview PDF.
References
- Blickle, Tobias and Thiele, Lothar (1997). A comparison of selection schemes used in evolutionary algorithms. Evolutionary Computation, 4(4):361–394.Google Scholar
- Feller, William (1971). An Introduction to Probability Theory and Its Applications, volume 2. John Wiley.Google Scholar
- Langdon, William B., Soule, Terry, Poli, Riccardo, and Foster, James A. (1999). The evolution of size and shape. In Spector, Lee, Langdon, William B., O’Reilly, Una-May, and Angeline, Peter J., editors, Advances in Genetic Programming 3, chapter 8, pages 163–190. MIT Press, Cambridge, MA, USA.Google Scholar
- Motoki, Tatsuya (2002). Calculating the expected loss of diversity of selection schemes. Evolutionary Computation, 10(4):397–422.CrossRefGoogle Scholar
- Poli, Riccardo (2005). Tournament selection, iterated coupon-collection problem, and backward-chaining evolutionary algorithms. In Proceedings of the Foundations of Genetic Algorithms Workshop (FOGA 8).Google Scholar
- Poli, Riccardo and Langdon, William B. (2005). Backward-chaining genetic programming. Technical Report CSM 425, Department of Computer Science, University of Essex.Google Scholar
- Sastry, K. and Goldberg, D. E. (2001). Modeling tournament selection with replacement using apparent added noise. In Proceedings of ANNIE 2001, volume 11, pages 129–134.Google Scholar
- Sokolov, Artem and Whitley, Darrell (2005). Unbiased tournament selection. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2005). ACM.Google Scholar
- Teller, Astro and Andre, David (1997). Automatically choosing the number of fitness cases: The rational allocation of trials. In Koza, John R., Deb, Kalyanmoy, Dorigo, Marco, Fogel, David B., Garzon, Max, Iba, Hitoshi, and Riolo, Rick L., editors, Genetic Programming 1997: Proceedings of the Second Annual Conference, pages 321–328, Stanford University, CA, USA. Morgan Kaufmann.Google Scholar