January 2020
Intermediate to advanced
346 pages
9h 8m
English
Earlier in this chapter, when optimizing Himmelblau's function, we were looking for more than one minimum location, and observed two possible ways to do that—one was changing the random seed, and the other was using niching and sharing. Here, we will demonstrate a third option, powered by constraints!
The niching technique we used for Himmelblau's function is sometimes called parallel niching as it attempts to locate several solutions at the same time. As we already mentioned, it is prone to several practical drawbacks. Serial niching (or sequential niching), on the other hand, is a method used to find one solution at a time. To implement serial niching, we use the genetic algorithm as usual and ...
Read now
Unlock full access