Simplex crossover and linkage identification: Single-stage evolution vs. multi-stage evolution

Proceedings of the 2002 Congress on Evolutionary Computation, CEC 2002

Volumn 1, Issue , 2002, Pages 974-979

  Tsutsui, Shigeyoshi ^a   Goldberg, David E ^b  

^a HANNAN UNIVERSITY   (Japan)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS;

COMPARATIVE STUDIES; LINKAGE IDENTIFICATION; MULTI-STAGE; REAL-CODED GENETIC ALGORITHM; SIMPLEX CROSSOVERS; SINGLE STAGE; STABLE PERFORMANCE;

GENETIC ALGORITHMS;

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

References (18)

1. Eshelman, L. J., Mathias, K. E., and Schaffer, J. D.: Crossover operator biases: exploiting the population distribution, Proc. of the Seventh Int. Conf on Genetic Algorithms, pp. 354-361 (1997).
2. Goldberg, D. E., and Deb, K.: A comparative analysis of selection schemes used in genetic algorithms. Foundation of Genetic Algorithms, pp. 69-93 (1991).
3. Goldberg, D. E., Deb, K., Kargupta, H., and Harik, G.: Rapid, accurate optimization of difficult problems using fast messy genetic algorithms, Proc. of the Fourth Int. Conf. on Genetic Algorithms, pp. 56-64 (1993).
4. Harik, G: Linkage learning via probabilistic modeling in the ECGA, IIHGAL Report 99010, Univ. of Illinois at Urbana- Champaign, Urbana, Illinois (1999).
5. Higuchi, T., Tsutsui, S., and Yamamura, M.: Theoretical analysis of simplex crossover for real-coded Genetic Algorithms, Proc. of the PPSN VI, pp. 365-374 (2000).
6. Kita, H. and Yamamura, M.: A functional specialization hypothesis for designing genetic algorithms, Proc. IEEE Int. Conf. on SMC, pp. III-579-584 (1999).
7. Lobo, F.G., Deb, K., Goldberg, D.E., Harik, G., and Wang, L.: Compressed introns in a linkage learning genetic algorithm. Genetic Programming: Proc. of the Third Annual Conf, pp. 551- 558 (1998).
8. Michalewicz, Z. : Genetic algorithms+data stnictures=evolution program. Springer-Verlag (1994).
9. Munetomo, M and Goldberg, D. E.: Linkage identification by non-monotonicity detection for overlapping functions. Evolutionary Computation, Vol. 7, No. 4, pp. 377-398 (1999).
10. Ono, L, Kita, H., and Kobayashi, S.: A robust real-coded genetic algorithm using unimodal normal distribution crossover augmented by uniform crossover: effects of self-adaptation of crossover probabilities, Proc. of the GECCO-99, pp.496-503 (1999).
11. Pelikan, M., Goldberg, D. E., and Lobo, F. G. : A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, Kluwer Academic Publishers (in press).
12. Qi, A and Palmieri, F: Theoretical analysis of evolutionary algorithms with an infinite population size in continuous space Part I: Basic properties of selection and mutation, IEEE Trans, on Neural Networks, vol. 5, No. 1, pp. 102-119(1994).
13. Renders, J. and Bersini, H.: Hybridizing genetic algorithms with hill-climbing methods for global optimization:two possible ways, Proc. of IEEE Int. Conf. on Evolutionary Computation, pp. 312-317(1994).
14. Satoh, H, Yamamura, M. and Kobayashi, S.: Minimal generation gap model for GAs considering both exploration and exploitation. Proc. of the IIZUKA '96, pp. 494-497 (1997).
15. Surry, P. D. and Radcliffe, N.: Real representations. Foundations of Genetic Algorithms 4, pp. 343-363 (1996).
16. Tsutsui, S., Yamamura, M., and Higuchi, T: Multi-parent recombination with simplex crossover in real-coded genetic algorithms, Proc. of the GECCO-99, pp.657-664 (1999).
17. Tsutsui, S., Goldberg, D. E., and Sastry, K.: Progress Toward Linkage Identification in Real-Coded GAs with Simplex Crossover, IlliGAL Report No. 2000033, University of Illinois (2000).
18. Tsutsui, S., Goldberg, D. E., and Sastry, K.: Linkage learning in Real-Coded GAs with Simplex Crossover, Proc. of the 5th Int. Conf on Artificial Evolution (EA '01), pp. 73-84 (2001).