Probabilistic Selection Approaches in Decomposition-Based Evolutionary Algorithms for Offline Data-Driven Multiobjective Optimization

Atanu Mazumdar

doi:10.1109/TEVC.2022.3154231

Probabilistic Selection Approaches in Decomposition-Based Evolutionary Algorithms for Offline Data-Driven Multiobjective Optimization

2022-10-01

9

OA

AI

DOI：10.1109/TEVC.2022.3154231

原文链接

原文求助

摘要

En 中文

In offline data-driven multiobjective optimization, no new data are available during the optimization process. Approximation models, also known as surrogates, are built using the provided offline data. A multiobjective evolutionary algorithm can be utilized to find solutions by using these surrogates. The accuracy of the approximated solutions depends on the surrogates and approximations typically involve uncertainties. In this article, we propose probabilistic selection approaches that utilize the uncertainty information of the Kriging models (as surrogates) to improve the solution process in offline data-driven multiobjective optimization. These approaches are designed for decomposition-based multiobjective evolutionary algorithms and can, thus, handle a large number of objectives. The proposed approaches were tested on distance-based visualizable test problems and the DTLZ suite. The proposed approaches produced solutions with a greater hypervolume, and a lower root mean squared error compared to generic approaches and a transfer learning approach that do not use uncertainty information.

Keyword:

Optimization

Uncertainty

Probability density function

Probabilistic logic

Statistics

Sociology

Linear programming

Gaussian processes

kernel density estimation

Kriging

metamodeling

Pareto optimality

surrogate

Probabilistic Selection Approaches in Decomposition-Based Evolutionary Algorithms for Offline Data-Driven Multiobjective Optimization

摘要

期刊

机构