Multi-Objective Efficient Global Optimization Method With Truncated Expected Improvement Matrix-Based Infill Criterion for Problems With Prior Knowledge on Objective Bounds
Comparative studies demonstrate that the proposed MOEGO methods could obtain better solutions in terms of convergence and diversity or find solutions in region of interest by making use of the prior knowledge on the objectives.
Abstract
The multi-objective efficient global optimization (MOEGO), an extension of the single-objective efficient global optimization algorithm with the intention to handle multiple objectives, is one of the most frequently studied surrogate-based multi-objective optimization algorithms. The efficiency of MOEGO algorithm mainly depends on the multi-objective expected improvement criterion used. The expected improvement matrix (EIM) based criterion is cheap-to-evaluate and yet efficient compared to the others. The EIM criterion stands on the assumption: for an untested point, the prediction of each objective follows a normal distribution which varies from minus infinity and plus infinity. However, in many practical applications, a prior knowledge about the objective range is available. Such prior knowledge may be the known/estimated objective bounds or come from the designers’ preferences which is the designers want solutions in a region of interest other than those scattered over the whole objective space. But such prior knowledge of the objective functions has not been made use of in the EIM based criterion. To make use of such prior knowledge on objective range, a truncated expected improvement matrix (TEIM) based criterion is proposed and incorporated to MOEGO to develop methods dedicated to use the known lower bounds or prior preference respectively. Comparative studies demonstrate that the proposed MOEGO methods could obtain better solutions in terms of convergence and diversity or find solutions in region of interest by making use of the prior knowledge on the objectives. By integrating the prior preference-inspired MOEGO with TEIM based criterion, the modified Parsec airfoil generation method, and flow solver, a prior-preference inspired airfoil shape optimization method is established and applied to maximize the lift/drag coefficient ratio and minimize the drag coefficient, from which the effectiveness of the proposed method to solve practical problem is demonstrated.
An objective-wise variable analysis method that first evaluates the sensitivity of each objective to all decision variables, and then comprehensively aggregates the sensitivity information across multiple objectives to estimate the overall importance of decision variables is proposed.
Chuanlong Ye, Fazhi He, Xiaoxin Gao et al.· Journal of King Saud Univers...· 0 citations
This study introduces a novel constrained multi-objective evolutionary algorithm, termed DPCME, which employs two interacting populations that exchange information, enabling effective global exploration and reducing the risk of convergence to local optima.
Results show that integrating local search significantly enhances performance, while a principled method for setting hybrid parameters ensures robustness and reproducibility, highlighting the potential of combining mathematical programming techniques with evolutionary algorithms for high-dimensional many-objective optimization problems.
Regina C. L. C. de Sousa, Dênis E. C. Vargas, Elizabeth F. Wanner et al.· Journal of Heuristics· 0 citations
This work proposes a class of Multi-Objective Moreau Envelope based Hessian-free Algorithms (MOMEHA) to solve the multi-objective bilevel learning problems with nonconvex lower level and proposes a momentum-based variant of MOMEHA (i.e., MB-MOMEHA) method to solve the stochastic multi-objective bilevel learning problems.
This first complete mathematical runtime analysis for the MOEA/D using the original weighted-sum decomposition shows that this variant of the algorithm solves the classic OneMinMax benchmark considerably faster than both the MOEA/D with Tchebycheff decomposition and many other classic algorithms such as the NSGA-II, NSGA-III, SMS-EMOA, and SPEA2.
Danyang Zhang, Zerong Zhong, Weijie Zheng et al.· Proceedings of the Genetic a...· 0 citations
Multidisciplinary design optimisation (MDO) is a field of optimisation where problems are partitioned into a set of subproblems, or disciplines, with interactions between them. Multi-objective (MO)-MDO considers cases where multiple objectives exist at the problem or subproblem level. Of particular interest are MO-MDO architectures and methods for a posteriori decision making—in which the aim of the optimiser is to produce an approximation of the efficient set of Pareto optimal solutions. A variety of a posteriori MO-MDO methods have been proposed, many of which draw on concepts and tools from evolutionary computation and machine learning. However, these approaches have arisen across a fragmented set of literatures, and there is no unified guide available to support practitioners or steer the progressive development of new methods. This survey aims to provide such a unified perspective. The issue of characterising multi-objectivity in MO-MDO is discussed and a typology is introduced to identify the different methods in an accessible and straightforward way. The available benchmark problems for MO-MDO are also surveyed. Key issues and potential paths for future research in MO-MDO are identified and discussed.
Victoria Johnson, João A. Duro, V. Kadirkamanathan et al.· ACM Transactions on Evolutio...· 0 citations