An adaptive neighboring search using crossover-like mutation for multi modal function optimization

16Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

We propose a new population-based Evolutionary Algorithm, which uses real-coded representation and normal distribution crossover-like mutation for generating next searching points. This Gaussian distribution is formed based on the position relationship between an individual and its neighbors, and is not carried with self-adapting parameters as inheritable traits. This algorithm causes emergence of clusters of individuals within the population, as the result of evolutions of each individuals without intent to cluster. Through searching independently, that emergent clusters introduce various solutions that include optimum at the same time, even if the problem has strong local minima. The proposed method robustly solves highly multimodal 30-dimensional Fletcher and Powell function by small population size.

Cite

CITATION STYLE

APA

Takahashi, O., & Kobayashi, S. (2001). An adaptive neighboring search using crossover-like mutation for multi modal function optimization. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics (Vol. 1, pp. 261–267). https://doi.org/10.1109/icsmc.2001.969822

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free