On the convergence of genetic algorithms - A variational approach

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

Abstract

A variational approach is introduced to study the existence and uniqueness of stationary states and (exponential) stability of genetic algorithms with mutation and interactive selection.

Cite

CITATION STYLE

APA

Stannat, W. (2004). On the convergence of genetic algorithms - A variational approach. Probability Theory and Related Fields, 129(1), 113–132. https://doi.org/10.1007/s00440-003-0330-y

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