D.E. Goldberg. Genetic algorithms and walsh functions: Part i, a gentle introduction. In Complex Systems, volume 3, pp 123-- 152. 1989.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....the parameters, and GA hardness analysis. For GA, our main concern here, these analyses are based on different approaches : ffl Proofs of convergence based on Markov chain modeling [6] 3] 1] 20] ffl Deceptive functions analysis, based on Schema analysis and Holland s original theory [14] [8], 9] 11] which characterizes the efficiency of a GA, and allows to shed light on GA hard functions. ffl Some rather new approaches are based on an explicit modelization of a GA as a dynamical system [16] 22] Deception has been intuitively related to the biological notion of epistasis ....

....easily find it. On the contrary, if the intersection of these buildings blocks is a secondary optimum, the population will preferably converge onto it, missing the global one. In this situation the GA will be considered to have failed 1 and f will be called deceptive. More formally, Goldberg ([8], 9] defined static deception : the selection results in an expected greater mean fitness for the set of individuals selected for reproduction, than for the preceding population. But this mean value will be changed by the application of genetic operators. It follows that the GA is attracted ....

D.E. Goldberg. Genetic algorithms and walsh functions: Part i, a gentle introduction. In Complex Systems, volume 3, pp 123-- 152. 1989.

....to this problem. However, this formulation is difficult to apply due to the high dimensionality and nonlinearity, and no results on realistic GAs have been produced. Static analysis is based on characterizing the fitness function rather than describing the dynamics. Walsh function analysis [8] and schemata theory [4] are examples of this approach. These approaches miss effects due to the fact that the region of fitness space that the population is in is changing in time. Consequently, these methods can make predictions which are wrong (e.g. see [9] There is clearly room for a new ....

David E. Goldberg. Genetic algorithms and walsh functions: Part I, a gentle introduction. Complex Systems, 3:129--152, 1990.

....Laplace, and other transformations, Walsh functions are often used to represent the representation in a convenient form. Application of Walsh transformation (WT) in understanding Genetic Algorithms was first noted by Bethke [2] Further investigation of this approach can be found elsewhere [4, 5, 6, 13, 16]. Traditionally, the Walsh functions are used for representing real valued functions of binary variables. However, they can be easily extended to higher cardinality representation, as shown elsewhere [15] Although the main arguments of the following discussion can be extended for higher ....

D. E. Goldberg. Genetic algorithms and Walsh functions: Part I, a gentle introduction. Complex Systems, 3(2):129--152, 1989. (Also TCGA Report 88006).

....established that they are inferior. Davis (1991) for example, has argued 1 See, for example, Syswerda (1989) for a description of these 2 nee intrinsic forcefully that on real world problems he invariably gains superior results with natural representations and custom operators, while Goldberg (1990c) has defended the use of binary representations and traditional operators for problems in real parameter optimisation with the development of his theory of virtual alphabets . It should be stressed that there are dozens, if not hundreds of papers which discuss and form part of this debate, and ....

....problem, and is in some ways analogous to the common one max problem (or counting ones problem, e.g. Vose Liepins (1991) 3. 2 Epistatic problems Probably the most widely discussed epistatic problems in the literature on genetic algorithms are the deceptive problems introduced by Goldberg (1990a, 1990b) together with the epistatic members of De Jong s test suite (DeJong, 1975) None of these can be applied directly since they are all defined with respect to arbitrary binary strings, 0 1 2 3 4 5 0 1 2 3 4 5 0 1 2 3 4 5 0 1 2 3 4 5 0 1 2 3 4 5 0 1 2 3 4 5 Figure 2: The left figure shows the ....

Goldberg, 1990a. David E. Goldberg. Genetic algorithms and walsh functions: Part I, a gentle introduction. Complex Systems, 3:129--152, 1990.

....to show how this viewpoint enables us to gain further insights into the determination of epistatic effects, and into the value of different forms of encoding a problem for a GA solution. We also demonstrate the equivalence of this approach to the Walsh transform analysis popularized by Goldberg [3, 4], and its extension to the idea of partition coefficients [5] We then show how the experimental design perspective helps to throw further light on the nature of deception. 1 INTRODUCTION The term epistasis is used in the field of genetic algorithms to denote the effect on chromosome fitness of ....

....degree of non linearity in the fitness function, and roughly speaking, the more epistatic the problem is, the harder it may be for a GA to find its optimum. Table 1: Goldberg s 3 bit deceptive function String Fitness 0 0 0 7 0 0 1 5 0 1 0 5 0 1 1 0 1 0 0 3 1 0 1 0 1 1 0 0 1 1 1 8 Several authors [3, 4, 6, 8] have explored the problem of epistasis in terms of the properties of a particular class of epistatic problems, those known as deceptive problems the most famous example of which is probably Goldberg s 3 bit function, which has the form shown in Table 1 (definitions of this function in the ....

[Article contains additional citation context not shown here]

D.E.Goldberg (1989) Genetic algorithms and Walsh functions: part I, a gentle introduction. Complex Systems, 3, 129-152.

No context found.

D. Goldberg (1989b). Genetic algorithms and Walsh functions: Part 1, A gentle introduction. Complex Systems, 3, pp. 129--152.

Documents 51 to 67  Previous 50

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC