Adaptive discretization for probabilistic model building genetic algorithms

GECCO 2006 - Genetic and Evolutionary Computation Conference

Volumn 2, Issue , 2006, Pages 1103-1110

  Chen, Chao Hong ^a   Liu, Wei Nan ^a   Chen, Ying Ping ^a  

^a NATIONAL CHIAO TUNG UNIVERSITY   (Taiwan)

Author keywords

Adaptive discretization; Extended compact genetic algorithm; Real parameter optimization; Split on demand

Indexed keywords

ADAPTIVE ALGORITHMS; CODES (SYMBOLS); MATHEMATICAL MODELS; OPTIMIZATION; PROBABILISTIC LOGICS; PROBLEM SOLVING;

ADAPTIVE DISCRETIZATION; EXTENDED COMPACT GENETIC ALGORITHM; REAL PARAMETER OPTIMIZATION; SPLIT ON DEMAND;

GENETIC ALGORITHMS;

EID: 33750231326     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143997.1144174     Document Type: Conference Paper

References (18)

1. C. W. Ahn, R. S. Ramakrishna, and D. E. Goldberg. Real-coded Bayesian optimization algorithm, bringing the strength of BOA into the continuous world. In Proceedings of the GECCO 2004 Genetic and Evolutionary Computation Conference, pages 840-851, 2004.
2. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, New York, 1989.
3. 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.
4. D. E. Goldberg, B. Korb, and K. Deb. Messy genetic algorithms: Motivation, analysis, and first results. Complex Systems, 3(5):493-530, 1989.
5. (Also TCGA Report No. 89003).
6. 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.
7. J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI, 1975. ISBN: 0-262-58111-6.
8. 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.
9. J. Nelder and R. Mead. A simplex method for function minimization. Computer Journal, 7:308-315, 1965.
10. 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.
11. (Also IlliGAL Report No. 99018).
12. J. Rissanen. Stochastic Complexity in Statistical Inquiry. World Science, 1989.
13. M. Sebag and A. Ducoulombier. Extending population-based incremental learning to continuous search spaces. In Proceedings of the Fifth International Conference on Parallel Problem Solving from Nature (PPSN V), pages 418-427, 1998.
14. I. L. Servet, L. Trave-Massuyes, and D. Stern. Telephone network traffic overloading, diagnosis and evolutionary computation techniques. In Proceeings of the Third European Conference on Artificial Evolution (AE 97), pages 137-144, 1997.
15. S.-Y. Shin and B.-T. Zhang. Bayesian evolutionary algorithms for continuous function: optimization. In Proceedings of the 2001 Congress on Evolutionary Computation (CEC2001), pages 508-515, 2001.
16. A. Sinha, S. Tiwari, and K. Deb. A population-based, steady-state procedure-for real-parameter optimization. In Proceedings of the 2005 Congress' on Evolutionary Computation (CEC2005), pages 514-521, 2005.
17. P. N. Suganthan, N. Hansen, J. J. Liang, K.-Deb, Y.-p. Chen, A. Auger, and S. Tiwari. Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. Technical Report, Nanyang Technological University, Singapore, May 2005.
18. S. Tsutsui, M. Pelikan, and D. E. Goldberg. Evolutionary algorithm-using marginal histogram models in continuous domain. IlliGAL Report No. 2001019, University of Illinois at Urbana-Champaign, Illinois Genetic. Algorithms Laboratory, Urbana, IL, 2001.