Evolving a sort: lessons in genetic programming

Abstract

In applying the genetic programming paradigm to the task of evolving iterative sorting algorithms, a variety of lessons are learned. With proper selection of the primitives, sorting algorithms are evolved that are both general and non-trivial. The sorting problem is used as a testbed to evaluate the value of several alternative parameters, with some small gains shown. The value of applying steady state genetic algorithm techniques to genetic programming, called steady state genetic programming, is demonstrated. One unusual genetic operator is created, i.e., nonfitness single cross-over. It shows promise in at least this environment.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>