Over-selection: An attempt to boost EDA under small population size

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 1075-1182

  Hong, Yi ^b   Kwong, Sam ^a,b   Ren, Qingsheng ^c   Wang, Xiong ^d  

^a IEEE

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c SHANGHAI JIAO TONG UNIVERSITY   (China)

^d HEFEI UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARK PROBLEMS; ESTIMATION OF DISTRIBUTION ALGORITHM (EDA);

CONVERGENCE OF NUMERICAL METHODS; PROBLEM SOLVING;

EVOLUTIONARY ALGORITHMS;

EID: 71249084715     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CEC.2007.4424589     Document Type: Conference Paper

References (34)

1. P. Larrañaga and J. A. Lozano, Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation, Kluwer Academic Puhlishers, 2002.
2. M. Pelikan, D. E. Goldberg and F. Lobo, A survey of optimization by building and using probabilistic models, Technical Report 99018, Illinois Genetic Algorithm Lab, UIUC, 1999.
3. Q. Zhang, J. Sun and E. Tsang, An evolutionary algorithm with guided mutation for the maximum clique problem, IEEE Trans. Evolutionary Computation, Vol.9, no.2, pp.192-200, 2005
4. L. Michael, A simple method for generating additive clustering models with limited complexity, Machine Learning, vol.49, pp.35-58, 2002.
5. U. Aickelin and J. Li, An estimation of distribution algorithm for nurse scheduling, Annals of Operations Research, 2006.
6. D.E. Goldberg, Genetic Algorithm in Search, Optimization, and Machine Learning, Addison Wesley, Reading, Massachussetts, 1989.
7. T. Bäck, Evolutionary Algorithms in Theory and Practice, Oxford University Press, 1996.
8. D. Thierens, Analysis and design of genetic algorithms, Doctoral dissertion, Katholieke University, Leuven, Belgium, 1995.
9. H. Mühlenbein and G. Paaß, From recombination of genes to the estimation of distributions: I. binary parameters, In Proc. Parallel Problem Solving for Nature (PPSN96), pp.178-187, 1996.
10. S. Baluja and S. Davis, Population-based incremental learning: A method for integrating genetic search based function optimization and competive learning, Tech. Rep. No. CMU-CS-94-166, Carnegie Mellon University, 1994.
11. G.R. Harik, F.G. Lobo and D.E. Goldberg, The compact genetic algorithm,IEEE Tran. Evolutionary Computation, vol.3, no.4, pp.287-297, 1999.
12. H. Mühleibein and T. Maching, Evolutionary optimization using graphical models, New Generation Computing, vol.18, no.2, pp.157-166, 2000.
13. S.K. Shakya, J.A.W. McCall, and D.F. Brown, Incorporating a metropolis method in a distribution estionation using markov random field algorithm, In Proc. IEEE Congress on Evolutionary Computation (IEEE CEC05), 2005.
14. Y. Hong, Q. Ren, and J. Zeng, Unit bit importance evolutionary algorithm, Soft Computing, Vol.11, no.2, pp.115-122, 2007.
15. S. Baluja, C.L. Isbell and P. Viola, MIMIC: Finding optima by estimating probability densities, In Proc. International Conference on Machine Learning (ICML97), pp.424-431, 1997.
16. J.S. De Bonet and S. Davis, Using optimal dependency-trees for combinatory optimization: Learning the structure of the search space, In Proc. International Conference on Machine Learning (ICML97), pp.30-38,1997.
17. M. Pelikan and H. Mühleibein, The bivariate marginal distribution algorithm, Advances in Soft Computing-Engineering Design and Munufacturing, pp.521-535, 1999.
18. R. Etxeberria and P. Larrañaga, Global optimization using Bayesian networks in Symposium on Artificial Intelligence, Adaptive Systems, pp.332-339, 1999.
19. H. Mühlenbein, T. Mahnig and A.O. Rodriguez, Schemata, distributions and graphical models in evolutionary optimization, Journal of Heuristics Vol.5, pp.215-247,1999.
20. M. Pelikan and D.E. Goldberg, Hierarchical problem solving and the Bayesian optimization algorithm, in Proc. Genetic and Evolutionary Computation Conference (GECCO00), pp.267-274, 2000.
21. R. Santana, A markov network based factorized distribution algorithm for optimization, in Proc. European Conference on Machine Learning (ECML03), pp.337-348, 2003.
22. M. Gallagher, M.R. Frean and T. Downs, Real-valued evolutionary optimization using a flexible probability density estimator, in Proc. Genetic and Evolutionary Computation Conference (GECCO99), pp.840-846, 1999.
23. P.A.N. Bosman and D. Thierens, Expanding from discrete to continuous estimation of distribution algorithm: The IDEA, in Proc. Paralle Problem Solving From Nature (PPSN00), pp.767-776, 2000.
24. B. Yuan and M. Gallagher, On the importance of diversity maintenance in estimation of distribution algorithms. in Proc. Genetic and Evolutionary Computation Conference (GECCO05), pp.719-726, 2005.
25. H. Handa, Estimation of Distribution Algorithms with Mutation, in Proc. Conference on Evolutionary Computation in Combinatory Optimization, pp.112-121, 2005.
26. K. Sastry, H.A. Abbass, D.E. Goldberg and D.D. Johnson, Substructural niching in estimation of distribution algorithms, in Proc. Genetic and Evolutionary Computation Conference (GECCO05), pp.671-678, 2005.
27. J.M. Peña, V. Robles, P. Larrañaga, V. Herves, F. Rosales and M.S. Pérez, GA-EDA: hybrid evolutionary algorithm using genetic and estimation of distribution algorithms, in Proc. 17th international conference on Innovations in applied artificial intelligence, pp.361-371, 2004.
28. J.L. Shapiro, Diversity loss in general estimation of distribution algorithm, in Proc. Paralle Problem Solving from Nature (PPSN06), pp.92-101, 2006.
29. Y. Hong, Q. Ren and J. Zeng, Genetic drift in univariate marginal distribution algorithm, in Proc. Genetic and Evolutionary Computation Conference (GECCO05), pp.745-746, 2005.
30. T. Blickle and L. Thiele, A mathematical analysis of tournament selection, in Proc. International Conference on Genetic Algorithm (ICGA95), pp.9-16, 1995.
31. Y. Hong, S. Kwong, Q. Ren and X. Wang, A comprehensive comparison between real population based tournament selection and virtual population based tournament selection, in Proc. IEEE Congress on Evolutionary Computation (IEEE CEC07), to appear.
32. M. Pelikan, D.E. Goldberg and E. Cantú-Paz, Bayesian Optimization Algorithm, Population Sizing, and Time to Convergence. in Proc. Genetic and Evolutionary Computation Conference (GECCO00), pp.275-282, 2000.
33. G. Syswerda, Simulated crossover in genetic algorithm, in Proc. Workshop on Foundation of Genetic Algorithms (FOGA), pp.239-255, 1993.
34. N. Monmarché, E. Ramat, L. Desbarats and G. Venturini, Probabilistic Search with Genetic Algorithms and Ant Colonies, in Proc. of the Optimization by building and using probabilistic models workshop, Genetic and Evolutionary Computation Conference (GECCO00), pp.209-211, 2000.