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 redu...
Abstract In the past decades, surrogate-assisted evolutionary algorithms (SAEAs) have become one of ...
Open access journalSurrogate models (SMs) can profitably be employed, often in conjunction with evol...
This is the author accepted manuscript. The final version is available from the publisher via the DO...
Most existing work on evolutionary optimization assumes that there are analytic functions for evalua...
Multi-objective optimization problems are usually solved with genetic algorithms when the objective ...
Evolutionary, and especially genetic algorithms have become one of the most successful methods for t...
Abstract. This paper presents a new algorithm for derivative-free optimization of expensive black-bo...
Xu J, Jin Y, Du W. A federated data-driven evolutionary algorithm for expensive multi-/many-objectiv...
For design optimization with high-dimensional expensive problems, an effective and efficient optimiz...
We present a parallel evolutionary optimization algorithm that leverages surrogate models for solvin...
We present a parallel evolutionary optimization algorithm that leverages surrogate models for solvin...
In this paper, we present a novel surrogate-assisted evolutionary optimization framework for solving...
We propose a novel surrogate-assisted Evolutionary Algorithm for solving expensive combinatorial opt...
In real-world problems with candidate solutions that are very expensive to evaluate, Surrogate Model...
We propose a surrogate-assisted reference vector guided evolutionary algorithm for computationally e...
Abstract In the past decades, surrogate-assisted evolutionary algorithms (SAEAs) have become one of ...
Open access journalSurrogate models (SMs) can profitably be employed, often in conjunction with evol...
This is the author accepted manuscript. The final version is available from the publisher via the DO...
Most existing work on evolutionary optimization assumes that there are analytic functions for evalua...
Multi-objective optimization problems are usually solved with genetic algorithms when the objective ...
Evolutionary, and especially genetic algorithms have become one of the most successful methods for t...
Abstract. This paper presents a new algorithm for derivative-free optimization of expensive black-bo...
Xu J, Jin Y, Du W. A federated data-driven evolutionary algorithm for expensive multi-/many-objectiv...
For design optimization with high-dimensional expensive problems, an effective and efficient optimiz...
We present a parallel evolutionary optimization algorithm that leverages surrogate models for solvin...
We present a parallel evolutionary optimization algorithm that leverages surrogate models for solvin...
In this paper, we present a novel surrogate-assisted evolutionary optimization framework for solving...
We propose a novel surrogate-assisted Evolutionary Algorithm for solving expensive combinatorial opt...
In real-world problems with candidate solutions that are very expensive to evaluate, Surrogate Model...
We propose a surrogate-assisted reference vector guided evolutionary algorithm for computationally e...
Abstract In the past decades, surrogate-assisted evolutionary algorithms (SAEAs) have become one of ...
Open access journalSurrogate models (SMs) can profitably be employed, often in conjunction with evol...
This is the author accepted manuscript. The final version is available from the publisher via the DO...