The compact genetic algorithm

IEEE Transactions on Evolutionary Computation

Volumn 3, Issue 4, 1999, Pages 287-297

  Harik, Georges R ^a,b   Lobo, Fernando G ^a,c   Goldberg, David E ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^b GOOGLE INC   (United States)

^c UNIVERSIDADE NOVA DE LISBOA   (Portugal)

Author keywords

Bit wise simulated crossover; Genetic algorithms; Population based incremental learning; Probabilistic modeling; Univariate marginal distribution algorithm

Indexed keywords

COMPUTER SIMULATION; CONFORMAL MAPPING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

BIT WISE SIMULATED CROSSOVER; POPULATION BASED INCREMENTAL LEARNING; PROBABILISTIC MODELING; RANDOM WALK MODEL; UNIVARIATE MARGINAL DISTRIBUTION ALGORITHM;

GENETIC ALGORITHMS;

EID: 0033318859     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/4235.797971     Document Type: Article

References (19)

1. D. H. Ackley, A Connectionist Machine for Genetic Hill Climbing. Boston, MA: Kluwer, 1987.
2. S. Baluja, "Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning," Carnegie Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-CS-94-163, 1994.
3. S. Baluja and R. Caruana, "Removing the genetics from the standard genetic algorithm," Carnegie Mellon Univ., Pittsburgh, PA, Tech. Rep. CMU-CS-95-141, 1995.
4. S. Baluja and S. Davies, "Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space," in Proc. 14th Int. Conf. Machine Learning. San Mateo, CA: Morgan Kaufmann, 1997, pp. 30-38.
5. K. A. De Jong, "An analysis of the behavior of a class of genetic adaptive systems," Ph.D. dissertation, Univ. Michigan, Ann Arbor, 1975.
6. K. Deb and D. E. Goldberg, "Analyzing deception in trap functions," in Foundations of Genetic Algorithms 2, L. D. Whitley, Ed. San Mateo, CA: Morgan Kaufmann, 1993, pp. 93-108.
7. J. S. De Bonet, C. Isbell, and P. Viola; "MIMIC: Finding optima by estimating probability densities," in Advances in Neural Information Processing Systems, M. C. Mozer, M. I. Jordan, and T. Petsche, Eds. Cambridge, MA: MIT Press, vol. 9, p. 424, 1997.
8. L. J. Eshelman and J. D. Schaffer, "Crossover's niche," in Proc. 5th Int. Conf. Genetic Algorithms, S. Forrest, Ed. San Mateo, CA: Morgan Kaufmann, 1993, pp. 9-14.
9. D. E. Goldberg, "Simple genetic algorithms and the minimal, deceptive problem," in Genetic Algorithms and Simulated Annealing, L. Davis, Ed. San Mateo, CA: Morgan Kaufmann, 1987, pp. 74-88.
10. G. Harik, E. Cantú-Paz, D. E. Goldberg, and B. Miller, "The gambler's ruin problem, genetic algorithms, and the sizing of populations," in Proc. 4th Int. Conf. Evolutionary Computation, T. Bäck, Ed. Piscataway, NJ: IEEE Press, 1997, pp. 7-12.
11. G. Harik, "Linkage learning via probabilistic modeling in the ECGA," Univ. Illinois, Urbana-Champaign, IlliGAL Rep. 99010, 1999.
12. J. Hertz, A. Krogh, and G. Palmer, Introduction to the Theory of Neural Computation. Reading, MA: Addison-Wesley, 1993.
13. M. Höhfeld and G. Rudolph, "Toward a theory of population-based incremental learning," in Proc. 4th Int. Conf. Evolutionary Computation, T. Bäck, Ed. Piscataway, NJ: IEEE Press, 1997, pp. 1-5.
14. H. Kargupta and D. E. Goldberg, "SEARCH, blackbox optimization, and sample complexity," in Foundations of Genetic Algorithms 4, R. K. Belew and M. D. Vose, Eds. San Francisco, CA: Morgan Kaufmann, 1996, pp. 291-324.
15. H. Mühlenbein and G. Paaß, "From recombination of genes to the estimation of distributions I. binary parameters," in Parallel Problem Solving from Nature, PPSN IV, H.-M. Voigt, W. Ebeling, I. Rechenberg, and H.-P. Schwefel, Eds. Berlin, Germany: Springer-Verlag, 1996, pp. 178-187.
16. M. Pelikan and H. Mühlenbein, "The bivariate marginal distribution algorithm," in Advances in Soft Computing - Engineering Design and Manufacturing, R. Roy, T. Furuhashi, and P. K. Chawdhry, Eds. Berlin, Germany: Springer-Verlag, 1999, pp. 521-535.
17. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz, "BOA: The Bayesian optimization algorithm," Univ. Illinois, Urbana-Champaign, IlliGAL Rep. 99003, 1999.
18. G. Syswerda, "Simulated crossover in genetic algorithms," in Foundations of Genetic Algorithms 2, L. D. Whitley, Ed. San Mateo, CA: Morgan Kaufmann, 1993, pp. 239-255.
19. D. Thierens, and D. E. Goldberg, "Mixing in genetic algorithms," in Proc. 5th Int. Conf. Genetic Algorithms, S. Forrest, Ed. San Mateo, CA: Morgan Kaufmann, 1993, pp. 38-45.