Lexicase Selection Beyond Genetic Programming

Created by W.Langdon from gp-bibliography.bib Revision:1.8051

@InProceedings{metevier:2018:GPTP,

• author = "Blossom Metevier and Anil Kumar Saini and Lee Spector",
• title = "Lexicase Selection Beyond Genetic Programming",
• booktitle = "Genetic Programming Theory and Practice XVI",
• year = "2018",
• editor = "Wolfgang Banzhaf and Lee Spector and Leigh Sheneman",
• pages = "123--136",
• address = "Ann Arbor, USA",
• month = "17-20 " # may,
• publisher = "Springer",
• keywords = "genetic algorithms, genetic programming",
• isbn13 = "978-3-030-04734-4",
• URL = "http://link.springer.com/chapter/10.1007/978-3-030-04735-1_7",
• DOI = "doi:10.1007/978-3-030-04735-1_7",
• abstract = "Lexicase selection is a selection method that was developed for parent selection in genetic programming. In this chapter, we present a study of lexicase selection in a non-genetic-programming context, conducted to investigate the broader applicability of the technique. Specifically, we present a framework for solving Boolean constraint satisfaction problems using a traditional genetic algorithm, with linear genomes of fixed length. We present results of experiments in this framework using three parent selection algorithms: lexicase selection, tournament selection (with several tournament sizes), and fitness-proportionate selection. The results show that when lexicase selection is used, more solutions are found, fewer generations are required to find those solutions, and more diverse populations are maintained. We discuss the implications of these results for the utility of lexicase selection more generally.",
• notes = "College of Information and Computer Sciences, University of Massachusetts, Amherst, USA",

}

Genetic Programming entries for Blossom Metevier Anil Kumar Saini Lee Spector

Citations