[go: up one dir, main page]

Skip to main content

Improving the Genetic Algorithm’s Performance when Using Transformation

  • Conference paper
Artificial Neural Nets and Genetic Algorithms

Abstract

Transformation is a biologically inspired genetic operator that, when incorporated in the standard Genetic Algorithm can promote diversity in the population. Previous work using this genetic operator in the domain of function optimization and combinatorial optimization showed that the premature convergence of the population is avoided. Furthermore, the solutions obtained were, in general, superior to the solutions achieved by the GA with standard 1-point, 2-point and uniform crossover. In this paper we present an extensive empirical study carried to determine the best parameter setting to use with transformation in order to enhance the GA’s performance. These parameters include the gene segment length, the replacement rate (percentage of individuals of the previous population used to update the gene segment pool), and the mutation and transformation rates.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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.

Similar content being viewed by others

References

  1. D. E. Goldberg (1989). Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company, Inc, 1989.

    Google Scholar 

  2. Z. Michalewicz (1999). Genetic Algorithms\Data Structures = Evolution Programs. 3rd Edition Springer-Verlag, 1999.

    Google Scholar 

  3. P. J. Russell (1998). Genetics. 5th edition, Addison-Wesley, 1998.

    Google Scholar 

  4. A. Simões, E. Costa (2001a). Using Biological Inspiration to Deal with Dynamic Environments. Proceedings of the Seventh International Conference on Soft Computing (MENDEL’01), pp. 7–12, Brno, Czech Republic, 6–8 June, Brno University of Technology, 2001.

    Google Scholar 

  5. A. Simões, E. Costa (2001b). On Biologically Inspired Genetic Operators: Using Transformation in the Standard Genetic Algorithm. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO’2001), pp. 584–591, San Francisco, USA, 7–11 July, Morgan Kaufmann Publishers, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Wien

About this paper

Cite this paper

Simões, A., Costa, E. (2003). Improving the Genetic Algorithm’s Performance when Using Transformation. In: Pearson, D.W., Steele, N.C., Albrecht, R.F. (eds) Artificial Neural Nets and Genetic Algorithms. Springer, Vienna. https://doi.org/10.1007/978-3-7091-0646-4_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-7091-0646-4_32

  • Publisher Name: Springer, Vienna

  • Print ISBN: 978-3-211-00743-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics