A genetic algorithm tutorial

  title={A genetic algorithm tutorial},
  author={L. D. Whitley},
  journal={Statistics and Computing},
  • L. D. Whitley
  • Published 1 June 1994
  • Computer Science
  • Statistics and Computing
This tutorial covers the canonical genetic algorithm as well as more experimental forms of genetic algorithms, including parallel island models and parallel cellular genetic algorithms. The tutorial also illustrates genetic search by hyperplane sampling. The theoretical foundations of genetic algorithms are reviewed, include the schema theorem as well as recently developed exact models of the canonical genetic algorithm. 

A Genetic Programming Tutorial

This chapter introduces the basics of genetic programming and touches upon some of the more advanced variants of genetic Programming as well as its theoretical foundations.

An Introduction to Genetic Algorithms and Evolution

The history, theory and mathematical background, applications, and the current direction of both Genetic Algorithms and Evolution Strategies are examined.

Genetic Algorithms

This article provides an introduction to genetic algorithms as well as numerous pointers for obtaining additional information.

Genetic algorithms overview

This paper presents genetic algorithms, adaptive methods which may be used to solve search and optimisation problems, and the basic principles of GAs, first laid down rigorously by Holland.

A New P System Based Genetic Algorithm

The new P system based genetic algorithm (PBGA), based on the parallel mechanism of P system in membrane computing, is put forward so that the performance of GA can improve.

An overview of evolutionary algorithms: practical issues and common pitfalls

Genetic Algorithm

Genetic Algorithms are a family of computational models inspired by evolution. These algorithms encode a potential solution to a specific problem on a simple chromosome-like data structure and apply

Foundations of Evolutionary Algorithms

  • A. Obuchowicz
  • Computer Science
    Stable Mutations for Evolutionary Algorithms
  • 2018
Evolutionary algorithms are a broad class of stochastic adaptation algorithms inspired by biological evolution—the process that allows populations of organisms to adapt to their surrounding

Genetic optimization algorithms applied toward mission computability models

This paper describes the genetic optimization algorithms to a mission-critical and constraints-aware computation problem.

Parallel Population Models for Genetic Algorithms

A flexible parallel population model for genetic algorithms is derived, which contains all the above models as a special case and could nevertheless be implemented on many parallel architectures.



Cellular Genetic Algorithms

This chapter introduces the applications of cellular automata in genetic algorithms, which makes it especially suitable for dealing with complex and nonlinear problems which are difficult to be solved by general searching methods.

Modeling Simple Genetic Algorithms

  • M. Vose
  • Computer Science
    Evolutionary Computation
  • 1995
The infinite- and finite-population models of the simple genetic algorithm are extended and unified, The result incorporates both transient and asymptotic GA behavior. This leads to an interpretation

A Survey of Evolution Strategies

Evolution Strategies are algorithms which imitate the principles of natural evolution as a method to solve parameter optimization problems and adaptation of the strategy parameters for the mutation variances as well as their covariances are described.

Genetic Algorithms for Real Parameter Optimization

Selection in Massively Parallel Genetic Algorithms

This paper characterize the difference between panmictic and local selection/mating schemes in terms of diversity of alleles, diversity of genotypes, the inbreeding, and the speed and robustness of the genetic algorithm.

Explicit Parallelism of Genetic Algorithms through Population Structures

This paper specifies an algorithm which uses only local rules and local data making it massively parallel with an observed linear speedup on a transputer-based parallel system, and shows that both convergence speed and final quality are improved in comparison to a genetic algorithm without population structure.

A Study of Reproduction in Generational and Steady State Genetic Algorithms

A Note on Boltzmann Tournament Selection for Genetic Algorithms and Population-Oriented Simulated Annealing

In this note, the motivation, the theory of operation, some proof-of-principle computational experiments, and a Pascal implementation of the algorithm are presented.

An Executable Model of a Simple Genetic Algorithm