In this paper we present a new method for hybrid evolutionary algorithms where only a few best individuals are subject to local optimization. Moreover, the optimization algorithm is only applied at specific stages of the evolutionary process. The key aspect of our work is the use of a clustering algorithm to select the individuals to be optimized. The underlying idea is that we can achieve a very good performance if, instead of optimizing many very similar individuals, we optimize just a few different individuals. This approach is less computationally expensive. Our results show a very interesting performance when this model is compared to other standard algorithms. The proposed model is evaluated in the optimization of the structure and weights of product-unit based neural networks. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Martínez-Estudillo, F., Hervás-Martínez, C., Martínez-Estudillo, A., & Ortíz-Boyer, D. (2005). Memetic algorithms to product-unit neural networks for regression. In Lecture Notes in Computer Science (Vol. 3512, pp. 83–90). Springer Verlag. https://doi.org/10.1007/11494669_11
Mendeley helps you to discover research relevant for your work.