Hybridization of evolutionary algorithms and local search by means of a clustering method.
This paper presents a hybrid evolutionary algorithm (EA) to solve nonlinear-regression problems. Although EAs have proven their ability to explore large search spaces, they are comparatively inefficient in fine tuning the solution. This drawback is usually avoided by means of local optimization algorithms that are applied to the individuals of the population. The algorithms that use local optimization procedures are usually called hybrid algorithms. On the other hand, it is well known that the clustering process enables the creation of groups (clusters) with mutually close points that hopefully correspond to relevant regions of attraction. Local-search procedures can then be started once in every such region. This paper proposes the combination of an EA, a clustering process, and a local-search procedure to the evolutionary design of product-units neural networks. In the methodology presented, only a few individuals are subject to local optimization. Moreover, the local optimization algorithm is only applied at specific stages of the evolutionary process. Our results show a favorable performance when the regression method proposed is compared to other standard methods.
Martínez-Estudillo
Alfonso C
AC
Department of Management and Quantitative Methods, ETEA, University of Córdoba, Córdoba 14004, Spain. acme@etea.com
Hervás-Martínez
César
C
Martínez-Estudillo
Francisco J
FJ
García-Pedrajas
Nicolás
N
D000465:Algorithms; D001185:Artificial Intelligence; D005075:Biological Evolution; D016000:Cluster Analysis; D016247:Information Storage and Retrieval / Q000379:methods*; D017711:Nonlinear Dynamics; D010363:Pattern Recognition, Automated / Q000379:methods*; D012044:Regression Analysis