- title = "Experiments in Program Synthesis with Grammatical Evolution: A Focus on Integer Sorting",
- author = "Michael O'Neill and Miguel Nicolau and Alexandros Agapitos",
- pages = "1504--1511",
- booktitle = "Proceedings of the 2014 IEEE Congress on Evolutionary Computation",
- year = "2014",
- month = "6-11 " # jul,
- editor = "Carlos A. {Coello Coello}",
- address = "Beijing, China",
- ISBN = "0-7803-8515-2",
- keywords = "genetic algorithms, Genetic programming, Grammatical Evolution, SBSE",
-
DOI = "
doi:10.1109/CEC.2014.6900578",
- abstract = "We present the results of a series of investigations where we apply a form of grammar-based genetic programming to the problem of program synthesis in an attempt to evolve an Integer Sorting algorithm. The results confirm earlier research in the field on the difficulty of the problem given a primitive set of functions and terminals. The inclusion of a swap(i,j) function in combination with a nested for loop in the grammar enabled a successful solution to be found in every run. We suggest some future research directions to overcome the challenge of evolving sorting algorithms from primitive functions and terminals.",
-
notes = "Python. Five test cases. Sequential v. nested loops
Two BNF grammars tried. Pop 500 or 10000. Importance of
swap primitive.
WCCI2014",
