Advertisement

A Redundant Representation for use by Genetic Algorithms on Parameter Optimisation Problems

  • A. J. Soper
  • P. F. Robbins
Conference paper

Abstract

In this paper we describe a redundant representation for use by genetic algorithms on continuous, parameter, optimisation problems and subject it to crossover. We examine the schemata induced by the representation and test its performance against a gray coded, binary representation and a real-coded representation acted on by the recombination operator BLX-0.5.

Keywords

Genetic Algorithm Binary Code High Mutation Rate Gray Code Recombination Operator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    T. Back, F. Hoffmeister, and H. Schwefel. A survey of evolution strategies. In R.K. Belew and L.B. Booker, editors, Proc. Fourth Intl Conference on Genetic Algorithms, pages 2–9, San Mateo, CA, 1991. Morgan Kaufmann.Google Scholar
  2. [2]
    J.D. Bagley. The behaviour of adaptive systems which employ genetic and correlation algorithms. Dissertation Abstracts International, 28(12), 1967.Google Scholar
  3. [3]
    R.A. Caruana and J.D. Schaffer. Representation and hidden bias: Gray vs. binary coding for genetic algorithms. In Proceedings of the 5th International Conference on Machine Learning, pages 153–161, San Mateo, CA, 1988. Morgan Kaufmann.Google Scholar
  4. [4]
    K. Deb and D.E. Goldberg. Analyzing deception in trap functions. In L.D. Whitley, editor, Foundations of Genetic Algorithms 2, pages 187–202. Morgan Kaufmann, San Mateo, CA, 1993.Google Scholar
  5. [5]
    L. Eshelman and J.D. Schaffer. Real-coded genetic algorithms and interval-schemata. In L.D. Whitley, editor, Foundations of Genetic Algorithms 2, pages 187–202. Morgan Kaufmann, San Mateo, CA, 1993.Google Scholar
  6. [6]
    L.J. Eshelman. The CHC adaptive search algorithm: How to have safe search when engaging in non-traditional genetic recombination. In G.J.E. Rawlins, editor, Foundations of Genetic Algorithms, pages 205–218. Morgan Kaufmann, San Mateo, CA, 1991.Google Scholar
  7. [7]
    T.C. Fogarty. Varying the probability of mutation in the genetic algorithm. In J. Schaffer, editor, Proc. of the Third Intl. Conference on Genetic Algorithms, pages 51–60, San Mateo, CA, 1989. Morgan Kaufmann.Google Scholar
  8. [8]
    N.J. Radcliffe. Forma analysis and random respectful recombination. In R.K. Belew and L.B. Booker, editors, Proc. Fourth Intl Conference on Genetic Algorithms, pages 222–229, San Mateo, CA, 1991. Morgan Kaufmann.Google Scholar
  9. [9]
    C. Reeves. Using genetic algorithms with small populations. In S. Forrest, editor, Proc. of the Fifth Intl. Conf. on Genetic Algorithms, pages 92–99, San Mateo, CA, 1993. Morgan Kaufmann.Google Scholar
  10. [10]
    P.F. Robbins. The use of a variable length chromosome for permutation manipulation. In D.W. Pearson, N.C. Steele, and R.E. Albrecht, editors, Artificial Neural Nets and Genetic Algorithms, pages 144–147, Wien, 1995. Springer-Verlag.Google Scholar
  11. [11]
    J.D. Schaffer, R.A. Caruana, L.J. Eshelman, and R. Das. Study of control parameters affecting online performance of genetic algorithms for function optimization. In J. Schaffer, editor, Proc. of the Third Intl. Conference on Genetic Algorithms, pages 51–60, San Mateo, CA, 1989. Morgan Kaufmann.Google Scholar
  12. [12]
    D. Whitley, T. Starkweather, and C. Bogart. Genetic algorithms and neural networks: Optimizing connections and connectivity. Parallel Computing, 14:347–361, 1990.CrossRefGoogle Scholar
  13. [13]
    A.H. Wright. Genetic algorithms for real parameter optimization. In G.J.E. Rawlins, editor, Foundations of Genetic Algorithms, pages 205–218. Morgan Kaufmann, San Mateo, CA, 1991.Google Scholar

Copyright information

© Springer-Verlag Wien 1998

Authors and Affiliations

  • A. J. Soper
    • 1
  • P. F. Robbins
    • 1
  1. 1.School of Computing and Mathematical SciencesUniversity of GreenwichLondonUK

Personalised recommendations