A simple real-coded extended compact genetic algorithm

2007 IEEE Congress on Evolutionary Computation, CEC 2007

Volumn , Issue , 2007, Pages 342-348

  Fossati, Luca ^a   Lanzi, Pier Luca ^a,b   Sastry, Kumara ^b   Goldberg, David E ^b   Gomez, Osvaldo ^c  

^a POLITECNICO DI MILANO   (Italy)

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

^c University of Illinois at Urbana Champaign ^*

Author keywords

[No Author keywords available]

Indexed keywords

DISCRETIZATION METHODS; ESTIMATION OF DISTRIBUTION ALGORITHM (EDA);

CODES (SYMBOLS); MATHEMATICAL MODELS; PROBABILISTIC LOGICS;

GENETIC ALGORITHMS;

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

References (25)

1. D. E. Goldberg, "The race, the hurdle, and the sweet spot: Lessons from genetic algorithms for the automation of design innovation and creativity," in Evolutionary Design by Computers, P. Bentley, Ed. San Mateo, CA: Morgan Kaufmann, 1999, ch. 4, pp. 105-118.
2. - Design of innovation: Lessons from and for competent genetic algorithms. Boston, MA: Kluwer Academic Publishers, 2002.
3. P. Larrañaga and J. A. Lozano, Eds., Estimation of distribution algorithms. Boston, MA: Kluwer Academic Publishers, 2002.
4. M. Pelikan, Hierarchical Bayesian Optimization Algorithm (Toward a New Generation of Evolutionary Algorithms). Springer Berlin / Heidelberg, 2005.
5. M. Pelikan, K. Sastry, and E. Cantú-Paz, Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications (Studies in Computational Intelligence). Secaucus, NJ, USA: Springer-Verlag New York, Inc., 2006.
6. J. A. Lozano, P. Larranaga, I. Inza, and E. Bengoetxea, Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing). Secaucus, NJ, USA: Springer-Verlag New York, Inc., 2006.
7. G. Harik, "Linkage Learning via Probabilistic Modeling in the ECGA," 1999. [Online]. Available: citeseer.ist.psu.edu/harik99linkage.html
8. L. de la Ossa, K. Sastry, and F. G. Lobo, "chi-ary Extended Compactd Genetic Algorithm in C++," IlliGAL, Tech. Rep., March, 2006.
9. S. Tsutsui, M. Pelikan, and D. E. Goldberg, "Evolutionary algorithm using marginal histogram in continuous domain," in Optimization by Building and Using Probabilistic Models (OBUPM) 2001, San Francisco, California, USA, 7 2001, pp. 230-233. [Online]. Available: citeseer.ist.psu.edu/article/ tsutsui01evolutionary.html
10. S. Tsutsui and D. E. Goldberg, "Simplex crossover and linkage identification: Single-stage evolution vs. multi-stage evolution," 2002. [Online]. Available: citeseer.ist.psu.edu/tsutsui02simplex.html
11. T. Higuchi, S. Tsutsui, and M. Yamamura, "Theoretical analysis of simplex crossover for real-coded genetic algorithms," in PPSN VI: Proceedings of the 6th International Conference on Parallel Problem Solving from Nature. London, UK: Springer-Verlag, 2000, pp. 365-374.
12. M. Pelikan, D. E. Goldberg, and S. Tsutsui, "Combining the strengths of bayesian optimization algorithm and adaptive evolution strategies," pp. 512-519, 2002.
13. - "Getting the best of both worlds: discrete and continuous genetic and evolutionary algorithms in concert," Inf. Sci., vol. 156, no. 3-4, pp. 147-171, 2003.
14. C. W. Ahn, "Theory, design, and application of efficient genetic and evolutionary algorithms," Ph.D. dissertation, Gwangju Institute of Science and Technology, Korea, 2005.
15. C.-H. Chen, W.-N. Liu, and Y.-P. Chen, "Adaptive discretization for probabilistic model building genetic algorithms," in GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation. New York, NY, USA: ACM Press, 2006, pp. 1103-1110.
16. G. Harik, "Linkage learning via probabilistic modeling in the ECGA," University of Illinois at Urbana-Champaign, Urbana, IL, IlliGAL Report No. 99010, January 1999.
17. G. R. Harik, F. G. Lobo, and K. Sastry, "Linkage learning via probabilistic modeling in the ECGA," in Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, M. Pelikan, K. Sastry, and E. Cantú-Paz, Eds. Berlin: Springer, 2006, ch. 3, pp. 39-61, (Also IlliGAL Report No. 99010).
18. K. Sastry and D. E. Goldberg, "Probabilistic model building and competent genetic programming," in Genetic Programming Theory and Practise, R. L. Riolo and B. Worzel, Eds. Kluwer, 2003, ch. 13, pp. 205-220.
19. L. de la Ossa, K. Sastry, and F. G. Lobo, "χ-ary extended compact genetic algorithm in C++," University of Illinois at Urbana-Champaign, Urbana, IL, IlliGAL Report No. 2006013, March 2006.
20. J. J. Rissanen, "Modelling by shortest data description," Automatica, vol. 14, pp. 465-471, 1978.
21. K. Sastry and D. E. Goldberg, "Designing competent mutation operators via probabilistic model building of neighborhoods," Proceedings of the 2004 Genetic and Evolutionary Computation Conference, vol. 2, pp. 114-125, 2004, also IlliGAL Report No. 2004006.
22. D. E. Goldberg, "Real-coded genetic algorithms, virtual alphabets, and blocking," Complex Systems, vol. 5, pp. 139-167, 1991.
23. E. Cantú-Paz, "Supervised and unsupervised discretization methods for evolutionary algorithms," Genetic and Evolutionary Computation Conference, January 24, 2001.
24. G. R. Harik, "Finding multimodal solutions using restricted tournament selection," in Proceedings of the 6th International Conference on Genetic Algorithms. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1995, pp. 24-31.
25. K. Sastry, "Evaluation-relaxation schemes for genetic and evolutionary algorithms," Master's thesis, University of Illinois at Urbana-Champaign, Urbana, IL, 2001, (Also IlliGAL Report No. 2002004).