Hybridization of evolutionary algorithms and local search by means of a clustering method

Citations Over TimeTop 10% of 2006 papers

Abstract

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.

Related Papers

• → Fitness and Distance Based Local Search With Adaptive Differential Evolution for Multimodal Optimization Problems(2023)45 cited
• → Escaping Local Optima with Local Search: A Theory-Driven Discussion(2022)9 cited
• → Delayed improvement local search(2021)4 cited
• → Boosting Local Search with Artificial Ants(2001)2 cited