Code Bloat Problem in Genetic Programming

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

@Article{Purohit:2014:IJSRP,

• author = "Anuradha Purohit and Narendra S. Choudhari and Aruna Tiwari",
• title = "Code Bloat Problem in Genetic Programming",
• journal = "International Journal of Scientific and Research Publications",
• year = "2013",
• volume = "3",
• number = "4",
• month = apr,
• keywords = "genetic algorithms, genetic programming, bloat, double tournament, elitism, spatial structure",
• ISSN = "2250-3153",
• annote = "The Pennsylvania State University CiteSeerX Archives",
• bibsource = "OAI-PMH server at citeseerx.ist.psu.edu",
• language = "en",
• oai = "oai:CiteSeerX.psu:10.1.1.301.158",
• pages = "1612",
• rights = "Metadata may be used without restrictions as long as the oai identifier remains attached to it.",
• URL = "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.301.158",
• URL = "http://www.ijsrp.org/research-paper-0413/ijsrp-p1612.pdf",
• size = "5 pages",
• abstract = "The concept of bloat in Genetic Programming is a well-established phenomenon characterised by variable-length genomes gradually increasing in size during evolution [1]. Bloat hampers the efficiency and ability of genetic programming for solving problems. A range of explanations have been proposed for the problem of bloat, including destructive crossover and mutation operators, selection pressure and individual representation. Different methods to avoid bloat and to control bloat have been proposed by researchers. This paper proposes a theoretical analysis of code bloating problem and the discussion on the work already done by various authors to handle bloat in genetic programming.",

}

Genetic Programming entries for Anuradha Purohit Narendra S Choudhari Aruna Tiwari

Citations