Skip to main content

Part of the book series: Studies in Big Data ((SBD,volume 59))

  • 564 Accesses

Abstract

A lot of typical problems that have to be commonly solved in engineering or business can be formulated as optimization problems. The performance of an activity or the value of a decision are characterized by a certain cost function, and here, possible alternatives are considered.

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

Notes

  1. 1.

    The best-fitted individual is not typically detected in the last generation.

  2. 2.

    A fraction coefficient between zero and one is randomly chosen from the uniform distribution.

  3. 3.

    In genetic programming, bloat can be described as excessive code growth within the individuals of the evolving population without a proportional improvement in fitness, whereas introns are (redundant or unproductive) the parts of the code that do not contribute to the calculation that is being made.

  4. 4.

    A crowding distance can be estimated by the perimeter of a cuboid formed by using the nearest neighbors in the objective space as the vertices.

References

  1. Boussaid I, Lepagnot J, Siarry P (2013) Inf Sci 237:82–117

    Google Scholar 

  2. Eiben A, Smith J (2015) Introduction to evolutionary computing, 2nd edn. Springer, Berlin

    Book  Google Scholar 

  3. Back T (1996) Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms. Oxford University Press, Oxford

    MATH  Google Scholar 

  4. Michalewicz Z (1996) Genetic algorithms \(+\) data structures \(=\) evolution programs, 3rd edn. Springer, Berlin

    Book  Google Scholar 

  5. Holland J (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor

    Google Scholar 

  6. Schwefel H (1981) Numerical optimization of computer models. Wiley, Hoboken

    MATH  Google Scholar 

  7. Koza J (1992) Genetic programming: on the programming of computers by means of natural selection. MIT Press, Cambridge

    MATH  Google Scholar 

  8. Fogel L, Owens A, Walsh M (1966) Artificial intelligence through simulated evolution. John Wiley, Hoboken

    MATH  Google Scholar 

  9. Holland J (1980) Int J Policy Anal Inf Syst 4(3):245–268

    Google Scholar 

  10. Storn R, Price K (1997) J Glob Optim 11(4):341–359

    Article  Google Scholar 

  11. De Jong K (2006) Evolutionary computation: a unified approach. MIT Press, Cambridge

    Google Scholar 

  12. Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: toward memetic algorithms. Caltech concurrent computation program, 790

    Google Scholar 

  13. Krasnogor N, Smith J (2005) IEEE Trans Evol Comput 9(5):474–488

    Article  Google Scholar 

  14. Blickle T, Thiele L (1996) Evol Comput 4(4):361–394

    Article  Google Scholar 

  15. Sipper M, Fu W, Ahuja K, Moore J (2018) BioData Min 11:2

    Article  Google Scholar 

  16. Eiben A, Hinterding R, Michalewicz Z (1999) IEEE Trans Evol Comput 3(2):124–141

    Article  Google Scholar 

  17. Kretowski M (2008) Obliczenia ewolucyjne w eksploracji danych. Globalna indukcja drzew decyzyjnych, Wydawnictwo Politechniki Bialostockiej

    Google Scholar 

  18. Golberg D (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Boston

    Google Scholar 

  19. Larranaga P, Kuijpers C, Murga R, Inza I, Dizdarevic S (1999) Artif Intell Rev 13(2):129–170

    Article  Google Scholar 

  20. Schwefel H (1995) Evolution and optimum seeking. Wiley, Hoboken

    MATH  Google Scholar 

  21. Doerr B, Happ E, Klein C (2012) Theoretical Computer Science 425:17–33

    Article  MathSciNet  Google Scholar 

  22. Freitas A (2002) Data mining and knowledge discovery with evolutionary algorithms. Springer, Berlin Heidelberg

    Book  Google Scholar 

  23. Michalewicz Z, Fogel D (2004) How to Solve It: Modern Heuristics, 2nd edn. Springer

    Google Scholar 

  24. Deb K (2001) Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley & Sons

    Google Scholar 

  25. Zhou A, Qu B, Li H, Zhao S, Suganthan P, Zhang Q (2011) Swarm and Evolutionary Computation 1(1):32–49

    Article  Google Scholar 

  26. Zitzler E, Thiele L (1999) IEEE Trans Evol Comput 3(4):257–271

    Article  Google Scholar 

  27. Deb K, Pratap A, Agarwal S, Meyarivan T (2002) IEEE Trans Evol Comput 6(2):182–197

    Article  Google Scholar 

  28. Zhang X, Tian Y, Cheng R, Jin Y (2015) IEEE Trans Evol Comput 19(2):201–213

    Article  Google Scholar 

  29. Fortin F, Parizeau M (2013) Revisiting the NSGA-II crowding-distance computation. In: Proc. of GECCO’13, ACM pp 623–630

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Marek Kretowski .

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Kretowski, M. (2019). Evolutionary Computation. In: Evolutionary Decision Trees in Large-Scale Data Mining. Studies in Big Data, vol 59. Springer, Cham. https://doi.org/10.1007/978-3-030-21851-5_1

Download citation

Publish with us

Policies and ethics