Category Archives: Global Continuous Unconstrained Optimization
Benchmarking the multi-view differential evolution on the noiseless BBOB-2012 function testbed
We propose a multi-view DE in which several mutation strategies are applied to the same current population to generate different views for the current iteration. The views are then merged using tournament-selection to generate the next single population. This Multi-View DE is benchmarked on the BBOB-2012 noiseless function testbed. Keywords: procés de test.
Efficiency Enhancement of ECGA Through Population Size Management
This paper describes and analyzes population size management, which can be used to enhance the efficiency of the extended compact genetic algorithm (ECGA). The ECGA is a selectorecombinative algorithm that requires an adequate sampling to generate a high-quality model of the problem. Population size management decreases the overall running time of the optimization process by
Using Smart Sampling to Discover Promising Regions and Increase the Efficiency of Differential Evolution
This paper presents a novel method to discover promising regions in a continuous search space. Using machine learning techniques, the algorithm named smart sampling was tested in hard known benchmark functions, and was able to find promising regions with solutions very close to the global optimum, significantly decreasing the number of evaluations needed by a
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