On the automaticity of genetic programming

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

@InProceedings{melvin:2004:otagp,

• author = "N. Melvin and R. Soricone and J. Waslo",
• title = "On the automaticity of genetic programming",
• booktitle = "14th International Conference on Electronics, Communications and Computers",
• year = "2004",
• month = feb,
• pages = "223--228",
• keywords = "genetic algorithms, genetic programming",
• URL = "http://csdl.computer.org/comp/proceedings/conielecomp/2004/2074/00/20740236abs.htm",
• DOI = "doi:10.1109/ICECC.2004.1269579",
• abstract = "Genetic/evolutionary algorithms, based upon an analogy to the mechanics of Mendelian genetics and Darwinian evolutionary theory, offer an automatic way to improve programs. The process cycles many times, selecting for reproduction among a population of program variants (represented by the chromosomes) to form the next generation, with mutation and crossover producing additional variation. This approach was tested in such classic problems as function evolution, function maximization, and the Traveling Salesman problem. While the basic approach proved powerful, its implementation required a non-automatic series of choices with respect to the parameters for the algorithm itself, the representation of chromosomes, the meanings of mutation and crossover, the possibility of other mechanisms such as inversion, and the evaluation of the fitness of the reproductive candidates. The most important message is that despite the automatic nature of the algorithm itself, knowledge of the problem domain is important to its implementation.",
• notes = "Authors Neville Melvin, Northern Arizona University Robert Soricone, Northern Arizona University James Waslo, Northern Arizona University",

}

Genetic Programming entries for N Melvin R Soricone J Waslo

Citations