In the preceding chapter, we have thoroughly reviewed the existing approaches to make evolutionary algorithms more suitable for dynamic optimization problems. Most of these concentrate on either memorization or diversity as a means to facilitate adaptation. In this chapter, two new approaches of applying evolutionary algorithms to dynamic optimization problems are presented. The first one, called “memory/search”, combines the concepts of explicit memory and diversification in a particularly effective way. It is described in Section 1.
Weitere Kapitel dieses Buchs durch Wischen aufrufen
- From Memory to Self-Organization
- Springer US
- Chapter 4