𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convergence of genetic algorithms

✍ Scribed by R. R. Sharapov; A. V. Lapshin

Book ID
110209353
Publisher
SP MAIK Nauka/Interperiodica
Year
2006
Tongue
English
Weight
182 KB
Volume
16
Category
Article
ISSN
1054-6618

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

A study on the convergence of genetic al
A study on the convergence of genetic algorithms
✍ B.M. Kim; Y.B. Kim; C.H. Oh πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 443 KB

This paper extends genetic algorithms to achieve fast solutions to difficult problem. To accomplish this, we present empirical results on the terminated condition by bias and the functionized model of mutation rate in genetic algerithms. The terminated condition by bias enable to reducing computati

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