Hands-On Genetic Algorithms with Python

Constrained optimization with genetic algorithms

We have already dealt with constraints in Chapter 5, Constraint Satisfaction, when we tackled constraints within the realm of search problems. However, while search problems presented us with invalid states or combinations, here we need to address constraints in the continuous space, defined as mathematical inequalities.

The approaches for both cases, however, are similar, and the differences lie in the implementation. Let's revisit these approaches:

• The best approach, when available, is to eliminate the possibility for a constraint violation. We have actually been doing it all along in this chapter as we have used bounded regions for our functions. These are actually simple constraints on ...