Abstract
The inherent complexity of the Genetic Algorithms (GAs) has led to various theoretical an experimental approaches whose ultimate goal is to better understand the dynamics of such algorithms. Through such understanding, it is hoped, we will be able to improve their efficiency. Experiments, typically, explore the GA’s behavior by testing them versus a set of functions with characteristics deemed adequate. In this paper we present a methodology which aims at achieving a solid relative evaluation of alternative GAs by resorting to statistical arguments. With it we may categorize any iterative optimization algorithm by statistically finding the basic parameters of the probability distribution of the GA’s optimum values without resorting to a priori functions. We analyze the behavior of 6 algorithms (5 variations of a GA and a hill climber) which we characterize and compare. We make some remarks regarding the relation between statistical studies such as ours and the well known “No Free Lunch Theorem”.
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
Mitchell, M., “What Makes a Problem Hard for a Genetic Algorithm? Some Anomalous Results and Their Explanation”, Machine Learning, 13, 285–319, 1993.
Back, T., “The Interaction of Mutation Rate, Selection and Self-Adaptation Within a Genetic Algorithm”, R. Maumnler and B. Manderick, editors: Parallel Problem Solving from Nature, 2, 85–94, Elsevier, Amsterdam, 1992.
Fogel, D., Ghozeil, A., “Schema Processing under Proportional Selection in the Presence of Random Effects”, IEEE Transactions on Evolutionary Computation, Vol. 1:4, 290–293, 1997.
Kuri, A., and Galaviz, J., “Towards a New Framework for the Analysis of Genetic Algorithms”, International Computation Symposium, I.P.N., México, 1998.
De Jong, K., Sarma, J., “An Analysis of the Effects of Neighborhood Size and Shape on Local Selection Algorithms,” Proc. of PPSN-96, the Second International Conference on Parallel Problem Solving from Nature, Springer-Verlag, 1996.
Mitchell, M., Forrest, S., and Holland, J., “The Royal Road for Genetic Algorithms: Fitness Landscapes and GA Performance”, in F.J. Varela and P. Bourgine, eds., Towards a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, MIT Press, 1992.
Schmitzberger, P., “Approximation and Interpolation of High Dimensional Functions by generalized Walsh Polynomials”, in R. Trobec et al., eds., Proceedings of the International Workshop Parallel Numerics’ 96, Gozd Martuljek, Slovenia, 150–164, 1996.
Mitchell, M., An Introduction to Genetic Algorithms, 4:129, MIT Press, 1996.
Goldberg, D., Genetic Algorithms in Search, Optimization and Machine Learning, Addision-Wesley, 1989.
Kuri, A., “A Statistical Genetic Algorithm”, National Computation Meeting, Hidalgo, México, 1999.
Kuri, A., and Villegas, C., “A Universal Genetic Algorithm for Constrained Optimization”, 6th European Congress on Intelligent Techniques and Soft Computing, Aachen, Germany, 1998.
Wolpert, D., and Macready, W., “No Free Lunch Theorems for Optimization”, IEEE Transactions on Evolutionary Computation, 1:67–82, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuri-Morales, A.F. (2002). A Methodology for the Statistical Characterization of Genetic Algorithms. In: Coello Coello, C.A., de Albornoz, A., Sucar, L.E., Battistutti, O.C. (eds) MICAI 2002: Advances in Artificial Intelligence. MICAI 2002. Lecture Notes in Computer Science(), vol 2313. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46016-0_9
Download citation
DOI: https://doi.org/10.1007/3-540-46016-0_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43475-7
Online ISBN: 978-3-540-46016-9
eBook Packages: Springer Book Archive