Sufficient conditions for deceptive and easy binary functions

Annals of Mathematics and Artificial Intelligence

Volumn 10, Issue 4, 1994, Pages 385-408

  Deb, Kalyanmoy ^a   Goldberg, David E ^b  

^a INDIAN INSTITUTE OF TECHNOLOGY KANPUR   (India)

^b UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 21344490948     PISSN: 10122443     EISSN: 15737470     Source Type: Journal    
DOI: 10.1007/BF01531277     Document Type: Article

References (21)

1. An analysis of the behavior of a class of genetic adaptive systems (Doctoral Dissertation, University of Michigan)
2. Binary and floating-point function optimization using messy genetic algorithms (Doctoral Dissertation, University of Alabama and IlliGAL Report No. 91004)
3. Analyzing deception in trap functions
4. Simple genetic algorithms and the minimal deceptive problem
5. Genetic algorithms and Walsh functions: Part I, a gentle introduction
6. Genetic algorithms and Walsh functions: Part II, deception and its analysis
7. Construction of high-order deceptive functions using low-order Walsh coefficients
8. Genetic algorithms, noise, and the sizing of populations
9. Messy genetic algorithms revisited: Studies in mixed size and scale
10. Messy genetic algorithms: Motivation, analysis, and first results
11. Genetic algorithms and the variance of fitness
12. Representational issues in genetic optimization