6
Optimizing Continuous Functions
This chapter describes how continuous search-space optimization problems can be solved by genetic algorithms. We will start by describing the chromosomes and genetic operators commonly used for genetic algorithms with real number-based populations and go over the tools offered by the Distributed Evolutionary Algorithms in Python (DEAP) framework for this domain. We will then cover several hands-on examples of continuous function optimization problems and their Python-based solutions using the DEAP framework. These include the optimization of the Eggholder function, Himmelblau’s function, as well as the constrained optimization of Simionescu’s function. Along the way, we will learn about finding multiple solutions ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Read now
Unlock full access