Un optimizador simple de Monte Carlo basado en muestreo adaptativo por coordenadas
(A Simple Monte Carlo optimizer based on Adaptive Coordinate Sampling)
Juan David Velásquez (email@example.com)
Universidad Nacional de Colombia
This paper appears in: Revista IEEE América Latina
Publication Date: March 2014
Volume: 12, Issue: 2
This paper introduces a novel approach to optimize non-linear complex functions. The proposed algorithm is based on four key ideas: first, the optimization of one component of the current solution each time; second, the use of a truncated normal distribution as a random global optimization technique for optimizing the current dimension of the current solution; third, the evolution of the standard deviation of the sampling distribution in each iteration, as a mechanism of self-adaptation; and fourth, the restart of the algorithm for escaping of local optima. We test our approach using eight well-known benchmark problems. Our algorithm is comparable with, and, in some cases, better than, other well-established heuristic algorithms as evolution strategies and differential evolution, when considering the quality of the solutions obtained.
Heuristics, Random optimization, Differential evolution, Evolutionary Programming, Global optimization
Documents that cite this
This function is not implemented yet.
[PDF Full-Text (581)]