𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A study on the convergence of genetic algorithms

✍ Scribed by B.M. Kim; Y.B. Kim; C.H. Oh

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
443 KB
Volume
33
Category
Article
ISSN
0360-8352

No coin nor oath required. For personal study only.

✦ Synopsis

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 computation tima(CPU time) according to l imitted and pre-astimated number of generations. The functionized model of mutation operator reducing computation time and improving solution should be accomplished by applying quite low mutation rate on the continuing generation with remaining 95 percentage of bias.

πŸ“œ 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

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

Convergence of a hill-climbing genetic a
Convergence of a hill-climbing genetic algorithm for graph matching
✍ Andrew D.J. Cross; Richard Myers; Edwin R. Hancock πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 793 KB

This paper presents a convergence analysis for the problem of consistent labelling using genetic search. The work builds on a recent empirical study of graph matching where we showed that a Bayesian consistency measure could be e$ciently optimised using a hybrid genetic search procedure which incorp