Abstract
Function optimization is a typical application domain for genetic algorithms (GAs). Traditionally, GAs work on bit strings of fixed total length l. Significant research has been done on designing and analyzing different coding schemes, of which Gray coding is one of the most used forms. Surprisingly little attention has been devoted to directly encoding the parameters by floating-point values provided by the programming language. This form of coding has been in favor in evolution strategy. This paper discusses several coding schemes and derives the resulting complexity when optimizing functions with n independent continuous parameters. It turns out that the direct use of real-valued parameters has certain advantages. First of all, it speeds up convergence by a factor of up to l q −1, where q denotes the number of bits per parameter. Furthermore, the use of real-valued parameters allows for more flexibility in designing the mutation operator and eases many implementation issues. The theoretical analysis presented here strongly suggests that real-valued parameters (implemented by floating point values provided by the programming language) should be the best choice when applying a GA in the field of function optimization.
Preview
Unable to display preview. Download preview PDF.
References
Bäck, T., 1993, Optimal Mutation Rates in Genetic Search, in: Proceedings of the Fifth International Conference on Genetic Algorithms, S. Forrest (ed.) (Morgan Kaufmann, San Mateo, CA), pp. 2–8.
Bäck, T., Schwefel, H.-P.., 1993, An Overview of Evolutionary Algorithms for Parameter Optimization, Evolutionary Computation 1(1), pp. 1–23.
Cormen, T.H., Leiserson, C.E., and Rivest, R.L., 1990, Introduction to Algorithms, (The MIT Press, Cambridge, MA).
De Jong, K.A., 1975, An Analysis of the Behavior of a Class of Genetic Adaptive Systems, Ph.D. Thesis (University of Michigan).
Goldberg, D.E., 1989, Genetic Algorithms in Search, Optimization and Machine Learning (Addison-Wesley Publishing Company).
Nolfi, S., Parisi, D., 1995, Learning to Adapt to Changing Environments in Evolving Neural Networks, Technical Report 95-15, Institute of Psychology, National Research Council, Rome, Italy, http://kant.irmkant.rm.cnr.it/public.html.
Mühlenbein, H., 1992, How genetic algorithms really work I: Mutation and hill climbing, in: Proceedings of Parallel Problem Solving from Nature 2, H.P. Schwefel and R. Männer (eds.) (Springer-Verlag), pp. 15–26.
Mühlenbein, H., Schlierkamp-Voosen, D., 1993a, Predictive Models for the Breeder Genetic Algorithm I, Evolutionary Computation 1(1):25–50.
Mühlenbein, H., Schlierkamp-Voosen, D., 1993b, The Science of Breeding and its Application to the Breeder Genetic Algorithm. Evolutionary Computation, 1(4):335–360.
Potter, M.A., De Jong, K.A., 1994, A Cooperative Coevolutionary Approach to Function Optimization, in: Proceedings of Parallel Problem Solving from Nature 3, Y. Davidor, H.P. Schwefel, and R. Männer (eds.) (Springer-Verlag), pp. 249–257.
Rechenberg, I., 1973, Evolutionsstrategie (Frommann-Holzboog, Stuttgart).
Salomon, R., 1996. Implicit Independence Assumptions; a Notorious Problem for Genetic Algorithms. To appear in Soft Computing, SOCO'96, Reading, England.
Schwefel, H.P., 1977, Numerische Optimierung von Computer-Modellen mittels evolutionsstrategie (Birkhäuser Verlag, Basel and Stuttgart).
Schwefel, H.P., 1995, Evolution and Optimum Seeking (John Wiley and Sons, Inc, New York, Chicester, Brisbane, Toronto, Singapore).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Salomon, R. (1996). The influence of different coding schemes on the computational complexity of genetic algorithms in function optimization. In: Voigt, HM., Ebeling, W., Rechenberg, I., Schwefel, HP. (eds) Parallel Problem Solving from Nature — PPSN IV. PPSN 1996. Lecture Notes in Computer Science, vol 1141. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61723-X_987
Download citation
DOI: https://doi.org/10.1007/3-540-61723-X_987
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61723-5
Online ISBN: 978-3-540-70668-7
eBook Packages: Springer Book Archive