Dynamics in Proportionate Selection.
- Abhishek AgrawalAffiliated withMiddlesex University
- , Ian MitchellAffiliated withMiddlesex University
- , Peter PassmoreAffiliated withMiddlesex University
- , Ivan LitovskiAffiliated withMiddlesex University
This paper proposes a new selection method for Genetic Algorithms. The motivation behind the proposed method is to investigate the effect of different selection methods on the rate of convergence. The new method Dynamic Selection Method (DSM) is based on proportionate selection. DSM functions by continuously changing the criteria for parent selection (dynamic) based on the number of generations in a run and the current generation. Results show that by using DSM to maintain diversity in a population gives slower convergence, but, their overall performance was an improvement. Relationship between slower convergences, in GA runs, leading to better solutions, has been identified.
- Dynamics in Proportionate Selection.
- Book Title
- Adaptive and Natural Computing Algorithms
- Book Subtitle
- Proceedings of the International Conference in Coimbra, Portugal, 2005
- Book Part
- Part II
- pp 226-229
- Print ISBN
- Online ISBN
- Springer Vienna
- Copyright Holder
- Additional Links
- Industry Sectors
- Editor Affiliations
- 1. Departamento de Engenharia Informática, Universidade de Coimbra
- 2. Institut für Informatik, Universität Innsbruck
- 3. Fakulteta za Računalništvo in Informatiko, Univerza v Ljubljani
- 4. Equipe Universitaire de Recherche en Informatique de Saint-Etienne (Groupe de Recherche de Roanne) Institut Universitaire de Technologie de Roanne, Université Jean Monnet
- 5. Division of Mathematics School of Mathematical and Information Sciences, Coventry University
- Author Affiliations
- 6. Middlesex University, Hendon, London, NW4 4BT, UK
To view the rest of this content please follow the download PDF link above.