Skip to main content

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

  • 382 Accesses

Abstract

EC is a class of nature-inspired algorithms that maintains a population of candidate solutions (individuals) and evolves toward the best answer(s). It has been frequently used to solve difficult real-world optimization problems since it evolves numerous solutions at the same time, which contribute to the notable characteristic of EC as being frequently insensitiveness to local minimal.

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 99.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 129.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 199.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

References

  1. Janis, C. (1976). The evolutionary strategy of the equidae and the origins of rumen and cecal digestion. Evolution,30(4), 757–774.

    Google Scholar 

  2. Deb, K., Pratap, A., Agarwal, S., & Meyarivan, T. (2002). A fast and elitist multiobjective genetic algorithm: Nsga-II. IEEE Transactions on Evolutionary Computation,6(2), 182–197.

    Google Scholar 

  3. Sun, Y., Yen, G. G., & Yi, Z. (2018b). IGD indicator-based evolutionary algorithm for many-objective optimization problems. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/TEVC.2018.2791283.

  4. Mitchell, M. (1996). An introduction to genetic algorithms. MIT Press.

    Google Scholar 

  5. Schmitt, L. M. (2001). Theory of genetic algorithms. Theoretical Computer Science,259(1-2), 1–61.

    Google Scholar 

  6. Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. In Conference on neural networks (Vol. 4). IEEE International.

    Google Scholar 

  7. Eberhart, R., & Kennedy, J. (1995). A new optimizer using particle swarm theory. In Proceedings of the Sixth International Symposium on Micro Machine and Human Science, 1995. MHS’95 (pp. 39–43). IEEE.

    Google Scholar 

  8. Storn, R., & Price, K. (1997) Differential evolution—a simple and efficient heuristic for global optimization over continuous spaces. https://doi.org/10.1023/A:1008202821328.

  9. Price, K. V., Storn, R. A., & Lampinen, J. A. et al. (2005). Differential evolution: a practical approach to global optimization, Chapter 2 (pp. 37–42). Springer.

    Google Scholar 

  10. Walker, Matthew. (2001). Introduction to genetic programming. Tech. Np: University of Montana.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yanan Sun .

Rights and permissions

Reprints and permissions

Copyright information

© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Sun, Y., Yen, G.G., Zhang, M. (2023). Evolutionary Computation. In: Evolutionary Deep Neural Architecture Search: Fundamentals, Methods, and Recent Advances. Studies in Computational Intelligence, vol 1070. Springer, Cham. https://doi.org/10.1007/978-3-031-16868-0_1

Download citation

Publish with us

Policies and ethics