Mitigating Deception in Genetic Search Through Suitable Coding
暂无分享,去创建一个
[1] A. K. Bhatia,et al. Tackling 0/1 knapsack problem with gene induction , 2003, Soft Comput..
[2] David E. Goldberg,et al. Genetic Algorithms in Search Optimization and Machine Learning , 1988 .
[3] S. Basu,et al. A naive genetic approach for non-stationary constrained problems , 2006, Soft Comput..
[4] Peter J. B. Hancock,et al. An Empirical Comparison of Selection Methods in Evolutionary Algorithms , 1994, Evolutionary Computing, AISB Workshop.
[5] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[6] Francisco Herrera,et al. Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis , 1998, Artificial Intelligence Review.
[7] Colin R. Reeves,et al. Genetic Algorithms and Neighbourhood Search , 1994, Evolutionary Computing, AISB Workshop.
[8] Ronald L. Rardin,et al. Development of a Parametric Generating Procedure for Integer Programming Test Problems , 1977, JACM.
[9] Emanuel Falkenauer,et al. Genetic Algorithms and Grouping Problems , 1998 .
[10] D. E. Goldberg,et al. Genetic Algorithms in Search , 1989 .
[11] A. K. Bhatia,et al. Packing Bins Using Multi-chromosomal Genetic Representation and Better-Fit Heuristic , 2004, ICONIP.
[12] David E. Goldberg,et al. The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1999, Evolutionary Computation.