What You Learned

Genetic Algorithms in Elixir — by Sean Moriarity (42 / 101)

👈 Exploring Different Types of Optimization | TOC | Chapter 5 Selecting the Best 👉

In this chapter, you explored the importance of evaluation. You saw how bad fitness functions can yield incorrect solutions through the lense of a knapsack problem. You also explored the different ways of terminating your algorithm.

After you solved your shipping problem, you dove deeper into fitness and fitness functions and were introduced to the schema theorem, or the fundamental theorem of genetic algorithms. You saw how the schema theorem relates to fitness functions, and you explored the concepts of heuristics.

Finally, you were briefly introduced to two unique types of optimization that require different evaluation techniques.

With your evaluation techniques in place, it’s time to move on to the next stage in the genetic algorithm: selection.

Copyright © 2021, The Pragmatic Bookshelf.

👈 Exploring Different Types of Optimization | TOC | Chapter 5 Selecting the Best 👉

Genetic Algorithms in Elixir by Sean Moriarity can be purchased in other book formats directly from the Pragmatic Programmers. If you notice a code error or formatting mistake, please let us know here so that we can fix it.