Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search
暂无分享,去创建一个
L. Darrell Whitley | Jean-Paul Watson | Laura Barbulescu | L. D. Whitley | J. Watson | L. Barbulescu
[1] Lawrence Davis,et al. Bit-Climbing, Representational Bias, and Test Suite Design , 1991, ICGA.
[2] D. WhitleyComputer. A Free Lunch Proof for Gray versus Binary Encodings , 1999 .
[3] Larry J. Eshelman,et al. The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.
[4] Soraya B. Rana,et al. Representation Issues in Neighborhood Search and Evolutionary Algorithms , 1998 .
[5] J. David Schaffer,et al. Representation and Hidden Bias: Gray vs. Binary Coding for Genetic Algorithms , 1988, ML.
[6] Yves Crama,et al. Local Search in Combinatorial Optimization , 2018, Artificial Neural Networks.
[7] Jacques Periaux,et al. Genetic Algorithms in Engineering and Computer Science , 1996 .
[8] Larry J. Eshelman. The CHC Adaptive Search Algo-rithm , 1991 .
[9] Lashon B. Booker,et al. Proceedings of the fourth international conference on Genetic algorithms , 1991 .
[10] L. Darrell Whitley,et al. Evaluating Evolutionary Algorithms , 1996, Artif. Intell..
[11] L. Darrell Whitley,et al. Bit Representations with a Twist , 1997, ICGA.