5 research outputs found
A Random Forest Assisted Evolutionary Algorithm for Data-Driven Constrained Multi-Objective Combinatorial Optimization of Trauma Systems for publication
Many real-world optimization problems can be
solved by using the data-driven approach only, simply because no
analytic objective functions are available for evaluating candidate
solutions. In this work, we address a class of expensive datadriven
constrained multi-objective combinatorial optimization
problems, where the objectives and constraints can be calculated
only on the basis of large amount of data. To solve this class
of problems, we propose to use random forests and radial basis
function networks as surrogates to approximate both objective
and constraint functions. In addition, logistic regression models
are introduced to rectify the surrogate-assisted fitness evaluations
and a stochastic ranking selection is adopted to further reduce
the influences of the approximated constraint functions. Three
variants of the proposed algorithm are empirically evaluated on
multi-objective knapsack benchmark problems and two realworld
trauma system design problems. Experimental results
demonstrate that the variant using random forest models as
the surrogates are effective and efficient in solving data-driven
constrained multi-objective combinatorial optimization problems
Global and local surrogate-assisted differential evolution for expensive constrained optimization
The file attached to this record is the author's final peer reviewed version.For expensive constrained optimization problems, the computation of objective function and constraints is very time-consuming. This paper proposes a novel global and local surrogate-assisted differential evolution for solving expensive constrained optimization problems with inequality constraints. The proposed method consists of two main phases: global surrogate-assisted phase and local surrogate-assisted phase. In the global surrogate-assisted phase, differential evolution serves as the search engine to produce multiple trial vectors. Afterward, the generalized regression neural network is used to evaluate these trial vectors. In order to select the best candidate from these trial vectors, two rules are combined. The first is the feasibility rule, which at first guides the population toward the feasible region, and then toward the optimal solution. In addition, the second rule puts more emphasis on the solution with the highest predicted uncertainty, and thus alleviates the inaccuracy of the surrogates. In the local surrogate-assisted phase, the interior point method coupled with radial basis function is utilized to refine each individual in the population. During the evolution, the global surrogate-assisted phase has the capability to promptly locate the promising region and the local surrogate-assisted phase is able to speed up the convergence. Therefore, by combining these two important elements, the number of fitness evaluations can be reduced remarkably. The proposed method has been tested on numerous benchmark test functions from three test suites and two real-world cases. The experimental results demonstrate that the performance of the proposed method is better than that of other state-of-the-art methods