Fast Generation of Big Random Binary Trees
This enables faster experimentation in genetic programming by allowing the creation of trees with up to a billion nodes, though it is incremental as it focuses on optimization of an existing method.
The authors tackled the problem of generating large random binary trees efficiently for genetic programming and genetic improvement experiments, achieving a generation rate of over 18 million nodes per second on a 3.60GHz CPU.
random_tree() is a linear time and space C++ implementation able to create trees of up to a billion nodes for genetic programming and genetic improvement experiments. A 3.60GHz CPU can generate more than 18 million random nodes for GP program trees per second.