Reducing the complexity of evolutionary search with stochastic objective function

A method for significantly reducing the complexity of evolutionary search in solving large-dimensional combinatorial optimization problems with stochastic objective function is proposed. The method consists in a controlled change in the variance of the evaluation function in the search process.