Hybrid Evolutionary Search Method Based on Clusters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Genetic regulatory network-based symbiotic evolution
Expert Systems with Applications: An International Journal
An adaptive annealing genetic algorithm for the job-shop planning and scheduling problem
Expert Systems with Applications: An International Journal
Information Sciences: an International Journal
Convergence analysis and improvements of quantum-behaved particle swarm optimization
Information Sciences: an International Journal
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
Fundamenta Informaticae
Hi-index | 0.01 |
This paper aims at establishing fundamental theoretical properties for a class of “genetic algorithms” in continuous space (GACS). The algorithms employ operators such as selection, crossover, and mutation in the framework of a multidimensional Euclidean space. The paper is divided into two parts. The first part concentrates on the basic properties associated with the selection and mutation operators. Recursive formulae for the GACS in the general infinite population case are derived and their validity is rigorously proven. A convergence analysis is presented for the classical case of a quadratic cost function. It is shown how the increment of the population mean is driven by its own diversity and follows a modified Newton's search. Sufficient conditions for monotonic increase of the population mean fitness are derived for a more general class of fitness functions satisfying a Lipschitz condition. The diversification role of the crossover operator is analyzed in Part II. The treatment adds much light to the understanding of the underlying mechanism of evolution-like algorithms