Evolutionary algorithms with clustering for dynamic fitness landscapes
Interest on dynamic multimodal functions risen over the last years since many real problems have this feature. On these problems, the goal is no longer to find the global optimal, but to track their progression through the space as closely as possible. This paper presents three evolutionary algorith...
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2005
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/9593 http://journal.info.unlp.edu.ar/wp-content/uploads/JCST-Dec05-6.pdf |
| Aporte de: |
| Sumario: | Interest on dynamic multimodal functions risen over the last years since many real problems have this feature. On these problems, the goal is no longer to find the global optimal, but to track their progression through the space as closely as possible. This paper presents three evolutionary algorithms for dynamic fitness landscapes. In order to maintain diversity in the population they use two clustering techniques and a macromutation operator. Besides, this paper compares two crossover operators: arithmetic and multiparents two points, respectively. Effectiveness and limitations of each algorithm are discuss anda analyzed. |
|---|