Sufficient conditions for deceptive and easy binary functions

D.H. Ackley,A Connectionist Machine for Genetic Hillclimbing (Kluwer, Boston, MA, 1987).

L. Davis, Bit-climbing, representational bias, and test suite design,Proc. 4th Int. Conf. on Genetic Algorithms (1991) pp. 18?23.

K.A. De Jong, An analysis of the behavior of a class of genetic adaptive systems (Doctoral Dissertation, University of Michigan) Dissertation Abstracts Int. 36 (1975) 5140B.

K. Deb, Binary and floating-point function optimization using messy genetic algorithms (Doctoral Dissertation, University of Alabama and IlliGAL Report No. 91004), Dissertation Abstracts Int. 52 (1991) 2658B.

K. Deb and D.E. Goldberg, Analyzing deception in trap functions, IlliGAL Report No. 91009, Urbana: University of Illinois, Illinois Genetic Algorithms Laboratory (1991).

D.E. Goldberg, Simple genetic algorithms and the minimal deceptive problem, in:Genetic Algorithms and Simulated Annealing, ed. L. Davis (Pitman, London, 1987) pp. 74?88.

D.E. Goldberg, Genetic algorithms and Walsh functions: Part I, a gentle introduction, Complex Syst. 3 (1989) 129?152.

D.E. Goldberg, Genetic algorithms and Walsh functions: Part II, deception and its analysis, Complex Syst. 3 (1989) 153?171.

D.E. Goldberg, Construction of high-order deceptive functions using low-order Walsh coefficients, IlliGAL Report No. 90002, Urbana: University of Illinois, Illinois Genetic Algorithms Laboratory (1990).

D.E. Goldberg, K. Deb and J.H. Clark, Genetic algorithms, noise, and the sizing of populations, IlliGAL Report No. 91010, Urbana: University of Illinois Genetic Algorithms Laboratory (1991).

D.E. Goldberg, K. Deb and B. Korb, Messy genetic algorithms revisited: Studies in mixed size and scale, Complex Syst. 4 (1990) 415?444.

D.E. Goldberg, K. Deb and B. Korb, Don't worry, Be messy,Proc. 4th Int. Conf. on Genetic Algorithms and their Applications (1991) pp. 24?30.

D.E. Goldberg, B. Korb and K. Deb, Messy genetic algorithms: Motivation, analysis, and first results, Complex Syst. 3 (1989) 493?530.

D.E. Goldberg and M. Rudnick, Genetic algorithms and the variance of fitness, Complex Syst. 5 (1991) 265?278.

J.J. Grefenstette, Deception considered harmful, Found. Genetic Algorithms (1993) 75?91.

A. Homaifar, X. Qi and J. Fost, Analysis and design of a general GA deceptive problem,Proc. 4th Int. Conf. on Genetic Algorithms (1991) pp. 196?203.

G.E. Liepins and M.D. Vose, Representational issues in genetic optimization, J. Exp. Theor. Artificial Intelligence 2(2) (1990) 4?30.

A.J. Mason, Partition coefficients, static deception and deceptive problems for non-binary alphabets,Proc. 4th Int. Conf. on Genetic Algorithms (1991) pp. 210?214.

M.D. Vose and G.E. Liepins, Schema Disruption.Proc. 4th Int. Conf. on Genetic Algorithms (1991) pp. 237?242.

D. Whitley, Fundamental principles of deception in genetic search, Found. Genetic Algorithms (1991) 221?241.

S.W. Wilson, GA-easy does not imply steepest-ascent optimizable,Proc. 4th Int. Conf. on Genetic Algorithms (1991) pp. 85?89.