Genetic algorithms + data structures = evolution programs (3rd ed.)
Genetic algorithms + data structures = evolution programs (3rd ed.)
The dynamical systems model of the simple genetic algorithm
Theoretical aspects of evolutionary computing
Modeling simple genetic algorithms
Evolutionary Computation
Foundations of Global Genetic Optimization
Foundations of Global Genetic Optimization
No free lunch theorems for optimization
IEEE Transactions on Evolutionary Computation
Hi-index | 0.00 |
Convergence of genetic algorithms in the form of asymptotic stability requirements is discussed. Some tools to measure convergence properties of genetic algorithms are introduced. A classification procedure is proposed that is based on the following conjecture: the entropy and the fractal dimension of trajectories of genetic algorithms produced by them are quantities that can characterize the algorithms. The role of these quantities as invariants of the algorithm classes is discussed together with the compression ratio of points of genetic algorithms.