Abstract
The Evolutionary Algorithms(EA), see [1] and [2], are stochastic techniques able to find the optimal solution to a given problem. The concept of optimal solution depends on the specific application, it could be the search of the global minimum of a complicated function. These algorithms are based on Darwin theories about natural selection. Natural selection allows to survive only best individuals (that is individuals more suitable to fit environment changes); in this way there is a generalized improvement of the entire population. Only the most performing individuals can transfer their genotype to the descendants.In the EA the parameter measuring individuals performance (in literature known as individuals fitness) is called fitness function. Time goes on by discrete steps. Starting by an initial population randomly generated, the process of evolution takes place. The most used operators that allow to obtain the new generation are: Reproduction, Recombination, Mutation and Selection. Let’s to consider more formally these statements. Given a generic fitness function F defined in a N-dimensional parameters space, Y, and with values in an M-dimensional space Z:
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
H. G. Beyer. The Theory of Evolution Strategies. Springer-Verlag, New York, 2001.
B. Naudts L. Kallel and A. Rogers. Theoretical Aspects of Evolutionary Computing. Springer-Verlag, New York, 2001.
R. Storn and K. Price. Differential evolution – a simple and efficient scheme for global optimization over continues spaces. Technical Report TR-95-012 at Internal Computer Science Institute.
M. Dorigo D. Corne and F. Glover. New Ideas in Optimization. McGraw-Hill International(UK), 1999.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer
About this paper
Cite this paper
Cesario, N., Petti, P., Pirozzi, F. (2006). Stochastic Algorithm Computational Complexity Comparison on Test Functions. In: Abraham, A., de Baets, B., Köppen, M., Nickolay, B. (eds) Applied Soft Computing Technologies: The Challenge of Complexity. Advances in Soft Computing, vol 34. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-31662-0_23
Download citation
DOI: https://doi.org/10.1007/3-540-31662-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31649-7
Online ISBN: 978-3-540-31662-6
eBook Packages: EngineeringEngineering (R0)