Skip to main content

Part of the book series: Studies in Computational Intelligence ((SCI,volume 307))

Abstract

One of the most exciting aspects of life is its evolutionary nature where the individuals keep improving along with generations. Genetic Algorithms are an inspiration from this natural evolution and find themselves as powerful optimizing agents for solving numerous real life applications. These algorithms can model complex problems and return the optimal solution in an iterative manner. This chapter presents the manner in which we model and solve the problem using this evolutionary technique. The role of the various parameters and optimal parameter setting as per the problem requirements would be discussed. The chapter would present mutation, selection, crossover and other genetic operators. Evolution forms the base for most of the complex systems that are designed to evolve with time. In this chapter we hence first study the basic concepts and then take an inspiration towards evolving systems. At the same time we present the limitations of evolution that marks a threshold to massive potential of problem solving that these algorithms have.

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 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover 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. Bäck, T.: Evolutionary Algorithms in Theory and Practice: Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford (1996)

    Google Scholar 

  2. Bäck, T., Hoffmeister, F.: Extended selection mechanisms in genetic algorithms. In: Belew, R.K., Booker, L.B. (eds.) Proc. of the Fourth Intl. Conf. Genetic Algorithms. Morgan Kaufmann, San Francisco (1991)

    Google Scholar 

  3. Baker, J.E.: Adaptive selection methods for genetic algorithms. In: Grefenstette, J.J. (ed.) Proc. of the First Intl. Conf. on Genetic Algorithms and Their Appl. Erlbaum, Mahwah (1985)

    Google Scholar 

  4. Chakraborty, U.K., Dastidar, D.G.: Using reliability analysis to estimate the number of generations to convergence in genetic algorithm. Inf. Process. Lett. 46, 199–209 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  5. Chakraborty, U.K., Deb, K., Chakraborty, M.: Analysis of selection algorithms: A Markov chain approach. Evol. Comput. 4(2), 133–167 (1996)

    Article  Google Scholar 

  6. Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1987)

    Google Scholar 

  7. Deb, K., Goldberg, D.E.: An investigation of niche and species formation in genetic function optimization. In: Schaffer, J.D. (ed.) Proc. of the Third Intl. Conf. on Genetic Algorithms. Morgan Kaufmann, San Francisco (1989)

    Google Scholar 

  8. Fogel, D.B.: Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. IEEE Press, Los Alamitos (1995)

    Google Scholar 

  9. Forrest, S., Mitchell, M.: What makes a problem hard for a genetic algorithm? Some anomalous results and their explanation. Mach. Learn. 13, 285–319 (1993)

    Google Scholar 

  10. Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)

    MATH  Google Scholar 

  11. Goldberg, D.E.: Sizing populations for serial and parallel genetic algorithms. In: Schaffer, J.D. (ed.) Proc. of the Third Intl. Conf. on Genetic Algorithms. Morgan Kaufmann, San Francisco (1989)

    Google Scholar 

  12. Goldberg, D.E., Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. In: Rawlins, G. (ed.) Foundations of Genetic Algorithms. Morgan Kaufmann, San Francisco (1991)

    Google Scholar 

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

    Google Scholar 

  14. Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)

    MATH  Google Scholar 

  15. Lobo, F.G., Lima, C.F., Michalewicz, Z.: Parameter Setting in Evolutionary Algorithms. Springer, Heidelberg (2007)

    Book  MATH  Google Scholar 

  16. Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Berlin (1992)

    MATH  Google Scholar 

  17. Mitchell, M.: An Introduction to Genetic Algorithms. MIT Press, Cambridge (1999)

    Google Scholar 

  18. Schwefel, H.P.: Evolution and Optimum Seeking. Wiley, Chichester (1995)

    Google Scholar 

  19. Whitley, L.D.: The Genitor algorithm and selection pressure: Why rank−based allocation of reproductive trials is best. In: Schaffer, J.D. (ed.) Proc. of the Third Intl. Conf. on Genetic Algorithms. Morgan Kaufmann, San Francisco (1989)

    Google Scholar 

Download references

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Shukla, A., Tiwari, R., Kala, R. (2010). Genetic Algorithm. In: Towards Hybrid and Adaptive Computing. Studies in Computational Intelligence, vol 307. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14344-1_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14344-1_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14343-4

  • Online ISBN: 978-3-642-14344-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics