Optimal Parameter Settings for the $(1+(\lambda, \lambda))$ Genetic Algorithm
暂无分享,去创建一个
[1] Carsten Witt,et al. Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions† , 2013, Combinatorics, Probability and Computing.
[2] Thomas Jansen,et al. The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help , 2002, Algorithmica.
[3] Ingo Wegener,et al. The Ising Model on the Ring: Mutation Versus Recombination , 2004, GECCO.
[4] Benjamin Doerr,et al. Crossover can provably be useful in evolutionary computation , 2012, Theor. Comput. Sci..
[5] William F. Punch,et al. Parameter-less population pyramid , 2014, GECCO.
[6] Thomas Jansen,et al. Analyzing Evolutionary Algorithms: The Computer Science Perspective , 2012 .
[7] Benjamin Doerr,et al. Analyzing Randomized Search Heuristics: Tools from Probability Theory , 2011, Theory of Randomized Search Heuristics.
[8] Xin Yao,et al. Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..
[9] Benjamin Doerr,et al. A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax , 2015, GECCO.
[10] Benjamin Doerr,et al. Multiplicative Drift Analysis , 2010, GECCO '10.
[11] Dirk Sudholt,et al. Crossover is provably essential for the Ising model on trees , 2005, GECCO '05.
[12] Leslie Ann Goldberg,et al. Adaptive Drift Analysis , 2011, Algorithmica.
[13] Carsten Witt,et al. Population Size vs. Mutation Strength for the (1+λ) EA on OneMax , 2015, GECCO.