Abstract
This chapter presents a real-coded genetic algorithm using the Unimodal Normal Distribution Crossover (UNDX) that can efficiently optimize functions with epistasis among parameters. Most conventional crossover operators for function optimization have been reported to have a serious problem in that their performance deteriorates considerably when they are applied to functions with epistasis among parameters. We believe that the reason for the poor performance of the conventional crossover operators is that they cannot keep the distribution of individuals unchanged in the process of repetitive crossover operations on functions with epistasis among parameters. In considering the above problem, we introduce three guidelines, ‘Preservation of Statistics’, ‘Diversity of Offspring’, and ‘Enhancement of Robustness’, for designing crossover operators that show good performance even on epistatic functions. We show that the UNDX meets the guidelines very well by a theoretical analysis and that the UNDX shows better performance than some conventional crossover operators by applying them to some benchmark functions including multimodal and epistatic ones. We also discuss some improvements of the UNDX under the guidelines and the relation between real-coded genetic algorithms using the UNDX and evolution strategies (ESs) using the correlated mutation.
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
Back, T., Hoffmeister, F. and Schwefel, H.-P. (1991) A Survey of Evolution Strategies, Proc. 4th Int’l Conf. on Genetic Algorithms, 2–9
Beyer, H.-G. and Deb, K. (2000) On the Desired Behaviors of Self-Adaptive Evolutionary Algorithms, Parallel Problem Solving from Nature VI (PPSN VI), 59–68
Davis, L. (1990) The Handbook of Genetic Algorithms, Van Nostrand Rein-hold, New York
Deb, K. and Agrawal, R.B. (1995) Simulated Binary Crossover for Continuous Search Space, Complex Systems, 9, 115–148
Deb, K. and Beyer, H.-G. (1999) Self-Adaptation in Real-Parameter Genetic Algorithms with Simulated Binary Crossover, Proc. Genetic and Evolutionary Computation Conf. 1999 (GECCO-99), 172–179
Deb, K. and Beyer, H.-G. (1999) Self-Adaptive Genetic Algorithms with Simulated Binary Crossover, Technical Report No. CI-61/99, Dept. Computer Science/XI, Univ. of Dortmund
Eshleman, L. J. and Schaffer, J. D. (1993) Real-Coded Genetic Algorithms and Interval-Schemata, Foundations of Genetic Algorithms, 2, 187–202
Goldberg, D. E. (1989) Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley, heading, MA
Jonikow, C. Z. and Michalewicz, Z. (1991) An Experimental Comparison of Binary and Floating Point Representations in Genetic Algorithms, Proc. 4th Int’l Conf. on Genetic Algorithms, 31–36
Kita, H., Ono, I. and Kobayashi, S. (1999) Multi-parental Extension of the Unimodal Normal Distribution Crossover for Real-coded Genetic Algorithms, Proc. 1999 Congress on Evolutionary Computation (CEC’99), 1581–1587
Kita, H., Ono, I. and Kobayashi, S. (1998) Theoretical Analysis of the Unimodal Normal Distribution Crossover for Real-coded Genetic Algorithms, Proc. 1998 IEEE Int’l Conf. on Evolutionary Computation, 529–534
Kita, H. and Yamamura, M. (1999) A Functional Specialization Hypothesis for Designing Genetic Algorithms, Proc. 1999 IEEE Int’l. Conf. on Systems, Man, and Cybernetics, 579–584
Michalewicz, Z. (1992) Genetic Algorithms+Data Structures=Evolution Programs, Springer-Verlag, Berlin
Mühlenbein, H. and Schlierkamp-Voosen, D. (1993) Predictive Models for the Breeder Genetic Algorithm I. Continuous Parameter Optimization, Evolutionary Computation, Vol.1, 25–49
Nomura, T. (1997) An Analysis on Crossover for Real Number Chromosomes in an Infinite Population Size, Proc. 15th Int’l Joint Conf. on Artificial Intelligence, 936–941
Ono, I. and Kobayashi, S. (1997) A Real-coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distribution Crossover, Proc. 7th Int’l Conf. on Genetic Algorithms, 246–253
Ono, I., Kobayashi, S. and Yoshida, K. (1998) Global and Multi-objective Optimization for Lens Design by Real-coded Genetic Algorithms, SPIE Proc. Vol. 3482, International Optical Design Conference, 110–121
Ono, I., Yamamura, M., Kobayashi, S. (1996) A Genetic Algorithm with Characteristic Preservation for Function Optimization, Proc. IIZUKA’96, 511–514
Qi, X. and Palmieri, F. (1994) Theoretical Analysis of Evolutionary Algorithms with an Infinite Population Size in Continuous Space Part I: Basic Properties of Selection and Mutation, Part II: Analysis of Diversification Role of Crossover, IEEE Transactions on Neural Networks, Vol. 5, No. 1, 102–119, 120-129
Radcliffe, N.J. (1991) Forma Analysis and Random Respectful Recombination, Proc. 4th Int’l Conf. on Genetic Algorithms, 222–229
Rechenberg, I. (1973) Evolutionsstrategie: Optimierung technischer Systeme nach Prinzipien der biologischen Evolution, Frommann-Holzboog Verlag, Stuttgart
Salomon, R. (1996) Performance Degradation of Genetic Algorithms Under Coordinate Rotation, Proc. 5th Annual Conf. on Evolutionary Programming, 155–161
Satoh, H., Yamamura, M. and Kobayashi, S. (1996) Minimal Generation Gap Model for GAs Considering Both Exploration and Exploitation, Proc. IIZUKA’96, 494–497
Schwefel, H.-P. (1981) Numerical optimization of computer models, Wiley, Chichester
Tsutsui, S., Yamamura, M. and Higuchi, T. (1999) Multi-parent Recombination with Simplex Crossover in Real Coded Genetic Algorithms, Proc. Genetic and Evolutionary Computation Conf. (GECCO’99), 657–664
Voigt, H.-M., Mühlenbein, H. and Gvetkovic, D. (1995) Fuzzy Recombination for the Breeder Genetic Algorithm, Proc. 6th Int’l Conf. on Genetic Algorithms, 104–111
Whitley, D., Starkweather, T. and Fuauay, D. (1989) Scheduling Problems and Traveling Salesman: The Genetic Edge Reconbination Operator, Proc. 3rd Int’l Conf. on Genetic Algorithms, 133–140
Wright, A. (1991) Genetic Algorithms for Real Parameter Optimization, Foundations of Genetic Algorithms, 205–218
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Ono, I., Kita, H., Kobayashi, S. (2003). A Real-coded Genetic Algorithm using the Unimodal Normal Distribution Crossover. In: Ghosh, A., Tsutsui, S. (eds) Advances in Evolutionary Computing. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-18965-4_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-18965-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-62386-8
Online ISBN: 978-3-642-18965-4
eBook Packages: Springer Book Archive