2019
DOI: 10.1109/tevc.2018.2869001
|View full text |Cite
|
Sign up to set email alerts
|

Data-Driven Evolutionary Optimization: An Overview and Case Studies

Abstract: Most evolutionary optimization algorithms assume that the evaluation of the objective and constraint functions is straightforward. In solving many real-world optimization problems, however, such objective functions may not exist. Instead, computationally expensive numerical simulations or costly physical experiments must be performed for fitness evaluations. In more extreme cases, only historical data are available for performing optimization and no new data can be generated during optimization. Solving evolut… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
144
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3

Relationship

5
3

Authors

Journals

citations
Cited by 463 publications
(170 citation statements)
references
References 108 publications
0
144
0
Order By: Relevance
“…Hence, the main difficulty is to ensure the convergence of the obtained solution set. 1 We do not give the result of DDMOP7 as the number of the obtained non-dominated solutions is too small, and it is meaningless to display the result. DDMOP2, DDMOP3, and DDMOP5 are problems with three objectives.…”
Section: General Shape Of the Approximate Pareto Frontmentioning
confidence: 98%
See 2 more Smart Citations
“…Hence, the main difficulty is to ensure the convergence of the obtained solution set. 1 We do not give the result of DDMOP7 as the number of the obtained non-dominated solutions is too small, and it is meaningless to display the result. DDMOP2, DDMOP3, and DDMOP5 are problems with three objectives.…”
Section: General Shape Of the Approximate Pareto Frontmentioning
confidence: 98%
“…solutions are used to approximate the POFs. 1 Note that we do not give the objective values of the obtained solutions, since we cannot ensure the obtained solutions are exactly on the POFs due to the computationally expensive cost of the real function evaluations. For DDMOP1 in Fig.…”
Section: General Shape Of the Approximate Pareto Frontmentioning
confidence: 99%
See 1 more Smart Citation
“…For example, each evaluation of the objective functions in evolutionary optimization of the neural networks requires the training of the model, which can be computationally intensive if the amount of data is large. To address this issue, surrogateassisted evolutionary optimization [29], [30] or Bayesian optimization [31] are helpful to reduce the computation cost.…”
Section: )mentioning
confidence: 99%
“…Off-line data-driven optimization problems widely exist in the real world [11], [36], such as trauma systems design [6], performance optimization of fused magnesium furnaces [7], and operational indices optimization of beneficiation processes [8], in which the objective functions cannot be directly calculated using mathematical equations and only data are available for fitness evaluations [11], [36]. Off-line data-driven optimization starts with a certain amount of collected data, which are used to construct surrogates for searching optimal solutions [9].…”
Section: Related Work a Off-line Data-driven Optimization Problemsmentioning
confidence: 99%