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
On the convergence rates of genetic algorithms
β Scribed by Jun He; Lishan Kang
- Publisher
- Elsevier Science
- Year
- 1999
- Tongue
- English
- Weight
- 117 KB
- Volume
- 229
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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
In multiprocessor systems, iterative algorithms can be implemented synchronously or asynchronously. Unfortunately, few guidelines exist to make a choice. In this paper, we compare the execution times of an asynchronous iterative algorithm and of its synchronous counterpart. Synchronization overhead