Now showing items 1-10 of 24
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 ...
Cluster-Based Population Initialization for differential evolution frameworks
Abstract This article proposes a procedure to perform an intelligent initialization for population-based algorithms. The proposed pre-processing procedure, namely Cluster-Based Population Initialization (CBPI) consists of ...
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, ...
Rotation Invariance and Rotated Problems: An Experimental Study on Differential Evolution
This paper presents an experimental study on the efficacy of a rotation-invariant Differential Evolution (based on current-to-rand mutation) on a benchmark of test problems in its non-rotated and rotated version. Numerical ...
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 ...
HyperSPAM: A study on hyper-heuristic coordination strategies in the continuous domain
This article proposes a simplistic algorithmic framework, namely hyperSPAM, composed of three search algorithms for addressing continuous optimisation problems. The Covariance Matrix Adaptation Evolution Strategy (CMAES) ...
Meta-Lamarckian learning in three stage optimal memetic exploration
(IEEE Xplore, 2012-09)
Three Stage Optimal Memetic Exploration (3SOME) is a single-solution optimization algorithm where the coordinated action of three distinct operators progressively perturb the solution in order to progress towards the ...