ERA

Download the full-sized PDF of Genetic Invariance: A New Paradigm for Genetic Algorithm DesignDownload the full-sized PDF

Analytics

Share

Permanent link (DOI): https://doi.org/10.7939/R3B470

Download

Export to: EndNote  |  Zotero  |  Mendeley

Communities

This file is in the following communities:

Computing Science, Department of

Collections

This file is in the following collections:

Technical Reports (Computing Science)

Genetic Invariance: A New Paradigm for Genetic Algorithm Design Open Access

Descriptions

Author or creator
Culberson, Joseph
Additional contributors
Subject/Keyword
genetic algorithms
gene invariance
simulation
deception analysis
crossover analysis
Type of item
Computing Science Technical Report
Computing science technical report ID
TR92-02
Language
English
Place
Time
Description
Technical report TR92-02. This paper presents some experimental results and analyses of the gene invariant genetic algorithm(GIGA). Although a subclass of the class of genetic algorithms, this algorithm and its variations represent a unique approach with many interesting results. The primary distinguishing feature is that when a pair of offspring are created and chosen as worthy of membership in the population they replace their parents. With no mutation this has the effect of maintaining the original genetic material over time, although it is reorganized. In this paper no mutation is allowed. The only genetic operator used is crossover. Several crossover operators are experimented with and analyzed. The notion of a family is introduced and different selection methods are analyzed. Tests using simple functions, the De Jong five function test suite and several deceptive functions are reported. GIGA performs as well as traditional GAs, and sometimes better. The evidence indicates that this method makes more effective use of the crossover operator, in part because it never loses genetic material and thus has greater scope for recombination. A new view of crossover search space structures and approaches to analysis are presented. Traditional methods of analysis for GAs do not seem to apply since GIGAs cannot be said to give increased trials to the best schemata in the usual sense. However, the analysis of crossover search space structures may have applications in traditional GA analysis. See also: Michael Lewchuk, Master's Thesis; \"Genetic Invariance: A New Approach to Genetic Algorithms\" April 1992 Technical Report TR92-05 Joseph Culberson; \"GIGA Program Description and Operation\" June 1992 Technical Report TR92-06
Date created
1992
DOI
doi:10.7939/R3B470
License information
Creative Commons Attribution 3.0 Unported
Rights

Citation for previous publication

Source
Link to related item

File Details

Date Uploaded
Date Modified
2014-04-24T22:36:55.584+00:00
Audit Status
Audits have not yet been run on this file.
Characterization
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 487081
Last modified: 2015:10:12 13:41:34-06:00
Filename: TR92-02.pdf
Original checksum: 2aaab5638dbea65ba4fed3ecefd39da5
Well formed: true
Valid: true
Page count: 35
Activity of users you follow
User Activity Date