Discussion of the Three Problems in Genetic Algorithm with Chromosome Differentiation

Author

Fan, S.

Author_Institution

Dept. of Ind. Eng., Nanjing Univ. of Technol., Nanjing, China

Volume

3

fYear

2010

fDate

23-24 Oct. 2010

Firstpage

94

Lastpage

96

Abstract

Bandyopadhyay and Pal proposed an improved genetic search strategy, GACD (Genetic Algorithm with Chromosome Differentiation), involving partitioning the chromosomes into two classes, and defining a restricted form of the crossover operator between the two classes. The GACD can be applied to many multi-dimensional pattern recognition problems. However, their GACD suffered from three problems, i.e. “sampling-without-replacement”, “mating-with-best-chromosome” and “the-unreachable-result”.

Keywords

genetic algorithms; pattern recognition; GACD; chromosome differentiation; crossover operator; genetic algorithm; genetic search strategy; mating-with-best-chromosome; multidimensional pattern recognition; sampling-without-replacement; the-unreachable-result; Algorithm design and analysis; Biological cells; Classification algorithms; Equations; Genetics; Optimization; Pattern recognition; Genetic Algorithm; Pattern recognition; Restricted crossover; Schema theorem;

fLanguage

English

Publisher

ieee

Conference_Titel

Artificial Intelligence and Computational Intelligence (AICI), 2010 International Conference on

Conference_Location

Sanya

Print_ISBN

978-1-4244-8432-4

Type

conf

DOI

10.1109/AICI.2010.259

Filename

5656166