(u, v)-ES for function optimization (freetonik | фритоник) Binary tree

freetonik's homepage → Programming → (u, v)-ES for function optimization

This is an Evolutionary strategy algorithm for function optimizing. It was done as a part of assignment for the course of Evolutionary Computation.

About the algorithm

(30, 200)-ES terminated after 200000 function evaluations or when an optimum has been found. The goal is to optimize the function with a precision of 4 decimal places for each variable:

using the evolutionary strategy. The population consists of possible solutions (combinations) of xi and sigma: the number which controles the rate of mutation and mutates itself.

The source code can be downloaded here.

© 2007-2010 Rakhim Davletkaliyev
e-mail: freetonik@gmail.com