Offspring generation method using delaunay triangulation for real-coded genetic algorithms

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

To design crossover operators with high search ability in real-coded Genetic Algorithms, it will be efficient to utilize both information regarding the parent distribution and the landscape of the objective function. Here, we propose a new offspring generation method using Delaunay triangulation. The proposed method can concentrate offspring in regions with a satisfactory evaluation value, inheriting the parent distribution. Through numerical examples, the proposed method was shown to be capable of deriving the optimum with a smaller population size and lower number of evaluations than Simplex Crossover, which uses only information of the parent distribution. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Shimosaka, H., Hiroyasu, T., & Miki, M. (2006). Offspring generation method using delaunay triangulation for real-coded genetic algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4193 LNCS, pp. 828–838). Springer Verlag. https://doi.org/10.1007/11844297_84

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