Homogeneous genetic algorithms
- 1 March 2010
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 87 (3) , 476-490
Abstract
A new type of genetic algorithm (GA) is developed to mitigate one or both of the following two major difficulties that traditional GAs may suffer: (1) when the number of ‘active genes’ needs to be held constant or kept within some prescribed range, and (2) when the set of genes is much larger than the set of active genes of feasible solutions under consideration. These homogeneous GAs use (unordered) sets to represent ‘active genes’ in chromosomes rather than strings, and a correspondingly natural crossover operator is introduced. ‘Homogeneous’ refers to the fact that, in contrast to traditional GAs where pairs of genes that are ‘close’ have better chances of being preserved under crossover, there is no notion of proximity between pairs of genes. Examples are provided that will demonstrate superior performance of these new GAs for some typical problems in which these difficulties arise.Keywords
This publication has 14 references indexed in Scilit:
- Genetic algorithm to solve thep-centre andp-radius problem on a networkInternational Journal of Computer Mathematics, 2005
- Evolutionary Computation2005
- An Evolutionary Approach to Pattern-Based Time Series SegmentationIEEE Transactions on Evolutionary Computation, 2004
- Numerical Comparison of Some Penalty-Based Constraint Handling Techniques in Genetic AlgorithmsJournal of Global Optimization, 2003
- Reducing the Time Complexity of the Derandomized Evolution Strategy with Covariance Matrix Adaptation (CMA-ES)Evolutionary Computation, 2003
- Completely Derandomized Self-Adaptation in Evolution StrategiesEvolutionary Computation, 2001
- CF-GGA: A grouping genetic algorithm for the cell formation problemInternational Journal of Production Research, 2001
- Genetic Algorithms + Data Structures = Evolution Programs1994
- Improved Complexity Bounds for Center Location Problems on Networks by Using Dynamic Data StructuresSIAM Journal on Discrete Mathematics, 1988
- Finding a Maximum Independent SetSIAM Journal on Computing, 1977