Now showing items 1-10 of 13
Robot Base Disturbance Optimization with Compact Differential Evolution Light
(Springer Berlin Heidelberg, 2012-04)
Despite the constant growth of the computational power in consumer electronics, very simple hardware is still used in space applications. In order to obtain the highest possible reliability, in space systems limited-power ...
Memory-saving memetic computing for path-following mobile robots
Large Scale Problems in Practice: The effect of dimensionality on the interaction among variables
This article performs a study on correlation between pairs of variables in dependence on the problem dimensionality. Two tests, based on Pearson and Spearman coefficients, have been designed and used in this work. In total, ...
Three variants of three Stage Optimal Memetic Exploration for handling non-separable fitness landscapes
Three Stage Optimal Memetic Exploration (3SOME) is a recently proposed algorithmic framework which sequentially perturbs a single solution by means of three operators. Although 3SOME proved to be extremely successful at ...
Multi-strategy coevolving aging particle optimization
(World Scientific, 2014)
Continuous Parameter Pools in Ensemble Differential Evolution
Ensemble of parameters and mutation strategies differential evolution (EPSDE) is an elegant promising optimization framework based on the idea that a pool of mutation and crossover strategies along, with associated pools ...
Compact differential evolution light: high performance despite limited memory requirement and modest computational overhead
(Springer US, 2012-09-01)
Compact algorithms are Estimation of Distribution Algorithms which mimic the behavior of population-based algorithms by means of a probabilistic representation of the population of candidate solutions. These algorithms ...
The Importance of Being Structured: a Comparative Study on Multi Stage Memetic Approaches
Memetic Computing (MC) is a discipline which studies optimization algorithms and sees them as structures of operators, the memes. Although the choice of memes is crucial for an effective algorithmic design, special attention ...
Parallel Memetic Structures
Memetic Computing (MC) structures are algorithms composed of heterogeneous operators (memes) for solving optimization problems. In order to address these problems, this study investigates and proposes a simple yet extremely ...