ABSTRACT
This paper presents a backward-chaining version of GP.
- R. Poli. Tournament selection, iterated coupon-collection problem, and backward-chaining evolutionary algorithms. In Proceedings of the Foundations of Genetic Algorithms Workshop (FOGA 8), 4th January 2005. Google ScholarDigital Library
- R. Poli and W. B. Langdon. Backward-chaining genetic programming. Technical Report CSM-425, Department of Computer Science, University of Essex, 2005.Google ScholarDigital Library
- R. Poli and W. B. Langdon. Running genetic programming backward. In R. L. Riolo, B. Worzel, and T. Yu, editors, Genetic Programming Theory and Practice. Kluwer, 2005.Google Scholar
Recommendations
Breaking ties with secondary fitness in a genetic algorithm for the bin packing problem
GECCO '10: Proceedings of the 12th annual conference on Genetic and evolutionary computationIn a genetic algorithm with integer fitnesses, ties in selection tournaments result in the selection of parent chromosomes effectively at random. A secondary measure that estimates how likely chromosomes are to be improved by the GA's variation ...
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)-tournament selection-we highlight a previously-unknown source of inefficiency. This leads us to rethink the order in which operations are performed ...
Introduction to genetic programming
GECCO '09: Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking PapersGenetic programming (GP) is a collection of evolutionary computation techniques that allow computers to solve problems automatically. Using ideas from natural evolution, GP starts from an ooze of random computer programs, and progressively refines them ...
Comments