𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Generalizing the notion of schema in genetic algorithms

✍ Scribed by Michael D. Vose

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
458 KB
Volume
50
Category
Article
ISSN
0004-3702

No coin nor oath required. For personal study only.

✦ Synopsis

Vose, M.D., Generalizing the notion of schema in genetic algorithms (Research Note), Artificial Intelligence 50 (1991) 385-396. In this paper we examine some of the fundamental assumptions which are frequently used to explain the practical success which Genetic Algorithms (GAs) have enjoyed. Specifically, the concept of schema and the Schema Theorem are interpreted from a new perspective. This allows GAs to be regarded as a constrained random walk, and offers a view which is amenable to generalization. The minimal deceptive problem (a problem designed to mislead the genetic paradigm) is analyzed in the context provided by our interpretation, where a different aspect of its difficulty emerges.

πŸ“œ SIMILAR VOLUMES

The dynamics of genetic algorithms in in
The dynamics of genetic algorithms in interactive environments
✍ Herbert Dawid; Kurt Hornik πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 286 KB

We analyze the behavior of a simple genetic algorithm (GA) which is used to simulate the learning behavior of a population of interacting agents. Due to the fact that in this setup-contrary to traditional optimization setups-the fitness of a string depends on the current state of the population, exi

Population structure increases the evolv
Population structure increases the evolvability of genetic algorithms
✍ Felix J. H. Hol; Xin Wang; Juan E. Keymer πŸ“‚ Article πŸ“… 2012 πŸ› John Wiley and Sons 🌐 English βš– 483 KB πŸ‘ 1 views

## Abstract Populations are shaped by the spatial structure of their environment: space organizes interactions between individuals locally, and gives rise to a global population structure. Both local and global population structures can have a profound influence on the evolutionary dynamics of a po

Techniques for bounding the convergence
Techniques for bounding the convergence rate of genetic algorithms
✍ Yuri Rabinovich; Avi Wigderson πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 308 KB πŸ‘ 2 views

The main purpose of the present paper is the study of computational aspects, ## Ε½ . and primarily the convergence rate, of genetic algorithms GAs . Despite the fact that such algorithms are widely used in practice, little is known so far about their theoretical properties, and in particular about

IMPROVEMENTS OF SIMPLE GENETIC ALGORITHM
IMPROVEMENTS OF SIMPLE GENETIC ALGORITHM IN STRUCTURAL DESIGN
✍ TING-YU CHEN; CHUNG-JEI CHEN πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 176 KB

The e ciency of Simple Genetic Algorithm (SGA) can be improved by some strategies. They are elitest strategy, multi-point crossover, identiΓΏcation of passive design variables, gradual increase of penalty parameter, and bit-wise local search. Topology optimization using GA is also discussed in this p