What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation-Reference-Cited by-同舟云学术

What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation

Published:1993 Issue: Volume: Page:129-163
ISSN:
Container-title:Genetic Algorithms for Machine Learning
language:
Short-container-title:

Author:

Forrest Stephanie,Mitchell Melanie

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4615-2740-4_6.pdf

Reference44 articles.

1. Belew, R.K. & Booker, L.B. (Eds.) (1991).Proceedings of the Fourth International Conference on Genetic Algorithms.San Mateo, CA: Morgan Kaufmann.

2. Bergman, A., & Feldman, M.W. (1990). More on selection for and against recombination.Theoretical Population Biology 38(1)68–92.

3. Bethke, A.D. (1980). Genetic algorithms as function optimizers. (Doctoral dissertation, University of Michigan.)Dissertation Abstracts International 41(9)350BB.

4. Das, R., & Whitley, L.D. (1991). The only challenging problems are deceptive: Global search by solving order-1 hyperplanes. In R.K. Belew & L.B. Booker (Eds.)Proceedings of the Fourth International Conference on Genetic Algorithms.San Mateo, CA: Morgan Kaufmann.

5. Davis, L.D. (Ed.) (1987).Genetic algorithms and simulated annealing.Research Notes in Artificial Intelligence. Los Altos, CA: Morgan Kauffmann.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mining frequent itemsets from streaming transaction data using genetic algorithms;Journal of Big Data;2020-07-25

2. Finding Irregularly Shaped Clusters Based on Entropy;Advances in Data Mining. Applications and Theoretical Aspects;2010

3. The Creativity Potential Within Evolutionary Algorithms;Advances in Artificial Life