A Study on the Behavior of Genetic Algorithms on NK-Landscapes: Effects of Selection, Drift, Mutation, and Recombination

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E86-A, Issue 9, 2003, Pages 2270-2279

  Aguirre, Hernán ^a   Tanaka, Kiyoshi ^a  

^a SHINSHU UNIVERSITY   (Japan)

Author keywords

Drift; Epistasis; Genetic algorithms; Mutation; NK Landscapes; Nonlinear fitness functions; Recombination; Selection

Indexed keywords

COMBINATORIAL MATHEMATICS; OPTIMIZATION; RANDOM PROCESSES; STATISTICAL METHODS; THEOREM PROVING;

DRIFT; EPISTASIS; MUTATION; NK-LANDSCAPES; NONLINEAR FITNESS FUNCTIONS;

GENETIC ALGORITHMS;

EID: 1642328338     PISSN: 09168508     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (25)

1. K.A. De Jong, M.A. Potter, and W.M. Spears, "Using problem generators to explore the effects of epistasis," Proc. 7th Int'l Conf. Genetic Algorithms, pp.338-345, Morgan Kaufmann, 1997.
2. S.A. Kauffman, The Origins of Order: Self-Organization and Selection in Evolution, pp.33-67, Oxford Univ. Press, 1993.
3. L. Altenberg, "Fitness landscapes: NK landscapes," in Handbook of Evolutionary Computation, pp.B2.7:5-10, Institute of Physics Publishing & Oxford Univ. Press, 1997.
4. Y. Davidor, "Epistasis variance: A viewpoint of GA-hardness," Foundations of Genetic Algorithms, pp.23-35, Morgan Kaufmann, 1991.
5. B. Manderick, M. de Weger, and P. Spiessens, "The genetic algorithm and the structure of the fitness landscape," Proc. 4th Int'l Conf. on Genetic Algorithms, pp. 143-150, Morgan Kaufmann, 1991.
6. L. Altenberg, "Evolving better representations through selective genome growth," Proc. 1st IEEE Conf. on Evolutionary Computation, IEEE, pp. 182-187, Pistcaway, NJ, 1994.
7. J.E. Smith, Self Adaptation in Evolutionary Algorithms, Doctoral Dissertation, University of the West of England, Bristol, 1998.
8. P. Merz and B. Freisleben, "On the effectiveness of evolutionary search in high-dimensional NK-landscapes," Proc. 1998 IEEE International Conference on Evolutionary Computation, pp.741-745, IEEE Press, 1998.
9. R. Heckendorn, S. Rana, and D. Whitley, "Test function generators as embedded landscapes," Foundations of Genetic Algorithms 5, pp.183-198, Morgan Kaufmann, 1999.
10. K.E. Mathias, L.J. Eshelman, and D. Schaffer, "Niches in NK-landscapes," Foundations of Genetic Algorithms 6, pp.27-46, Morgan Kaufmann, 2001.
11. M. Shinkai, H. Aguirre, and K. Tanaka, "Mutation strategy improves GA's performance on epistatic problems," Proc. 2002 IEEE World Congress on Computational Intelligence, pp.795-800, 2002.
12. L.J. Eshelman, "The CHC adaptive search algorithm: How to have a save search when engaging in nontraditional genetic recombination," Foundations of Genetic Algorithms, pp.265-283, Morgan Kaufmann, 1991.
13. L. Davis, "Bit-climbing, representational bias, and test suite design," Proc. 4th Int'l Conf. on Genetic Algorithms, pp.18-23, Morgan Kaufmann, 1991.
14. R.E. Smith and J.E. Smith, "An examination of tunable, random search landscapes," Foundations of Genetic Algorithms 5, pp.165-182, Morgan Kaufmann, 1999.
15. R.E. Smith and J.E. Smith, "New methods for tunable, random landscapes," Foundations of Genetic Algorithms 6, pp.47-67, Morgan Kaufmann, 2001.
16. H. Aguirre, K. Tanaka, and T. Sugimura, "Cooperative model for genetic operators to improve GAs," Proc. IEEE Int'l Conf. on Information, Intelligence, and Systems, pp.98-106, 1999.
17. H. Aguirre, K. Tanaka, T. Sugimura, and S. Oshita, "Cooperative-competitive model for genetic operators: Contributions of extinctive selection and parallel genetic operators," Proc. Late Breaking Papers Genetic and Evolutionary Computation Conference, pp.6-14, Morgan Kaufmann, 2000.
18. T. Bäck, Evolutionary Algorithms in Theory and Practice, Oxford Univ. Press, 1996.
19. D. Whitley, "The GENITOR algorithm and selection pressure: Why rank-based allocation of reproductive trials is best," Proc. Third Intl. Conf. on Genetic Algorithms, pp.116-121, Morgan Kaufmann, 1989.
20. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, 1989.
21. L. Eshelman and D. Schaffer, "Preventing premature convergence in genetic algorithms by preventing incest," Fourth Intl. Conf. on Genetic Algorithms, pp.115-122, Morgan Kaufmann, 1991.
22. D. Schaffer, M. Mani, L. Eshelman, and K. Mathias, "The effect of incest prevention on genetic drift," Foundations of Genetic Algorithms 5, pp.235-243, Morgan Kaufmann, 1999.
23. K.-H. Liang, X. Yao, C. Newton, and D. Hoffman, "Solving cutting stock problems by evolutionary programming," Evolutionary Programming VII: Proc. Seventh Annual Conference on Evolutionary Programming (EP98), Lecture Notes in Computer Science, vol.1447, pp.291-300, Springer-Verlag, 1998.
24. J. He and X. Yao, "From an individual to a population: An analysis of the first hitting time of population-based evolutionary algorithms," IEEE Trans. Evol. Comput., vol.6, no.5, pp.495-511, 2002.
25. C.R. Reeves and J.E. Rowe, Genetic Algorithms - Principles and Perspectives, Kluwer, Norwell, MA, 2002.