𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Convergence Time for the Linkage Learning Genetic Algorithm

✍ Scribed by Chen, Ying-ping; Goldberg, David E.

Book ID
120487396
Publisher
MIT Press
Year
2005
Tongue
English
Weight
243 KB
Volume
13
Category
Article
ISSN
1063-6560

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

[Studies in Fuzziness and Soft Computing
[Studies in Fuzziness and Soft Computing] Extending the Scalability of Linkage Learning Genetic Algorithms Volume 190 || Convergence Time for the Linkage Learning Genetic Algorithm
✍ Chen, Ying-ping πŸ“‚ Article πŸ“… 2005 πŸ› Springer-Verlag 🌐 German βš– 693 KB

genetic Algorithms (gas) Are Powerful Search Techniques Based On Principles Of Evolution And Widely Applied To Solve Problems In Many Disciplines. However, Most Gas Employed In Practice Nowadays Are Unable To Learn Genetic Linkage And Suffer From The Linkage Problem. The Linkage Learning Genetic Alg

Convergence Criteria for Genetic Algorit
Convergence Criteria for Genetic Algorithms
✍ Greenhalgh, David; Marshall, Stephen πŸ“‚ Article πŸ“… 2000 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 147 KB
Convergent Learning Algorithms for Unkno
Convergent Learning Algorithms for Unknown Reward Games
✍ Chapman, Archie C.; Leslie, David S.; Rogers, Alex; Jennings, Nicholas R. πŸ“‚ Article πŸ“… 2013 πŸ› Society for Industrial and Applied Mathematics 🌐 English βš– 657 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