| Abstract: |  The goal of this work is to explore the impact of clustering on the performance of evolutionary algorithms. This work focuses on hierarchical clustering. The effect of these modifications is tested on unimodal and multimodal functions with real representation. The results show that clustering is very problem dependent and may be useful for some multimodal problems where the algorithm was able to find better solution, but on the other side its application on unimodal problems is unsuitable in light of its time consumption.
|
|---|