Skip to main content

Structure and Operation of a Basic Genetic Algorithm

  • Conference paper
  • First Online:
Distributed Computing and Artificial Intelligence, 13th International Conference

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 474))

Abstract

This work describes the structure and the operation of a basic genetic algorithm. The studies show that the genetics algorithms (GAs) always offer an answer that tends to be the best over time, satisfied with knowledge on the problem, we can improve the function of evaluation that was always search of inside the current population those solutions that possess the best characteristic and tries to combine them of form to generate solutions still better and the process is repeated until we have obtained a solution for our problem.The (GA) go in the scene to resolve those problems whose exact algorithms are extremely slow or unable to obtain a solution.

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

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. Alander, J.T.: On aptimal population size of genetic algorithms. In: Procedings CompEuro 1992, Computer Systems and Software Engenering, 6th Annual European Computer Conference, pp. 65–70 (1992)

    Google Scholar 

  2. Costa, E., Simões, A.: Inteligência Artificial-Fundamentos e Aplicações, Capítulo 6, página 294, FCA-Editora informática, Lda, Lisboa-Portugal (2008)

    Google Scholar 

  3. Goldberg, D.E., Richardson, J.T.: Genetic Algorithms with sharing for multimodal function optimization. Genetic Algorithms and their Aplications. In: Procedings of the Second International Conference on Genetic Algorithms and their Aplication, pp. 41–49 (1987)

    Google Scholar 

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

    Google Scholar 

  5. Marques, A.: Introdução aos algoritmos genéticos, Compilação Brasileira (2005)

    Google Scholar 

  6. Perez, M.A.M.: Funcionamiento de un algoritmo genético, Grupo de Ingeniería de Organización, Universidad de Sevilla (2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Francisco João Pinto .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Pinto, F.J. (2016). Structure and Operation of a Basic Genetic Algorithm. In: Omatu, S., et al. Distributed Computing and Artificial Intelligence, 13th International Conference. Advances in Intelligent Systems and Computing, vol 474. Springer, Cham. https://doi.org/10.1007/978-3-319-40162-1_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40162-1_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40161-4

  • Online ISBN: 978-3-319-40162-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics