Adaptation of a success story in GAs: Estimation-of-distribution algorithms for tree-based optimization problems

Studies in Computational Intelligence

Volumn 92, Issue , 2008, Pages 3-18

  Bosman, Peter A N ^a   de Jong, Edwin D ^b  

^a CWI   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 41449094522     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-76286-7_1     Document Type: Article

References (29)

1. T. Alderliesten, P. A. N. Bosman, and W. Niessen. Towards a real-time minimally-invasive vascular intervention simulation system. IEEE Transactions on Medical Imaging, 26(1):128-132, 2007.
2. P. J. Angeline and J. B. Pollack. The evolutionary induction of subroutines. In Proceedings of the Fourteenth Annual Conference of the Cognitive Science Society, pages 236-241, Lawrence Erlbaum, Hillsdale, NJ, 1992.
3. P. A. N. Bosman. Design and Application of Iterated Density-Estimation Evolutionary Algorithms. PhD thesis, Utrecht University, Utrecht, The Netherlands, 2003.
4. P. A. N. Bosman, J. Grahl, and F. Rothlauf. SDR: A better trigger for adaptive variance scaling in normal edas. In D. Thierens et al., (eds.), Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2007, pages 492-499, ACM, New York, 2007.
5. W. Buntine. Operations for learning with graphical models. Journal of Artificial Intelligence Research, 2:159-225, 1994.
6. W. Buntine. A guide to the literature on learning probabilistic networks from data. IEEE Transactions on Knowledge and Data Engineering, 8:195-210, 1996.
7. N. L. Cramer. A representation for the adaptive generation of simple sequential programs. In John J. Grefenstette, (ed.), Proceedings of the First International Conference on Genetic Algorithms and their Applications, Carnegie-Mellon University, pages 183-187, Lawrence Erlbaum, Hillsdale, NJ, 1985.
8. R. Etxeberria and P. Larrañaga. Global optimization using Bayesian networks. In A. A. O. Rodriguez et al., (eds.), Proceedings of the Second Symposium on Artificial Intelligence CIMAF-1999, pages 332-339. Institute of Cybernetics, Mathematics and Physics, 1999.
9. G. Harik, E. Cantú-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.
10. E. E. Korkmaz and G. Üçoluk. Design and usage of a new benchmark problem for genetic programming. In Proceedings of the 18th International Symposium on Computer and Information Sciences ISCIS-2003 pages 561-567, Springer, Berlin Heidelberg New York, 2003.
11. J. R. Koza. Genetic Programming. MIT, Cambridge, MA, 1992.
12. J. R. Koza. Genetic Programming II: Automatic Discovery of Reusable Programs. MIT, Cambridge, MA, 1994.
13. P. Larrañaga and J. A. Lozano. Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer, London, 2001.
14. S. L. Lauritzen. Graphical Models. Clarendon, Oxford, 1996.
15. J. A. Lozano, P. Larrañaga, I. Inza, and E. Bengoetxea. Towards a New Evolutionary Computation. Springer, Berlin Heidelberg New York, 2006.
16. M. Pelikan. Bayesian optimization algorithm: From single level to hierarchy. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, Illinois, 2002.
17. M. Pelikan and D. E. Goldberg. Hierarchical BOA solves ising spin glasses and maxsat. In E. Cantú-Paz et al., (eds.), Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2003, pages 1271-1282, Springer, Berlin Heidelberg New York, 2003.
18. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz. BOA: The Bayesian optimization algorithm. In W. Banzhaf et al., (eds.), Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-1999, pages 525-532, Morgan Kauffman, San Francisco, California, 1999.
19. 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.
20. M. Pelikan, D. E. Goldberg, and K. Sastry. Bayesian optimization algorithm, decision graphs and occam's razor. In L. Spector et al., (eds.), Proceedings of the Genetic and Evolutionary Computation Conference - GECCO-2001, pages 519-526, Morgan Kauffman, San Francisco, California, 2001.
21. M. Pelikan, K. Sastry, and E. Cantú-Paz. Scalable Optimization via Probabilistic Modeling. Springer, Berlin Heidelberg New York, 2006.
22. W. F. Punch, D. Zongker, and E. D. Goodman. The royal tree problem, a benchmark for single and multiple population genetic programming. In P. J. Angeline and K. E. Kinnear, Jr., (eds.), Advances in Genetic Programming 2, pages 299-316. MIT, Cambridge, MA, USA, 1996.
23. J. Rissanen. Hypothesis selection and testing by the MDL principle. The Computer Journal, 42(4):260-269, 1999.
24. J. P. Rosca and D. H. Ballard. Discovery of subroutines in genetic programming. In P.J. Angeline and K. E. Kinnear, Jr., (eds.), Advances in Genetic Programming 2, chapter 9, pages 177-202, MIT, Cambridge, MA, 1996.
25. R. P. Salustowicz and J. Schmidhuber. Probabilistic incremental program evolution. Evolutionary Computation, 5(2):123-141, 1997.
26. K. Sastry and D. E. Goldberg. Probabilistic model building and competent genetic programming. In R. L. Riolo and B. Worzel, (eds.), Genetic Programming Theory and Practise, chapter 13, pages 205-220, Kluwer, Dordrecht 2003.
27. Y. Shan, R. I. McKay, R. Baxter, H. Abbass, D. Essam, and H. X. Nguyen. Grammar model-based program evolution. In Proceedings of the 2004 Congress on Evolutionary Computation - CEC2004, IEEE, Piscataway, New Jersey, 2004.
28. D. Thierens. Scalability problems of simple genetic algorithms. Evolutionary Computation, 7(4):331-352, 1999.
29. D. Thierens and D. E. Goldberg. Mixing in genetic algorithms. In S. Forrest, (ed.), Proceedings of the fifth conference on Genetic Algorithms, pages 38-45, Morgan Kaufmann, USA, 1993.