摘要: Exploration and exploitation are the two cornerstones of problem solving by search. The common opinion about evolutionary algorithms is that they explore search space (genetic) operators, while done selection. This is, however, questionable. In this paper we give a survey different review existing viewpoints on exploration exploitation, point out some discrepancies between problems with current views.
acm.org 
sci-hub.se 参考文章(36)
James P. Rice, John R. Koza, Genetic programming (videotape): the movie MIT Press. ,(1992)
Thomas C. Peachey, Robert Hinterding, Harry Gielewski, The Nature of Mutation in Genetic Algorithms international conference on genetic algorithms. pp. 65- 72 ,(1995)
Xiaofeng Qi, Francesco Palmieri, The Diversification Role of Crossover in the Genetic Algorithms international conference on genetic algorithms. pp. 132- 137 ,(1993)
Thomas Bäck, The Interaction of Mutation Rate, Selection, and Self-Adaptation Within a Genetic Algorithm. parallel problem solving from nature. pp. 87- 96 ,(1992)
Yoshiji Fujimoto, Shigeyoshi Tsutsui, Ashish Ghosh, David Corne, A Real Coded Genetic Algorithm with an Explorer and an Exploiter Populations. ICGA. pp. 238- 245 ,(1997)
Fred Glover, Tabu Search and Adaptive Memory Programming — Advances, Applications and Challenges Operations Research/Computer Science Interfaces Series. pp. 1- 75 ,(1997) , 10.1007/978-1-4615-4102-8_1
Hans-Paul Paul Schwefel, Evolution and Optimum Seeking: The Sixth Generation John Wiley & Sons, Inc.. ,(1993)
A. E. Eiben, C. H. M. Kemenade, J. N. Kok, Orgy in the Computer: Multi-Parent Reproduction in Genetic Algorithms european conference on artificial life. pp. 934- 945 ,(1995) , 10.1007/3-540-59496-5_354
David L. Battle, Michael D. Vose, Isomorphisms Of Genetic Algorithms Foundations of Genetic Algorithms. ,vol. 1, pp. 242- 251 ,(1991) , 10.1016/B978-0-08-050684-5.50018-5
J. David Schaffer, Larry J. Eshelman, Crossover's Niche international conference on genetic algorithms. pp. 9- 14 ,(1993)