Learning building block structure from crossover failure

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Volumn , Issue , 2007, Pages 1280-1287

  Li, Zhenhua ^a   Goodman, Erik D ^b  

^a CHINA UNIVERSITY OF GEOSCIENCES   (China)

^b Michigan State University

Author keywords

Building blocks; Crossover disruption; Genetic algorithms; Linkage discovery; Smart operators

Indexed keywords

BINARY SEQUENCES; FAILURE ANALYSIS; GENETIC ALGORITHMS; PROBLEM SOLVING;

BUILDING BLOCKS; CROSSOVER DISRUPTION; LINKAGE DISCOVERY; SMART OPERATORS;

LEARNING ALGORITHMS;

EID: 34548059231     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1277202     Document Type: Conference Paper

References (21)

1. C. Aporntewan and P. Chongstitvatana. A quantitative approach for validating the building-block hypothesis. In 2005 IEEE Congress on Evolutionary Computation, pages 1403-1409. IEEE CEC 2005, September 2005.
2. J. S. de Bonet, C. L. Isbell, Jr., and P. Viola. MIMIC: Finding optima by estimating probability densities. In M. C. Mozer, M. I. Jordan, and T. Petsche, editors, Advances in Neural Information Processing Systems, volume 9, pages 424-430. The MIT Press, 1997.
3. S. Forrest and M. Mitchell. Relative building-block fitness and the building-block hypothesis. In L. D. Whitley, editor, Foundations of Genetic Algorithms 2, pages 109-126. Morgan Kaufmann, San Mateo, CA, 1993.
4. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1989.
5. D. E. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3(5):493-530, 1989.
6. G. Harik. Learning linkage to efficiently solve problems of bounded difficulty using genetic algorithms. PhD thesis, University of Michigan, 1997.
7. G. Harik. Linkage learning via probabilistic modeling in the ECGA. Technical Report IlliGAL Report No. 99010, IlliGAL,University of Illinois at Urbana-Champaign, 1999.
8. G. R. Harik, F. G. Lobo, and D. E. Goldberg. The compact genetic algorithm. IEEE-EC, 3(4):287-297, November 1999.
9. J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, 1975.
10. B. Howard and J. Sheppard. The royal road not taken: A re-examination of the reasons for GA failure on R1. In Proceedings of the Genetic and Evolutionary Computation Conference(GECCO-2004), pages 1208-1219, June 2004.
11. M. P. Lobo and D. E. Goldberg. A hierarchy machine: learning to optimize from nature and humans. Complexity, 8(5):36-45, 1999.
12. R. S. Michalski. LEARNABLE EVOLUTION MODEL: Evolutionary processes guided by machine learning. Machine Learning, 38(1-2):9-40, 2000.
13. M. Mitchell, S. Forrest, and J. H. Holland. The royal road for genetic algorithms: Fitness landscapes and GA performance. In F. J. Varela and P. Bourgine, editors, Towards a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, 1991, pages 245-254, Paris, 11-13 1992. A Bradford book, The MIT Press.
14. H. MÜhelenbein and G. Paaß. From recombination of genes to the estimation of distributions I. Binary parameters. In Lecture Notes in Computer Science 1411: Parallel Problem Solving from Nature (PPSN IV), pages 178-187, 1996.
15. M. Pelikan and D. E. Goldberg. Escaping hierarchical traps with competent genetic algorithms. In L. Spector, E. D. Goodman, A. Wu, W. B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. H. Garzon, and E. Burke, editors, Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001), pages 511-518, San Francisco, California, USA, July 2001. Morgan Kaufmann.
16. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz. BOA: The Bayesian optimization algorithm. In W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Honavar, M. Jakiela, and R. E. Smith, editors, Proceedings of the Genetic and Evolutionary Computation Conference GECCO-99, volume I, pages 525-532, Orlando, FL, July 1999. Morgan Kaufmann Publishers, San Fransisco, CA.
17. J. D. Schaffer and A. Morishima. An adaptive crossover distribution mechanism for genetic algorithms. In Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application, pages 36-40. Lawrence Erlbaum Associates, Inc., July 1987.
18. M. Sebag and M. Schoenauer. Controlling crossover through inductive learning. In Y. Davidor, H.-P. Schwefel, and R. Männer, editors, Parallel Problem Solving from Nature - PPSN III, pages 209-218, Berlin, 1994. Springer.
19. D. Thierens and D. E. Goldberg. Mixing in genetic algorithms. In Proceedings of the Fifth International Conference on Genetic Algorithms, pages 38-45. ICGA93', June 1993.
20. R. A. Watson, G. S. Hornby, and J. B. Pollack. Modeling building-block interdependency. In Proceedings of the Third Conference on Parallel Problem Solving from Nature(PPSN V), volume 1498, pages 97-106, 1998.
21. R. A. Watson and J. B. Pollack. Hierarchically consistent test problems for genetic algorithms: Summary and additional results. In Proceedings of the Genetic and Evolutionary Computation Conference(GECCO-1999), pages 292-297. Morgan Kaufmann, July 1999.