GA-Optimal fitness functions

  • Joseph L. Breeden
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1447)


Genetic algorihtms (GA) are supposed to suceed through the use of ‘implicit parallelism’ and ‘building blocks’. Given these properties, we can create rules for constructing GA-optimal fitness functions. Some of these rules are also relevant to evolutionary programming and evolution strategies searches. The goal is to help the practitioner develop an intuition about when GA are effective.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    D. H. Wolpert and W. G. Macready, “No Free Lunch Theorems for Search”, Santa Fe Institute Tech Report, 95-02-010, 1995.Google Scholar
  2. 2.
    D. B. Fogel, evolutionary computation. IEEE Press, 1995Google Scholar
  3. 3.
    T. Bäck and H-P Schwefel, “An Overview of Evolutionary Algorithms for Parameter Optimization”, Evolutionary computation, 1993, v. 1, n. 1, pp. 1–24.Google Scholar
  4. 4.
    J. H. Holland, Adaptation in Natural and Artificial Systems. Ann Arbor: U. of Michigan Press, 1975.Google Scholar
  5. 5.
    M. Mitchell, S. Forrest, and J. H. Holland, “The Royal Road for Genetic Algorithms: Fitness Landscapes and GA Performance”, Proceedings of the First European Conference on Artificial Life, 11–13 Dec, 1992, Cambridge, MA: MIT Press, pp. 245–254.Google Scholar
  6. 6.
    T. Jones and S. Forrest, “Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms”, Santa Fe Inst. Tech Report, 95-02-022. Presented at the Sixth International Conference on Genetic Algorithms, 1995.Google Scholar
  7. 7.
    Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. New York: Springer-Verlag, 1992.Google Scholar
  8. 8.
    L. Ingber, “Genetic Algorithms and Very Fast Simulated Reannealing: A Comparison”, Mathematical and Computer Modelling, v. 16, n. 11, 1992, pp. 87–100.Google Scholar
  9. 9.
    L. D. Whitley, “Fundamental Principles of Deception in Genetic Search,” in G. Rawlins editor, Foundations of Genetic Algorithms. Los Altos, CA: Morgan Kaufman, 1991.Google Scholar
  10. 10.
    D. E. Goldberg, “Simple Genetic Algorithms and the Minimal Deceptive Problem,” in L. D. Davis editor, Genetic Algorithms and Simulated Annealing, Research Notes in Artificial Intelligence. Los Altos, CA: Morgan Kaufman, 1987.Google Scholar
  11. 11.
    J. L. Breeden and N. H. Packard, “A Learning Algorithm for Optimal Representation of Experimental Data”, Intl. J. of Bifurcations and Chaos, v. 4, n. 2, 1994, pp. 311–326.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Joseph L. Breeden
    • 1
  1. 1.Center for Adaptive Systems Applications, Inc.Santa Fe

Personalised recommendations