Exploration and Exploitation Without Mutation: Solving the Jump Function in \varTheta (n) Time
暂无分享,去创建一个
Anirban Mukhopadhyay | L. Darrell Whitley | Rachel Hirsch | Swetha Varadarajan | L. D. Whitley | A. Mukhopadhyay | Swetha Varadarajan | Rachel Hirsch
[1] Kalyanmoy Deb,et al. Breaking the Billion-Variable Barrier in Real-World Optimization Using a Customized Evolutionary Algorithm , 2016, GECCO.
[2] A. E. Eiben,et al. Genetic algorithms with multi-parent recombination , 1994, PPSN.
[3] Duc-Cuong Dang,et al. Escaping Local Optima with Diversity Mechanisms and Crossover , 2016, GECCO.
[4] Lalit M. Patnaik,et al. On modeling genetic algorithms for functions of unitation , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[5] Pablo Moscato,et al. Memetic algorithms: a short introduction , 1999 .
[6] A. E. Eiben,et al. Multi-Parent's Niche: n-ary Crossovers on NK-Landscapes , 1996, PPSN.
[7] L. Darrell Whitley,et al. Partition Crossover for Pseudo-Boolean Optimization , 2015, FOGA.
[8] Shigenobu Kobayashi,et al. Edge Assembly Crossover: A High-Power Genetic Algorithm for the Travelling Salesman Problem , 1997, ICGA.
[9] L. Darrell Whitley,et al. Optimizing one million variable NK landscapes by hybridizing deterministic recombination and local search , 2017, GECCO.
[10] Larry J. Eshelman,et al. The CHC Adaptive Search Algorithm: How to Have Safe Search When Engaging in Nontraditional Genetic Recombination , 1990, FOGA.
[11] A. Mobius,et al. COMBINATORIAL OPTIMIZATION BY ITERATIVE PARTIAL TRANSCRIPTION , 1999, cond-mat/9902034.
[12] Shigenobu Kobayashi,et al. A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem , 2013, INFORMS J. Comput..
[13] Thomas Jansen,et al. The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help , 2002, Algorithmica.
[14] Jonathan E. Rowe,et al. Population Fixed-Points for Functions of Unitation , 1998, FOGA.
[15] Keld Helsgaun,et al. General k-opt submoves for the Lin–Kernighan TSP heuristic , 2009, Math. Program. Comput..