2018
DOI: 10.1007/s00158-018-2079-z
|View full text |Cite
|
Sign up to set email alerts
|

Multi-surrogate-based global optimization using a score-based infill criterion

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
7
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 36 publications
(9 citation statements)
references
References 47 publications
0
7
0
Order By: Relevance
“…Selecting infill points requires information about model outputs and is generally more complex than space filling methods, such as maximin LHS, that only consider model inputs. There are a number of recent output-oriented adaptive design methods that can iteratively develop informative infill points as an optimization algorithm proceeds (Dong et al, 2019;Liu et al, 2018;Mo et al, 2017). In fact, many of these techniques choose new samples using a score function that involves a local exploitation term and a global exploration term (Liu et al, 2018), a concept that is central to the operation of the PSO algorithm itself.…”
Section: Adaptive Resampling Via Swarm Intelligencementioning
confidence: 99%
“…Selecting infill points requires information about model outputs and is generally more complex than space filling methods, such as maximin LHS, that only consider model inputs. There are a number of recent output-oriented adaptive design methods that can iteratively develop informative infill points as an optimization algorithm proceeds (Dong et al, 2019;Liu et al, 2018;Mo et al, 2017). In fact, many of these techniques choose new samples using a score function that involves a local exploitation term and a global exploration term (Liu et al, 2018), a concept that is central to the operation of the PSO algorithm itself.…”
Section: Adaptive Resampling Via Swarm Intelligencementioning
confidence: 99%
“…Unlike the direct and bi‐univocal relation between the value of the ECMS equivalent factor and the value of SOC reached at the cycle final time, 39 the relation between λ C and the final SOC is a computation‐intensive, black‐box problem. Recently, advanced meta‐model based global optimization algorithm has been found as an effective tool to solve this type of problems 36,41,42 . The multi‐start space reduction (MSSR) global optimization algorithm 43 replaces the shooting method to find the optimal cost equivalent factor minimizing the SOC difference value between the initial SOC and final SOC : min:ΔSOC=||SOCfinalSOCinit, …”
Section: Optimal Energy Management Strategy Solutionmentioning
confidence: 99%
“…Moreover, when pointwise EMs are applied to engineering design optimization, the computational cost dramatically increases, because a large number of predictions using surrogates are required. In addition to using EMs, some researchers have developed optimization algorithms based on multi‐surrogates, where new samples are selected according to their predictive values from these multiple metamodels 22–24 …”
Section: Introductionmentioning
confidence: 99%