On Promising Regions and Optimization Effectiveness of Continuous and Deceptive Functions

This paper evaluates the performance of three evolutionary algorithms to globally optimize complex continuous functions. The performance is evaluated by measuring the algorithms success rate to find the global optimum in several trials. At each set of trials, the search-space is reduced to be closer to the global optimum, so that the starting population is generated in an even more promising region. According to the results, it is possible to conclude that, in high complexity problems, a good performance of classical evolutionary algorithms cannot be expected. The paper also evaluates the performance of an evolutionary algorithm in a deceptive function. In this case, the reduced search-space is the model which generates the deceptive function. The success rates with and without the use of the starting model were compared. In this case, the use of a better starting model substantially increases the performance.


author={de Melo, V.V. and Delbem, A.C.B.},
booktitle={Evolutionary Computation, 2008. CEC 2008. (IEEE World Congress on Computational Intelligence). IEEE Congress on}, title={On promising regions and optimization effectiveness of continuous and deceptive functions},
pages={4184 -4191},
keywords={Capacity planning;Evolutionary computation;Genetic algorithms;Genetic mutations;Probability;Scattering;evolutionary computation;search problems;continuous functions;deceptive functions;evolutionary algorithms;optimization effectiveness;promising regions;search-space;},