|
Digital
Library of the European Council for Modelling and Simulation |
Title: |
Algorithms for
Simulation-Based Optimization Problems |
Authors: |
Thomas
Baeck |
Published in: |
(2018). ECMS 2018
Proceedings Edited by: Lars Nolle, Alexandra
Burger, Christoph Tholen,
Jens Werner, Jens Wellhausen European Council for
Modeling and Simulation. doi:
10.7148/2018-0005 ISSN:
2522-2422 (ONLINE) ISSN:
2522-2414 (PRINT) ISSN:
2522-2430 (CD-ROM) 32nd European Conference on Modelling and Simulation, Wilhelmshaven, Germany, May 22nd
– May 265h, 2018 |
Citation
format: |
Thomas
Baeck (2018). Algorithms for Simulation-Based
Optimization Problems, ECMS 2018 Proceedings Edited by: Lars Nolle, Alexandra Burger, Christoph
Tholen, Jens Werner, Jens Wellhausen
European Council for Modeling and Simulation. doi: 10.7148/2018-0005 |
DOI: |
https://doi.org/10.7148/2018-0005 |
Abstract: |
Many
industries use simulation tools for virtual product design, and there is a
growing trend towards using simulation in combination with optimization
algorithms for tuning simulation input parameters. The requirements for
optimization under such circumstances are often very strong, involving many
design variables and constraints and a strict limitation of the number of
function evaluations to a surprisingly small number (often around one
thousand or less). Tuning
optimization algorithms for such challenges has led to very good results
obtained by variants of evolution strategies and of Bayesian optimization
algorithms. Evolutionary algorithms are nowadays standard
solvers for such applications. In the presentation, sample cases from
industry are presented, and their challenges are discussed in more detail.
Results of an experimental comparison of contemporary evolution strategies
[1] on the black box optimization benchmark (BBOB) test function set for a
small number of function evaluations are discussed, and further enhancements
of contemporary evolution strategies are outlined. In addition, we will also
briefly discuss the concept of Bayesian global optimization [2] and its
connection with research in evolutionary strategies, motivated by a generalized
infill criterion [3]. The corresponding algorithms typically combine
so-called metamodels (i.e., data- driven nonlinear
regression models using Gaussian process or random forests for regression)
with state-of-the-art optimization algorithms for the identification of new
sampling points, based on the above mentioned infill
criterion. Essentially, the latter is also again a multimodal objective
function defined over the metamodel, which in turn
requires an optimizer to solve the optimization problem defined by the infill
criterion. Our
practical examples are motivated by industrial applications. A typical
challenge is to find innovative solutions to a design optimization task.
Based on a suitable optimization algorithm, which often also needs to deal
with multiple, conflicting objectives, an application of this concept to an
industrial design optimization task is discussed in the presentation. Discussing
these applications and the variants of evolution strategies applied, the
capabilities of these algorithms for optimization cases with a small number
of function evaluations are illustrated. |
Full
text: |