𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convergence Criteria for Genetic Algorithms

✍ Scribed by Greenhalgh, David; Marshall, Stephen

Book ID
118177529
Publisher
Society for Industrial and Applied Mathematics
Year
2000
Tongue
English
Weight
147 KB
Volume
30
Category
Article
ISSN
0097-5397

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Convergence of genetic algorithms
Convergence of genetic algorithms
✍ R. R. Sharapov; A. V. Lapshin πŸ“‚ Article πŸ“… 2006 πŸ› SP MAIK Nauka/Interperiodica 🌐 English βš– 182 KB
Genetic algorithms: bridging the converg
Genetic algorithms: bridging the convergence gap
✍ J.A. Lozano; P. LarraΓ±aga; M. GraΓ±a; F.X. Albizuri πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 105 KB

In this paper we consider the extension of genetic algorithms (GAs) with a probabilistic Boltzmann reduction operator and prove their convergence to the optimum. The algorithm can be seen as a hybridisation between GAs and simulated annealing (SA), i.e. a SA-like GA. The "temperature" parameter allo

Techniques for bounding the convergence
Techniques for bounding the convergence rate of genetic algorithms
✍ Yuri Rabinovich; Avi Wigderson πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 308 KB πŸ‘ 2 views

The main purpose of the present paper is the study of computational aspects, ## Ε½ . and primarily the convergence rate, of genetic algorithms GAs . Despite the fact that such algorithms are widely used in practice, little is known so far about their theoretical properties, and in particular about