Computational Intelligence

Exercises 93

survival of the fittest and/or evolution. Third, the five evolutionary algorithms

employ direct “fitness” information instead of function derivatives or other related

knowledge. Therefore, evolutionary algorithms can solve problems that are not

continuous, not differentiable, and multimodal. Fourth, randomness plays roles

in all of the algorithms. The search process is not deterministic. It is this random-

ness and the “fitness” information that gives evolutionary algorithms the ability

to enable individuals to move to anywhere and escape from local

optima.

Finally, the y all generate the next generation from the previous generation. In

particle ...