Abstract
In this paper, we perform theoretical analysis and experiments on the Simplex Crossover (SPX), which we have proposed. Real-coded GAs are expected to be a powerful function optimization technique for real-world applications where it is often hard to formulate the objective function. However, we believe there are two problems which will make such applications difficult; 1) performance of real-coded GAs depends on the coordinate system used to express the objective function, and 2) it costs much labor to adjust parameters so that the GAs always find an optimum point efficiently. The result of our theoretical analysis and experiments shows that a performance of SPX is independent of linear coordinate transformation and that SPX always optimizes various test function efficiently when theoretical value for expansion rate, which is a parameter of SPX, is applied.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Thomas Bäck. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, 1996.
Larry J. Eshelman and J. David Schaffer. Real coded genetic algorithms and interval-schemata. In Foundations of Genetic Algorithms 2, pages 187–202, 1993.
Hajime Kita, Isao Ono, and Shigenobu Kobayashi. Theoretical analysis of the unimodal normal distribution crossover for real-coded genetic algorithms. In Proc. ICEC98, pages 529–534, 1998.
Hajime Kita, Isao Ono, and Shigenobu Kobayashi. Multi-parental extension of the unimodal normal distribution crossover for real-coded genetic algorithms. In Proc. of the 1999 Congress on Evolutionary Computation, pages 1581–1588, 1999.
Hajime Kita and Masayuki Yamamura. A functional specialization hypothesis for designing genetic algorithms. In IEEE International Conference on Systems, Man, and Cybernetics, page 250, 1999.
Isao Ono and Shigenobu Kobayashi. A real-coded genetic algorithm for function optimization using unimodal normal distribution crossover. In Proc. 7th ICG A, pages 246–253, 1997.
Jean-Michel Renders and Hugues Bersini. Hybridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways. In Proc. of IEEE International Conference on Evolutionary Computation, pages 312–317, 1994.
Ralf Salomon. Performance degradation of genetic algorithms under coordinate rotation. In Proc. of the Fifth Annual Conference on Evolutionary Programming, pages 155–161, 1996.
Hiroshi Satoh, Masayuki Yamamura, and Shigenobu Kobayashi. Minimal generation gap model for gas considering both exploration and exploitation. In Proc. IIZUKA’ 96, pages 494–497, 1997.
Shigeyoshi Tsutsui, Masayuki Yamamura, and Takahide Higuchi. Multi-parent recombination with simplex crossover in real coded genetic algorithms. In Proc. of the Genetic and Evolutionary Computation Conference, volume 1, pages 657–664, 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Higuchi, T., Tsutsui, S., Yamamura, M. (2000). Theoretical Analysis of Simplex Crossover for Real-Coded Genetic Algorithms. In: Schoenauer, M., et al. Parallel Problem Solving from Nature PPSN VI. PPSN 2000. Lecture Notes in Computer Science, vol 1917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45356-3_36
Download citation
DOI: https://doi.org/10.1007/3-540-45356-3_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41056-0
Online ISBN: 978-3-540-45356-7
eBook Packages: Springer Book Archive