Extending the scalability of linkage learning genetic algorithms: Theory & practice

Studies in Fuzziness and Soft Computing

Volumn 190, Issue , 2006, Pages 1-115

  Chen, Ying Ping ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33947408663     PISSN: 14349922     EISSN: None     Source Type: Book Series    
DOI: None     Document Type: Review

References (98)

1. M. Abramowitz and I. Stegun. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables. Dover Publications, New York, NY, 1972.
2. D. H. Ackley. A connectionist machine for genetic hill climbing. Kluwer Academic, Boston, 1987.
3. T. Bäck. Selective pressure in evolutionary algorithms: A characterization of selection mechanisms. Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA-95), pages 2-8, 1995.
4. J. D. Bagley. The Behavior of Adaptive Systems Which Employ Genetic and Correlation Algorithms. PhD thesis, University of Michigan, Ann Arbor, MI, 1967. (University Microfilms No. 68-7556).
5. J. E. Baker. Adaptive selection methods for genetic algorithms. Proceedings of the International Conference on Genetic Algorithms and Their Applications, pages 101-111, 1985.
6. T. Blickle and L. Thiele. A mathematical analysis of tournament selection. Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA-95), pages 9-16, 1995.
7. T. Blickle and L. Thiele. A comparison of selection schemes used in evolutionary algorithms. Evolutionary Computation, 4(4):361-394, 1996.
8. E. Cantú-Paz. Designing Efficient and Accurate Parallel Genetic Algorithms. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, 1999. (Also IlliGAL Report No. 99017).
9. Y.-p. Chen. Unpublished Experimental Data, 2002.
10. Y.-p. Chen and D. E. Goldberg. Introducing start expression genes to the linkage learning genetic algorithm. Proceedings of the Seventh International Conference on Parallel Problem Solving from Nature (PPSN VII), pages 351-360, 2002. (Also IlliGAL Report No. 2002007).
11. Y.-p. Chen and D. E. Goldberg. An analysis of a reordering operator with tournament selection on a GA-hard problem. Proceedings of Genetic and Evolutionary Computation Conference 2003 (GECCO-2003), pages 825-836, 2003. (Also IlliGAL Report No. 2003003).
12. Y.-p. Chen and D. E. Goldberg. Tightness time for the linkage learning genetic algorithm. Proceedings of Genetic and Evolutionary Computation Conference 2003 (GECCO-2003), pages 837-849, 2003. (Also IlliGAL Report No. 2003002).
13. Y.-p. Chen and D. E. Goldberg. Convergence time for the linkage learning genetic algorithm. Proceedings of the 2004 Congress on Evolutionary Computation (CEC2004), pages 39-40, 2004. (Also IlliGAL Report No. 2003025).
14. Y.-p. Chen and D. E. Goldberg. Introducing subchromosome representations to the linkage learning genetic algorithms. Proceedings of Genetic and Evolutionary Computation Conference 2004 (GECCO-2004), pages 971-982, 2004. (Also IlliGAL Report No. 2004001).
15. Y.-p. Chen and D. E. Goldberg. Convergence time for the linkage learning genetic algorithm. Evolutionary Computation, 13(3):N/A, 2005. (To appear).
16. K. A. De Jong. An Analysis of the Behavior of a Class of Genetic Adaptive Systems. PhD thesis, University of Michigan, Ann Arbor, MI, 1975. (University Microfilms No. 76-9381).
17. K. Deb. Binary and floating-point function optimization using messy genetic algorithms. PhD thesis, University of Alabama, Tuscaloosa, AL, 1991. (Also IlliGAL Report No. 91004).
18. K. Deb and D. E. Goldberg. mGA in C: A messy genetic algorithm in C. IlliGAL Report No. 91008, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 1991.
19. K. Deb and D. E. Goldberg. Analyzing deception in trap functions. Foundations of Genetic Algorithms 2, pages 93-108, 1993.
20. K. Deb and D. E. Goldberg. Sufficient conditions for deceptive and easy binary functions. Annals of Mathematics and Artificial Intelligence, 10:385-408, 1994. (Also IlliGAL Report No. 92001).
21. K. Deb, J. Horn, and D. E. Goldberg. Multimodal deceptive functions. Complex Systems, 7(2):131-153, 1993. (Also IlliGAL Report No. 92003).
22. W. Feller. An introduction to probability theory and its applications. Wiley, New York, NY, 1970.
23. S. Forrest and M. Mitchell. Relative building-block fitness and the building-block hypothesis. Foundations of Genetic Algorithms 2, pages 109-126, 1993.
24. D. R. Frantz. Nonlinearities in Genetic Adaptive Search. PhD thesis, University of Michigan, Ann Arbor, MI, 1972. (University Microfilms No. 73-11116).
25. D. E. Goldberg. Simple genetic algorithms and the minimal, deceptive problem. In L. Davis, editor, Genetic Algorithms and Simulated Annealing, chapter 6, pages 74-88. Morgan Kaufmann Publishers, Los Altos, CA, 1987.
26. D. E. Goldberg. Genetic algorithms and Walsh functions: Part I, a gentle introduction. Complex Systems, 3(2):129-152, 1989. (Also TCGA Report 88006).
27. D. E. Goldberg. Genetic algorithms and Walsh functions: Part II, deception and its analysis. Complex Systems, 3(2):153-171, 1989. (Also TCGA Report 89001).
28. D. E. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley Publishing Co., Reading, MA, January 1989. ISBN: 0-201-15767-5.
29. D. E. Goldberg. Six steps to GA happiness, 1991. Paper presented at Oregon Graduate Institute, Beaverton, OR.
30. D. E. Goldberg. The wright brothers, genetic algorithms, and the design of complex systems. In J. D. Schaffer, editor, Proceedings of the Symposium on Neural-Networks: Alliances and Perspectives in Senri 1993, pages 1-7, Osaka, Japan, 1993.
31. D. E. Goldberg. The race, the hurdle, and the sweet spot: Lessons from genetic algorithms for the automation of design innovation and creativity. In P. Bentley, editor, Evolutionary Design by Computers, chapter 4, pages 105-118. Morgan Kaufmann, San Mateo, CA, 1999.
32. D. E. Goldberg. The Design of Innovation: Lessons from and for Competent Genetic Algorithms, volume 7 of Genetic Algorithms and Evoluationary Computation. Kluwer Academic Publishers, June 2002. ISBN: 1-4020-7098-5.
33. D. E. Goldberg and C. L. Bridges. An analysis of a reordering operator on a GA-hard problem. Biological Cybernetics, 62:397-405, 1990. (Also TCGA Report No. 88005).
34. D. E. Goldberg, K. Deb, and J. H. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6(4):333-362, 1992. (Also IlliGAL Report No. 91010).
35. D. E. Goldberg, K. Deb, and J. Horn. Massive multimodality, deception, and genetic algorithms. Proceedings of the Second International Conference on Parallel Problem Solving from Nature (PPSN II), pages 37-46, 1992. (Also IlliGAL Report No. 92007).
36. D. E. Goldberg, K. Deb, H. Kargupta, and G. Harik. Rapid, accurate optimization of difficult problems using fast messy genetic algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA-93), pages 56-64, 1993. (Also IlliGAL Report No. 93004).
37. D. E. Goldberg, K. Deb, and B. Korb. Messy genetic algorithms revisited: Studies in mixed size and scale. Complex Systems, 4(4):415-444, 1990.
38. D. E. Goldberg, K. Deb, and D. Thierens. Toward a better understanding of mixing in genetic algorithms. Journal of the Society of Instrument and Control Engineers, 32(1):10-16, 1993. (Also IlliGAL Report No. 92009).
39. D. E. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3(5):493-530, 1989. (Also TCGA Report No. 89003).
40. D. E. Goldberg and G. Liepens. Theory tutorial, 1991. (Tutorial presented at the 1991 International Conference on Genetic Algorithms, La Jolla, CA).
41. D. E. Goldberg and R. Lingle, Jr. Alleles, loci, and the traveling salesman problem. Proceedings of the International Conference on Genetic Algorithms and Their Applications, pages 154-159, 1985.
42. D. E. Goldberg and K. Sastry. A practical schema theorem for genetic algorithm design and tunning. Proceedings of Genetic and Evolutionary Computation Conference 2001 (GECCO-2001), pages 328-335, 2001. (Also IlliGAL Report No. 2001017).
43. D. E. Goldberg, K. Sastry, and T. Latoza. On the supply of building blocks. Proceedings of Genetic and Evolutionary Computation Conference 2001 (GECCO-2001), pages 336-342, 2001. (Also IlliGAL Report No. 2001015).
44. J. J. Grefenstette and J. E. Baker. How genetic algorithms work: A critical look at implicit parallelism. Proceedings of the Third International Conference on Genetic Algorithms (ICGA-89), pages 20-27, 1989.
45. G. Harik, E. Cantú-Paz, D. E. Goldberg, and B. L. Miller. The gambler's ruin problem, genetic algorithms, and the sizing of populations. Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, pages 7-12, 1997.
46. G. Harik, E. Cantuú-Paz, D. E. Goldberg, and B. L. Miller. The gambler's ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation, 7(3):231-253, 1999.
47. G. R. Harik. Learning gene linkage to efficiently solve problems of bounded difficulty using genetic algorithms. PhD thesis, University of Michigan, Ann Arbor, MI, 1997. (Also IlliGAL Report No. 97005).
48. G. R. Harik. Linkage learning via probabilistic modeling in the ECGA. IlliGAL Report No. 99010, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 1999.
49. G. R. Harik and D. E. Goldberg. Learning linkage. Foundations of Genetic Algorithms 4, pages 247-262, 1996. (Also IlliGAL Report No. 96006).
50. G. R. Harik and D. E. Goldberg. Learning linkage through probabilistic expression. Computer Methods in Applied Mechanics and Engineering, 186(2-4):295310, June 2000.
51. D. L. Hartl and E. W. Jones. Genetics: principles and analysis. Jones and Bartlett Publishers, Sudbury, MA, 4th edition, January 1998. ISBN: 0-76370489-X.
52. J. H. Holland. Genetic algorithms and the optimal allocation of trials. SIAM Journal on Computing, 2(2), 1973.
53. J. H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI, 1975. ISBN: 0-262-58111-6.
54. H. Kargupta. SEARCH, polynomial complexity, and the fast messy genetic algorithm. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, 1995. (Also IlliGAL Report No. 95008).
55. H. Kargupta. The gene expression messy genetic algorithm. Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pages 814-819, 1996.
56. P. Larrańaga and J. A. Lozano. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, volume 2 of Genetic algorithms and evolutionary computation. Kluwer Academic Publishers, Boston, MA, October 2001. ISBN: 0-7923-7466-5.
57. J. R. Levenick. Inserting introns improves genetic algorithm success rate: Taking a cue from biology. Proceedings of the Fourth International Conference on Genetic Algorithms (ICGA-91), pages 123-127, 1991.
58. F. G. Lobo. Personal Communications, 2001.
59. F. G. Lobo, K. Deb, D. E. Goldberg, G. R. Harik, and L. Wang. Compressed introns in a linkage learning genetic algorithm. In Proceedings of the Third Annual Conference on Genetic Programming (GP 98), pages 551-558, University of Wisconsin, Madison, WI, August 1998. Morgan Kaufmann. (Also IlliGAL Report No. 97010).
60. F. G. Lobo and G. R. Harik. Extended compact genetic algorithm in C++. IlliGAL Report No. 99016, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 1999.
61. L. D. Merkle. Analysis of linkage-friendly genetic algorithms. PhD thesis, Air Force Institute of Technology, Air University, Albuquerque, New Mexico, 1996. (Also Technical Report No. AFIT/DS/ENG 96-11).
62. B. L. Miller. Noise, Sampling, and Efficient Genetic Algorithms. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL, May 1997. (Also IlliGAL Report No. 97001).
63. B. L. Miller and D. E. Goldberg. Genetic algorithms, tournament selection, and the effects of noise. Complex Systems, 9(3):193-212, 1995. (Also IlliGAL Report No. 95006).
64. B. L. Miller and D. E. Goldberg. Genetic algorithms, selection schemes, and the varying effects of noise. Evolutionary Computation, 4(2):113-131, 1996. (Also IlliGAL Report No. 95009).
65. H. Mühlenbein and T. Mahnig. FDA - a scalable evolutionary algorithm for the optimization for the optimization of additively decomposed functions. Evolutionary Computation, 7(4):353-376, 1999.
66. H. Mühlenbein and G. Paaß. From recombination of genes to the estimation of distributions I. Binary parameters. Proceedings of the Fourth International Conference on Parallel Problem Solving from Nature (PPSN IV), pages 178-187, 1996.
67. H. Mühlenbein and D. Schlierkamp-Voosen. Predicitive models for the breeder genetic algorithm: I. continuous parameter optimization. Evolutionary Computation, 1(1):25-49, 1993.
68. M. Munetomo. Linkage identification based on epistasis measures to realize efficient genetic algorithms. Proceedings of the 2002 Congress on Evolutionary Computation (CEC2002), pages 1332-1337, 2002.
69. M. Munetomo. Linkage identification with epistasis measure considering monotonicity conditions. Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning (SEAL2002), pages 550-554, 2002.
70. M. Munetomo and D. E. Goldberg. Identifying linkage by nonlinearity check. IlliGAL Report No. 98012, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 1998.
71. M. Munetomo and D. E. Goldberg. Identifying linkage groups by nonlinearity/non-monotonicity detection. Proceedings of Genetic and Evolutionary Computation Conference 1999 (GECCO-99), pages 433-440, 1999.
72. M. Pelikan and D. E. Goldberg. Escaping hierarchical traps,with competent genetic algorithms. Proceedings of Genetic and Evolutionary Computation Conference 2001 (GECCO-2001), pages 511-518, 2001. (Also IlliGAL Report No. 2001003).
73. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz. BOA: The bayesian optimization algorithm. Proceedings of Genetic and Evolutionary Computation Conference 1999 (GECCO-99), pages 525-532, 1999. (Also IlliGAL Report No. 99003).
74. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz. Linkage problem, distribution estimation, and bayesian networks. Evolutionary Computation, 8(3):311-341, 2000. (Also IlliGAL Report No. 98013).
75. M. Pelikan, D. E. Goldberg, and F. G. Lobo. A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5-20, 2002. (Also IlliGAL Report No. 99018).
76. C. Reeves. Using genetic algorithms with small populations. Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA-93), pages 92-99, 1993.
77. T. P. Riopka. Intelligent Recombination Using Genotypic Learning in a Collective Learning Genetic Algorithm. PhD thesis, The George Washington University, Washington, DC, 2002.
78. T. P. Riopka and P. Bock. Intelligent recombination using individual learning in a Collective Learning Genetic Algorithm. Proceedings of Genetic and Evolutionary Computation Conference 2000 (GECCO-2000), pages 104-111, 2000.
79. R. S. Rosenberg. Simulation of genetic populations with biochemical properties. PhD thesis, University of Michigan, Ann Arbor, MI, 1967. (University Microfilms No. 67-17836).
80. A. A. Salman, K. Mehrotra, and C. K. Mohan. Adaptive linkage crossover. Proceedings of ACM Symposium on Applied Computing (SAC'98), pages 338-342, 1998.
81. A. A. Salman, K. Mehrotra, and C. K. Mohan. Linkage crossover operator. Proceedings of Genetic and Evolutionary Computation Conference 1999 (GECCO-99), pages 564-571, 1999.
82. A. A. Salman, K. Mehrotra, and C. K. Mohan. Linkage crossover operator. Evolutionary Computation, 8(3):341-370, 2000.
83. K. Sastry. Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis, University of Illinois at Urbana-Champaign, Urbana, IL, January 2002. (Also IlliGAL Report No. 2002004).
84. J. D. Schaffer and A. Morishima. An adaptive crossover distribution mechanism for genetic algorithms. Proceedings of the Second International Conference on Genetic Algorithms (ICGA-87), pages 36-40, 1987.
85. A. Sinha. Designing efficient genetic and evolutionary algorithm hybrids. Master's thesis, University of Illinois, Urbana, IL, 2003. (Also IlliGAL Report No. 2003020).
86. J. Smith and T. C. Fogarty. An adaptive poly-parental recombination strategy. Proceedings of AISB-95 Workshop on Evolutionary computing, pages 48-61, 1995.
87. J. Smith and T. C. Fogarty. Recombination strategy adaptation via evolution of gene linkage. Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, pages 826-831, 1996.
88. D. Thierens. Analysis and Design of Genetic Algorithms. PhD thesis, Katholieke Universiteit Leuven, Leuven, Belgium, 1995.
89. D. Thierens and D. E. Goldberg. Mixing in genetic algorithms. Proceedings of the Fifth International Conference on Genetic Algorithms (ICGA-93), pages 38-45, 1993.
90. D. Thierens and D. E. Goldberg. Convergence models of genetic algorithm selection schemes. Proceedings of the Third International Conference on Parallel Problem Solving from Nature (PPSN III), pages 116-121, 1994.
91. D. Thierens and D. E. Goldberg. Elitist recombination: An integrated selection recombination ga. Proceedings of the First IEEE International Conference on Evolutionary Computation, pages 508-512, 1994.
92. D. Thierens and D. E. Goldberg. Domino convergence, drift, and the temporal-salience structure of problems. Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, pages 535-540, 1998.
93. A. S. Wu and R. K. Lindsay. Empirical studies of the genetic algorithm with noncoding segments. Evolutionary Computation, 3(2):121-147, 1995.
94. A. S. Wu and R. K. Lindsay. A survey of intron research in genetics. Proceedings of the Fourth International Conference on Parallel Problem Solving from Nature (PPSN IV), pages 101-110, 1996.
95. A. S. Wu, R. K. Lindsay, and M. D. Smith. Studies on the effect of non-coding segments on the genetic algorithm. Proceedings of the Sixth IEEE Conference on Tools with Artificial Intelligence, 1994.
96. T.-L. Yu and D. E. Goldberg. Toward an understanding of the quality and efficiency of model building for genetic algorithms. Proceedings of Genetic and Evolutionary Computation Conference 2004 (GECCO-2004), pages 367-378, 2004. (Also IlliGAL Report No. 2001004).
97. T.-L. Yu, D. E. Goldberg, A. Yassine, and Y.-p. Chen. Genetic algorithm design inspired by organizational theory: Pilot study of a dependency structure matrix driven genetic algorithm. Proceedings of Artificial Neural Networks in Engineering 2003 (ANNIE 2003), pages 327-332, 2003. (Also IlliGAL Report No. 2003007).
98. D. Zwillinger and S. Kokoska. CRC Standard Probability and Statistics Tables and Formulae. Chapman & Hall/CRC, Boca Raton, Florida, 2000. ISBN: 1-58488-059-7.