Computational & Technology Resources
an online resource for computational,
engineering & technology publications |
|
Civil-Comp Conferences
ISSN 2753-3239 CCC: 2
PROCEEDINGS OF THE ELEVENTH INTERNATIONAL CONFERENCE ON ENGINEERING COMPUTATIONAL TECHNOLOGY Edited by: B.H.V. Topping and P. Iványi
Paper 4.7
Derivative-free Topology Optimisation via Explicit Level Set Parameterisation and Trust Region Strategy Optimiser E. K. Bontoft1, Y. Zhang1,2, D. Jia12, R. Dubrovka1 and V.
Toropov1
1School of Engineering and Material Science, Queen Mary University of
London, London, United Kingdom E. K. Bontoft, Y. Zhang, D. Jia, R. Dubrovka , V.
Toropov, "Derivative-free Topology Optimisation via
Explicit Level Set Parameterisation and Trust
Region Strategy Optimiser", in B.H.V. Topping, P. Iványi, (Editors), "Proceedings of the Eleventh International Conference on Engineering Computational Technology", Civil-Comp Press, Edinburgh, UK,
Online volume: CCC 2, Paper 4.7, 2022, doi:10.4203/ccc.2.4.7
Keywords: topology optimisation, explicit level set, derivative-free, trust region
strategy, design of experiments, kriging.
Abstract
This work investigates the use of explicit level set parameterisation for topology
optimisation using a metamodel-based trust region strategy optimiser. The explicit
level set parameterisation consists of building a uniform Design of Experiments using
a Permutation Genetic Algorithm, followed by building the Level Set Function using
Kriging. Through decoupling the parameterisation from the simulation physics, the
use of sensitivity data becomes optional thus enabling computationally complex
disciplines (where sensitivity data is not available, e.g. crashworthiness,
electromagnetics) to be included. This is achieved through the use of a sequence of
approximations to the functions of the original optimisation problems based on a trust
region strategy. The method is demonstrated on a benchmark 2D topology
optimisation problem to examine the effectiveness of the technique.
download the full-text of this paper (PDF, 7 pages, 366 Kb)
go to the previous paper |
|