Title :
Two Problems in Genetic Algorithm with Chromosome Differentiation
Author_Institution :
Dept. of Ind. Eng., Nanjing Univ. of Technol., Nanjing, China
fDate :
Nov. 30 2009-Dec. 1 2009
Abstract :
Bandyopadhyay and Pal proposed an improved genetic search strategy, GACD, 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 two kinds of problems, i.e. "sampling-without-replacement" and "mating-with-best-chromosome".
Keywords :
biology computing; cellular biophysics; genetic algorithms; pattern recognition; GACD; chromosome differentiation; genetic algorithm; multidimensional pattern recognition; Biological cells; Genetic algorithms; Genetic mutations; Industrial engineering; Knowledge acquisition; Partitioning algorithms; Pattern recognition; Performance analysis; Terminology; Genetic Algorithm; Pattern Recognition; Restricted crossover; Schema theorem;
Conference_Titel :
Knowledge Acquisition and Modeling, 2009. KAM '09. Second International Symposium on
Conference_Location :
Wuhan
Print_ISBN :
978-0-7695-3888-4
DOI :
10.1109/KAM.2009.311
