What You Learned

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

👈 Other Methods to Combat Convergence | TOC | Chapter 8 Replacing and Transitioning 👉

In this chapter, you learned about premature convergence and some of the conditions that lead to premature convergence. You saw how mutation can help prevent premature convergence and learned about what mutation is and how it works.

You also implemented flip mutation, scramble mutation, and Gaussian mutation that you can use for binary, permutation, and real-value genotypes, respectively. You saw how to add additional parameters to adjust the aggressiveness of these mutations, and you learned which ones are the best to implement for different problems.

Finally, you briefly learned about other strategies for preventing premature convergence and how mutation is the most common and often all you need.

In the next chapter, you’ll learn how to move on from old populations and how to combine the parents, children, and mutants that you’ve been producing in the previous chapters.

Copyright © 2021, The Pragmatic Bookshelf.

👈 Other Methods to Combat Convergence | TOC | Chapter 8 Replacing and Transitioning 👉

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.