EMT-ReMO: Evolutionary Multitasking for High-Dimensional Multi-Objective Optimization via Random Embedding

Author(s):  
Yinglan Feng ◽  
Liang Feng ◽  
Yaqing Hou ◽  
Kay Chen Tan ◽  
Sam Kwong
2021 ◽  
pp. 1-59
Author(s):  
George Cheng ◽  
G. Gary Wang ◽  
Yeong-Maw Hwang

Abstract Multi-objective optimization (MOO) problems with computationally expensive constraints are commonly seen in real-world engineering design. However, metamodel based design optimization (MBDO) approaches for MOO are often not suitable for high-dimensional problems and often do not support expensive constraints. In this work, the Situational Adaptive Kreisselmeier and Steinhauser (SAKS) method was combined with a new multi-objective trust region optimizer (MTRO) strategy to form the SAKS-MTRO method for MOO problems with expensive black-box constraint functions. The SAKS method is an approach that hybridizes the modeling and aggregation of expensive constraints and adds an adaptive strategy to control the level of hybridization. The MTRO strategy uses a combination of objective decomposition and K-means clustering to handle MOO problems. SAKS-MTRO was benchmarked against four popular multi-objective optimizers and demonstrated superior performance on average. SAKS-MTRO was also applied to optimize the design of a semiconductor substrate and the design of an industrial recessed impeller.


Author(s):  
Ken Kobayashi ◽  
Naoki Hamada ◽  
Akiyoshi Sannai ◽  
Akinori Tanaka ◽  
Kenichi Bannai ◽  
...  

Multi-objective optimization problems require simultaneously optimizing two or more objective functions. Many studies have reported that the solution set of an M-objective optimization problem often forms an (M − 1)-dimensional topological simplex (a curved line for M = 2, a curved triangle for M = 3, a curved tetrahedron for M = 4, etc.). Since the dimensionality of the solution set increases as the number of objectives grows, an exponentially large sample size is needed to cover the solution set. To reduce the required sample size, this paper proposes a Bézier simplex model and its fitting algorithm. These techniques can exploit the simplex structure of the solution set and decompose a high-dimensional surface fitting task into a sequence of low-dimensional ones. An approximation theorem of Bézier simplices is proven. Numerical experiments with synthetic and real-world optimization problems demonstrate that the proposed method achieves an accurate approximation of high-dimensional solution sets with small samples. In practice, such an approximation will be conducted in the postoptimization process and enable a better trade-off analysis.


Author(s):  
Jinouwen Zhang ◽  
Haowan Zhuang ◽  
Jinfang Teng ◽  
Mingmin Zhu ◽  
Xiaoqing Qiang

In the modern aerodynamic design of turbomachinery blades, the geometries of blades often need to be reshaped to achieve better aerodynamic performance by introducing extra parametric design variables. A higher variable dimension will lead to a larger sampling range as well as a sparser sample distribution, which challenges the effectiveness and stability of optimization schemes based on surrogate model by making the model prediction quality even poorer. In this paper, a multi-objective optimization based on Gaussian process model was carried out for a high dimensional design space. Based on the previous two-dimensional optimization, tandem stators of a modern compressor were optimized by the design of sweep and dihedral. The purpose of the study is to improve the aerodynamic performance of the compressor tandem stators as well as to provide an effective optimization scheme for high dimensional multi-objective optimization problems. The design of sweep and dihedral for reshaping the tandem stators consists of a total of 18 design variables. An improvement in total pressure recovery coefficient of at least 0.7% at positive incidence and at least 0.3% at negative incidence was obtained, much larger than that in the previous two-dimensional optimization. The optimization process shows that, by using Gaussian process as the surrogate model and a special sampling strategy, this optimization scheme is effective and efficient to handle this high dimensional space. The aerodynamic influences of design parameters of tandem blades were analyzed in detail and the superiority of sweep and dihedral in reducing aerodynamic loss was confirmed.


Author(s):  
Zebin Zhang ◽  
Pengfei Zhang ◽  
Ruizhen Li

Multi-objective optimization can reveal the complex parameter-objective relationships in the high-dimensional design problems. However, the data-extraction and data-presentation of the high-dimensional complex nonlinear system suffers from the increasing dimensionality. Key features and data-distribution of high-dimensional design spaces:parameter and objective spaces could be obtained by using Self-Organizing Maps (SOM) method, which re-clusters the high-dimensional multi-attribute data existing on the Pareto front into several low-dimensional maps. Correlations among all the design variables can be drawn according the colorized topological structure of the maps. Under the constraints including geometric structure and operating parameters, a low-cost and high accurate Kriging surrogate model was established to optimize a hybrid sliding bearing based on the sequential design method. Correlations between 3 objectives:"friction-to-load" ratio, temperature rise, instability threshold speed and 4 design parameters were extracted by SOM. Optimal feature regions were captured and analyzed. Results show that, within the specific feasible design space, supply pressure, axial bearing land width have important impact on the selected objectives, whereas the other parameters such as deep pocket depth and shallow pocket angle have relatively limited impact. A series of corresponding design decisions and optimization results help to understand the mechanism of the hybrid sliding bearing system in a much more intuitive way.


2021 ◽  
Vol 11 (19) ◽  
pp. 8971
Author(s):  
Yalong Zhang ◽  
Wei Yu ◽  
Xuan Ma ◽  
Hisakazu Ogura ◽  
Dongfen Ye

The solution space of a frequent itemset generally presents exponential explosive growth because of the high-dimensional attributes of big data. However, the premise of the big data association rule analysis is to mine the frequent itemset in high-dimensional transaction sets. Traditional and classical algorithms such as the Apriori and FP-Growth algorithms, as well as their derivative algorithms, are unacceptable in practical big data analysis in an explosive solution space because of their huge consumption of storage space and running time. A multi-objective optimization algorithm was proposed to mine the frequent itemset of high-dimensional data. First, all frequent 2-itemsets were generated by scanning transaction sets based on which new items were added in as the objects of population evolution. Algorithms aim to search for the maximal frequent itemset to gather more non-void subsets because non-void subsets of frequent itemsets are all properties of frequent itemsets. During the operation of algorithms, lethal gene fragments in individuals were recorded and eliminated so that individuals may resurge. Finally, the set of the Pareto optimal solution of the frequent itemset was gained. All non-void subsets of these solutions were frequent itemsets, and all supersets are non-frequent itemsets. Finally, the practicability and validity of the proposed algorithm in big data were proven by experiments.


Sign in / Sign up

Export Citation Format

Share Document