A new approach to dynamics analysis of genetic algorithms without selection
Tools
Tools
Tools
Okabe, T, Jin, Y and Sendhoff, B (2005) A new approach to dynamics analysis of genetic algorithms without selection
![[img]](/style/images/fileicons/application_pdf.png)
| PDF (licence) 32Kb | |
| PDF Available under License : See the attached licence file. 396Kb |
Official URL: http://dx.doi.org/10.1109/CEC.2005.1554708
Abstract
Theoretical analysis of the dynamics of evolutionary algorithms is believed to be very important to understand the search behavior of evolutionary algorithms and to develop more efficient algorithms. We investigate the dynamics of a canonical genetic algorithm with one-point crossover and mutation theoretically. To this end, a new theoretical framework has been suggested in which the probability of each chromosome in the offspring population can be calculated from the probability distribution of the parent population after crossover and mutation. Empirical studies are conducted to verify the theoretical analysis. The finite population effect is also discussed. Compared to existing approaches to dynamics analysis, our theoretical framework is able to provide richer information on population dynamics and is computationally more efficient. © 2005 IEEE.
| Item Type: | Conference or Workshop Item (Paper) |
|---|---|
| Additional Information: | © 2005 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
| Divisions: | Faculty of Engineering and Physical Sciences > Computing Science |
| ID Code: | 532841 |
| Deposited By: | Symplectic Elements |
| Deposited On: | 12 Jul 2012 14:07 |
| Last Modified: | 16 Feb 2013 16:03 |
Document Downloads
Repository Staff Only: item control page