Skip to main content

An Argument Against the Principle of Minimal Alphabet

  • Conference paper
Artificial Neural Nets and Genetic Algorithms
  • 222 Accesses

Abstract

For many years the field of Genetic Algorithms (GAs) has been dominated by bit-string based GAs. The argument as to why bit-strings are the best method of encoding parameters in GA strings is known as the principle of minimal alphabet.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Caruana R.A. and Schaffer J.D., Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms, Proc. Fifth International Conference on Machine Learning, 153 (1988).

    Google Scholar 

  2. Davis L., Adapting Operator Probabilities in Genetic Algorithms, Proc. Third International Conference on Genetic Algorithms, 61 (1989).

    Google Scholar 

  3. Gibson G.M., Application of Genetic Algorithms to Mixed Schedule and Parameter Optimisation for a Visual Interactive Modeller, Proc. Fifth Workshop on Neural Networks, 119 (1993a).

    Google Scholar 

  4. Gibson G.M., A Genetic Algorithm for Optimising Problems with Embedded Design Decisions, Proc. 6th Australian Joint Conference on Artificial Intelligence, 99 (1993b).

    Google Scholar 

  5. Goldberg D.E., Genetic Algorithms in Search, Optimisation & Machine Learning, Addison-Wesley, New York NY, (1989).

    Google Scholar 

  6. Grefenstette J.J. and Baker J.E., How Genetic Algorithms Work: A Critical Look at Implicit Parallelism, Proc. Third International Conference on Genetic Algorithms, 20 (1989).

    Google Scholar 

  7. Holland J.H., Adaptation in Natural and Artificial Systems, Ann Arbor: The University of Michigan Press, (1975).

    Google Scholar 

  8. Holland J.H., Adaptation in Natural and Artificial Systems, MIT Press, (1993).

    Google Scholar 

  9. Koza J.R. 1992, Genetic Programming: On the Programming of Computers by Means of Natural Selection, MIT Press.

    Google Scholar 

  10. Levenick J.R., Inserting Introns Improves Genetic Algorithm Success Rate: Taking a Cue from Biology, Proc. Fourth International Conference on Genetic Algorithms, 123 (1991).

    Google Scholar 

  11. Wills C., The Wisdom of the Genes, Basic Books, New York, (1989).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag/Wien

About this paper

Cite this paper

Gibson, G.M. (1995). An Argument Against the Principle of Minimal Alphabet. In: Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-7535-4_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-7535-4_41

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-82692-8

  • Online ISBN: 978-3-7091-7535-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics