The theory of virtual alphabets

  • David E. Goldberg
Genetic Algorithms Genetic Algorithm Theory

DOI: 10.1007/BFb0029726

Part of the Lecture Notes in Computer Science book series (LNCS, volume 496)
Cite this paper as:
Goldberg D.E. (1991) The theory of virtual alphabets. In: Schwefel HP., Männer R. (eds) Parallel Problem Solving from Nature. PPSN 1990. Lecture Notes in Computer Science, vol 496. Springer, Berlin, Heidelberg


This paper presents a theory of convergence for real-coded genetic algorithms—GAs that use floating-point or other high-cardinality codings in their chromosomes. The theory is consistent with the theory of schemata and postulates that selection dominates early GA performance and restricts subsequent search to intervals with above-average function value dimension by dimension. These intervals may be further subdivided on the basis of their attraction under genetic hillclimbing. Each of these subintervals is called a virtual character, and the collection of characters along a given dimension is called a virtual alphabet. It is the virtual alphabet that is searched during the recombinative phase of the genetic algorithm, and in many problems this is sufficient to ensure that good solutions are found. Although the theory helps explain why many problems have been solved using real-coded GAs, it also suggests that real-coded GAs can be blocked from further progress in those situations when local optima separate the virtual characters from the global optimum.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • David E. Goldberg
    • 1
  1. 1.University of Illinois at Urbana-ChampaignUrbana

Personalised recommendations