Adaptive genetic algorithm with mutation and crossover matrices

IJCAI International Joint Conference on Artificial Intelligence

Volumn , Issue , 2007, Pages 2330-2333

  Law, Nga Lam ^a   Szeto, K Y ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE BEHAVIOR; ADAPTIVE GENETIC ALGORITHMS; ISING SPIN GLASS; KNAPSACK PROBLEMS; LOCUS STATISTICS; MATRIX FORMULATION; POPULATION SIZES; RANDOM COUPLINGS;

BENCHMARKING; CHROMOSOMES; GENETIC ALGORITHMS; HAMMING DISTANCE; POPULATION STATISTICS;

ARTIFICIAL INTELLIGENCE;

EID: 84880878911     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (6)

1. Hans Kellerer, Ulrich Pferschy, and David Pisinger. Knapsack Problems, pages 22-26. Springer, 2004.
2. Chun Wai Ma and Kwok Yip Szeto. Locus oriented adaptive genetic algorithm: Application to the zero/one knapsack problem. In Proceeding of The 5th International Conference on Recent Advances in Soft Computing, RASC2004, pages 410-415, Nottingham, UK, December 2004.
3. A. B. Simoes and E. Costa. Transposition versus crossover: An empirical study. In Proceeding of the Genetic and Evolutionary Computation Conference. Morgan Kaufmann, 1999.
4. A. B. Simoes and E. Costa. An evolutionary approach to the zero/one knapsack problem: Testing ideas from biology. In Proceeding of Fifth International Conference on Aritical Neurakl Network and Genetic Algorithms, 2001.
5. Kwok Yip Szeto and J. Zhang. Adaptive genetic algorithm and quasi-parallel genetic algorithm: Application to low-dimensional physics. In Lecture Notes in Computer Science 3743, pages 186-196, Sozopol, June 2005. Springer-Verlag.
6. Jian Zhang and Kwok Yip Szeto. Mutation matrix in evolutionary computation: An application to resource allocation problem. In Lecture Notes in Computer Science 3612, pages 112-119, Changsha, China, August 2005. Springer-Verlag.