J. D. Schaffer. Some effects of selection procedures on hyperplane sampling by genetic algorithms. In L. Davis, editor, Genetic Algorithms and Simulated Annealing. Pittman, 1987.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....and the second parent is chosen randomly. But we have also examined a form of the simple genetic algorithm where both parents are chosen based on fitness. This can be added to the schema theorem by merely indicating the alternative parent is chosen from the intermediate population after selection [38]. P (H; t 1) P (H; t) 1 Gamma P (H; t) Finally, mutation is included. Let o(H) be a function that returns the order of the hyperplane H. The order of H exactly corresponds to a count of the number of bits in the schema representing H that have value 0 or 1. Let the mutation ....

J. D. Schaffer. Some Effects of Selection Procedures on Hyperplane Sampling by Genetic Algorithms. In Lawrence Davis, editor, Genetic Algorithms and Simulated Annealing, pages 89--130. Morgan Kaufmann, 1987.

....two is the population after 2P evaluations, and so on. For non generational GAs, such as the ones developed here, t may be assumed to increment each time fitnesses are recalculated for the population. Section 4.4 deals with generational issues in more detail. 9 Some authors, such as Schaffer [78], refer to schemata as hyperplanes ; Goldberg [33] calls them building blocks. 86 A schema can span any fraction of total string length and, as just seen, can have varying degrees of specificity. The schema properties which quantify these concepts are defining length and order. The defining ....

....of a large number of favorable schemata multipying at such a rate is obviously conducive to the algorithm s search efficiency. As Schaffer puts it, implicit parallelism] constitutes the only known example of combinatorial explosion working to advantage instead of disadvantage. [78] 4.3 GA Functions The functions of a typical GA are surprisingly simple. In fact, it is partly this simplicity combined with their remarkable search power that makes GAs attractive. Simplicity also makes for relatively easy programming and thus invites variation, as a custom GA can realistically ....

J. D. Schaffer. Some effects of selection procedures on hyperplane sampling by genetic algorithms. In L. Davis, editor, Genetic Algorithms and Simulated Annealing, Research Notes in Artificial Intelligence, pages 89--99. Pitman Publishing, London, 1987.

....algorithm is to generate an initial population. In the canonical genetic algorithm each member of this population will be a binary string of length L which corresponds to the problem encoding. Each string is sometimes referred to as a genotype (Holland, 1975) or, alternatively, a chromosome (Schaffer, 1987). In most cases the initial population is generated randomly. After creating an initial population, each string is then evaluated and assigned a fitness value. The notion of evaluation and fitness are sometimes used interchangeably. However, it is useful to distinguish between the evaluation ....

....reason for considering both the simple genetic algorithm and Holland s original genetic plan is to understand the different theoretical constructs which can be found in the literature. Some literature is based on one form of the algorithm, while other works are based on the alternative form. See Schaffer (1987) for a nice discussion of these two forms. 2.1 Why does it work Search Spaces as Hypercubes. The question that most people who are new to the field of genetic algorithms ask at this point is why such a process should do anything useful. Why should one believe that this is going to result in an ....

Schaffer, J.D. (1987) Some Effects of Selection Procedures on Hyperplane Sampling by Genetic Algorithms. In, Genetic Algorithms and Simulated Annealing, L. Davis, ed. Pitman.

....and the availability of increasing powerful computers. An overview of genetic algorithms can be found in Goldberg s Genetic Algorithms in Search, Optimization, and Machine Learning (1989) Recent work in genetic algorithms and genetic classifier systems can be surveyed in Davis (1987) and Schaffer (1989). Representation is a key issue in genetic algorithm work because genetic algorithms directly manipulate the coded representation of the problem and because the representation scheme can severely limit the window by which the system observes its world. Fixed length character strings present ....

Schaffer, J. D. Some effects of selection procedures on hyperplane sampling by genetic algorithms. In Davis, L. (editor) Genetic Algorithms and Simulated Annealing London: Pittman l987. Schaffer , J. D. (editor) Proceedings of the Third International Conference on Genetic Algorithms. San Mateo, Ca: Morgan Kaufmann Publishers Inc. 1989.

....algorithm is to generate an initial population. In the canonical genetic algorithm each member of this population will be a binary string of length L which corresponds to the problem encoding. Each string is sometimes referred to as a genotype (Holland, 1975) or, alternatively, a chromosome (Schaffer, 1987). In most cases the initial population is generated randomly. After creating an initial population, each string is then evaluated and assigned a fitness value. The notion of evaluation and fitness are sometimes used interchangeably. However, it is useful to distinguish between the evaluation ....

Schaffer, J.D. (1987) Some Effects of Selection Procedures on Hyperplane Sampling by Genetic Algorithms. In, Genetic Algorithms and Simulated Annealing, L. Davis, ed. Pitman.

....the above formulation independently of what is happening to other schemata in the population. Hol75] 2.2 Modifications to the Schema Theorem Many modifications to the original Schema Theorem have been made. For example, the advantages of selecting both parents by fitness has been demonstrated [Sch87] the effects of n point crossover have been analyzed [SdJ91] and the Markov model of Nix and Vose may even be considered to be an exact form of the Schema Theorem [NV92] However, with the notable exception of Radcliffe [Rad91] crossover design concepts have not been modified. Radcliffe has ....

J.D. Schaffer. Some effects of selection procedures on hyperplane sampling by genetic algorithms. In L. Davis, editor, Genetic Algorithms and Simulated Annealing. Morgan Kaufmann, 1987.

No context found.

J. D. Schaffer. Some effects of selection procedures on hyperplane sampling by genetic algorithms. In L. Davis, editor, Genetic Algorithms and Simulated Annealing. Pittman, 1987.

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