A Multifractal-Guided Multilevel Surrogate Model-Based Evolutionary Algorithm for Expensive Multiobjective Problems

2017 ◽  
Vol 26 (07) ◽  
pp. 1750109 ◽  
Author(s):  
Dongmei Zhang ◽  
Jianping Liao ◽  
Xiaohui Huang ◽  
Jiaqi Jin

In applied engineering, there are tremendous optimization problems which are multiobjective problems. Meanwhile, a number of them require large amount of time to evaluate their expensive cost function during optimization procedures. This kind of problems can be either financially expensive due to significant computational resources being required or time expensive due to numerous computational complexity. Aiming to this kind of problems, this paper proposed a multilevel surrogate model-based evolutionary algorithm. The proposed method employs DACE modeling method at the beginning to obtain a global trend in the decision domain. When more and more samples are involved and the sample distribution presents a trend or a manifold, the SVR model is utilized as a second-level surrogate model to achieve a better local search. The model transition is determined by the multifractal analysis on the solution set. Experimental results on ZDT and DTLZ standard test cases demonstrate that the time for EGO modeling can be reduced, and the accuracy can be better balanced by comparing to existing SVR and EGO methods.

Electronics ◽  
2020 ◽  
Vol 9 (11) ◽  
pp. 1866
Author(s):  
Kei Ohnishi ◽  
Kouta Hamano ◽  
Mario Koeppen

Recently, evolutionary algorithms that can efficiently solve decomposable binary optimization problems have been developed. They are so-called model-based evolutionary algorithms, which build a model for generating solution candidates by applying a machine learning technique to a population. Their central procedure is linkage detection that reveals a problem structure, that is, how the entire problem consists of sub-problems. However, the model-based evolutionary algorithms have been shown to be ineffective for problems that do not have relevant structures or those whose structures are hard to identify. Therefore, evolutionary algorithms that can solve both types of problems quickly, reliably, and accurately are required. The objective of the paper is to investigate whether the evolutionary algorithm evolving developmental timings (EDT) that we previously proposed can be the desired one. The EDT makes some variables values more quickly converge than the remains for any problems, and then, decides values of the remains to obtain a higher fitness value under the fixation of the variables values. In addition, factors to decide which variable values converge more quickly, that is, developmental timings are evolution targets. Simulation results reveal that the EDT has worse performance than the linkage tree genetic algorithm (LTGA), which is one of the state-of-the-art model-based evolutionary algorithms, for decomposable problems and also that the difference in the performance between them becomes smaller for problems with overlaps among linkages and also that the EDT has better performance than the LTGA for problems whose structures are hard to identify. Those results suggest that an appropriate search strategy is different between decomposable problems and those hard to decompose.


2021 ◽  
pp. 1-17
Author(s):  
Yin Liu ◽  
Kunpeng Li ◽  
Shuo Wang ◽  
Peng Cui ◽  
Xueguan Song ◽  
...  

Abstract Multi-fidelity surrogate model-based engineering optimization has received much attention because it alleviates the computational burdens of expensive simulations or experiments. However, due to the nonlinearity of practical engineering problems, the initial sample set selected to produce the first set of data will almost inevitably miss certain features of the landscape, and thus the construction of a useful surrogate often requires further, judicious infilling of some new samples. Sequential sampling strategies used to select new infilling sample during each iteration can gradually extend the dataset and improve the accuracy of the initial model with an acceptable cost. In this paper, a sequential sampling generation method based on the Voronoi region and the sample density, terms as SSGM-VRDS, is proposed. First, with a Monte Carlo-based approximation of a Voronoi tessellation for region division, Pearson correlation coefficients and cross validation (CV) are employed to determine the candidate Voronoi region for infilling a new sample. Then, a relative sample density is defined to identify the position of the new infilling point at which the sample are the sparsest within the selected Voronoi region. A correction of this density is carried out concurrently through an expansion coefficient. The proposed method is applied to three numerical numerical functions and a lightweight design problem via finite element analysis (FEA). Results suggest that the SSGM-VRDS strategy has outstanding effectiveness and efficiency in selecting a new sample for improving the accuracy of a surrogate model, as well as practicality for solving practical optimization problems.


2004 ◽  
Vol 21 (02) ◽  
pp. 225-240 ◽  
Author(s):  
RUHUL SARKER ◽  
HUSSEIN A. ABBASS

The use of evolutionary strategies (ESs) to solve problems with multiple objectives [known as vector optimization problems (VOPs)] has attracted much attention recently. Being population-based approaches, ESs offer a means to find a set of Pareto-optimal solutions in a single run. Differential evolution (DE) is an ES that was developed to handle optimization problems over continuous domains. The objective of this paper is to introduce a novel Pareto-frontier differential evolution (PDE) algorithm to solve VOPs. The solutions provided by the proposed algorithm for two standard test problems, outperform the "strength Pareto evolutionary algorithm", one of the state-of-the-art evolutionary algorithm for solving VOPs.


Sign in / Sign up

Export Citation Format

Share Document