Abstract
In recent years, there has been a growing interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs). Among approaches developed for EAs to deal with DOPs, immigrants schemes have been proven to be beneficial. Immigrants schemes for EAs on DOPs aim at maintaining the diversity of the population throughout the run via introducing new individuals into the current population. In this paper, we carefully examine the mechanism of generating immigrants, which is the most important issue among immigrants schemes for EAs in dynamic environments. We divide existing immigrants schemes into two types, namely the direct immigrants scheme and the indirect immigrants scheme, according to the way in which immigrants are generated. Then experiments are conducted to understand the difference in the behaviors of different types of immigrants schemes and to compare their performance in dynamic environments. Furthermore, a new immigrants scheme is proposed to combine the merits of two types of immigrants schemes. The experimental results show that the interactions between the two types of schemes reveal positive effect in improving the performance of EAs in dynamic environments. © 2008 Springer-Verlag.
Original language | English |
---|---|
Pages (from-to) | 3-24 |
Number of pages | 22 |
Journal | Memetic Computing |
Volume | 1 |
Issue number | 1 |
Early online date | 11 Dec 2008 |
DOIs | |
Publication status | Published - Mar 2009 |
Externally published | Yes |
Keywords
- Dynamic Optimization Problem
- Evolutionary Algorithm
- Immigrants scheme