Skip to main content

Towards the Impact of the Random Sequence on Genetic Algorithms

  • Conference paper
Artificial Intelligence and Computational Intelligence (AICI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6320))

Abstract

The impact of the random sequence on Genetic Algorithms (GAs) is rarely discussed in the community so far. The requirements of GAs for Pseudo Random Number Generators (PRNGs) are analyzed, and a series of numerical experiments of Genetic Algorithm and Direct Search Toolbox computing three different kinds of typical test functions are conducted.An estimate of solution accuracy for each test function is included when six standard PRNGs on MATLAB are applied respectively. A ranking is attempted based on the estimated solution absolute/relative error. It concludes that the effect of PRNGs on GAs varies with the test function; that generally speaking, modern PRNGs outperform traditional ones, and that the seed also has a deep impact on GAs. The research results will be beneficial to stipulate proper principle of PRNGs selection criteria for GAs.

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.

References

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

    Google Scholar 

  2. Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Kluwer Academic Publishers, Boston (1989)

    MATH  Google Scholar 

  3. Marasaglia, G.: Random Numbers Fall Mainly in the Planes. Proc. Nat. Acad. Sci. U.S.A. 12, 25–28 (1968)

    Article  MathSciNet  Google Scholar 

  4. Entacher, K.: Bad Subsequences of Well-Known Linear Congruential Pseudorandom Number Generators. ACM Transactions on Modeling and Computer Simulation 7, 61–70 (1998)

    Article  MATH  Google Scholar 

  5. Ecuyer, P.L.: Random Number Generation. In: Handbook of Computational Statistics. Springer, Berlin (2004)

    Google Scholar 

  6. Zeigler, B.P., Kim, J.: Asynchronous Genetic Algorithms on Parallel Computers. In: 5th International Conference on Genetic Algorithms, pp. 75–83. Morgan Kaufmann Publishers, San Francisco (1991)

    Google Scholar 

  7. GAs Playground, http://www.aridolan.com/ofiles/ga/gaa/gaa.aspx#Examples

  8. Lagarias, J.C., Reeds, J.A., Wright, M.H., Wright, P.E.: Convergence Properties of the Nelder-Mead Simplex Method in Low Dimensions. SIAM Journal of Optimization 9, 112–147 (1998)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yu, Y., Xu, X. (2010). Towards the Impact of the Random Sequence on Genetic Algorithms. In: Wang, F.L., Deng, H., Gao, Y., Lei, J. (eds) Artificial Intelligence and Computational Intelligence. AICI 2010. Lecture Notes in Computer Science(), vol 6320. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16527-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-16527-6_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-16526-9

  • Online ISBN: 978-3-642-16527-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics