A Mean-Variance Optimization algorithm

Istvan Erlich, Ganesh K. Venayagamoorthy, Nakawiro Worawat
2010 IEEE Congress on Evolutionary Computation  
A new stochastic optimization algorithm referred to by the authors as the 'Mean-Variance Optimization' (MVO) algorithm is presented in this paper. MVO falls into the category of the so-called "population-based stochastic optimization technique." The uniqueness of the MVO algorithm is based on the strategic transformation used for mutating the offspring based on mean-variance of the n-best dynamic population. The mapping function used transforms the uniformly distributed random variation into a
more » ... m variation into a new one characterized by the variance and mean of the n-best population attained so far. The searching space within the algorithm is restricted to the range -zero to one -which does not change after applying the transformation. Therefore the variables are treated always in this band but the function evaluation is carried out in the problem range. The performance of MVO algorithm has been demonstrated on standard benchmark optimization functions. It is shown that MVO algorithm finds the near optimal solution and is simple to implement. The features of MVO make it a potentially an attractive algorithm for solving many real-world optimization problems.
doi:10.1109/cec.2010.5586027 dblp:conf/cec/ErlichVW10 fatcat:g5zdrydsqfaljekbuxhusm4zfu