Hierarchical remeshing strategies with mesh mapping for topology optimisation

This work investigates the use of hierarchical mesh decomposition strategies for topology optimisation using bi-directional evolutionary structural optimisation algorithm. The proposed method uses a dual mesh system that decouples the design variables from the finite element analysis mesh. The inves...

Full description

Bibliographic Details
Main Authors: Panesar, Ajit, Brackett, David, Ashcroft, Ian, Wildman, Ricky D., Hague, Richard
Format: Article
Published: Wiley 2017
Online Access:https://eprints.nottingham.ac.uk/40456/
_version_ 1848796061436477440
author Panesar, Ajit
Brackett, David
Ashcroft, Ian
Wildman, Ricky D.
Hague, Richard
author_facet Panesar, Ajit
Brackett, David
Ashcroft, Ian
Wildman, Ricky D.
Hague, Richard
author_sort Panesar, Ajit
building Nottingham Research Data Repository
collection Online Access
description This work investigates the use of hierarchical mesh decomposition strategies for topology optimisation using bi-directional evolutionary structural optimisation algorithm. The proposed method uses a dual mesh system that decouples the design variables from the finite element analysis mesh. The investigation focuses on previously unexplored areas of these techniques to investigate the effect of five meshing parameters on the analysis solving time (i.e. computational effort) and the analysis quality (i.e. solution optimality). The foreground mesh parameters, including adjacency ratio and minimum and maximum element size, were varied independently across solid and void domain regions. Within the topology optimisation, strategies for controlling the mesh parameters were investigated. The differing effects of these parameters on the efficiency and efficacy of the analysis and optimisation stages are discussed, and recommendations are made for parameter combinations. Some of the key findings were that increasing the adjacency ratio increased the efficiency only modestly – the largest effect was for the minimum and maximum element size parameters – and that the most dramatic reduction in solve time can be achieved by not setting the minimum element size too low, assuming mapping onto a background mesh with a minimum element size of 1.
first_indexed 2025-11-14T19:42:00Z
format Article
id nottingham-40456
institution University of Nottingham Malaysia Campus
institution_category Local University
last_indexed 2025-11-14T19:42:00Z
publishDate 2017
publisher Wiley
recordtype eprints
repository_type Digital Repository
spelling nottingham-404562020-05-04T18:35:50Z https://eprints.nottingham.ac.uk/40456/ Hierarchical remeshing strategies with mesh mapping for topology optimisation Panesar, Ajit Brackett, David Ashcroft, Ian Wildman, Ricky D. Hague, Richard This work investigates the use of hierarchical mesh decomposition strategies for topology optimisation using bi-directional evolutionary structural optimisation algorithm. The proposed method uses a dual mesh system that decouples the design variables from the finite element analysis mesh. The investigation focuses on previously unexplored areas of these techniques to investigate the effect of five meshing parameters on the analysis solving time (i.e. computational effort) and the analysis quality (i.e. solution optimality). The foreground mesh parameters, including adjacency ratio and minimum and maximum element size, were varied independently across solid and void domain regions. Within the topology optimisation, strategies for controlling the mesh parameters were investigated. The differing effects of these parameters on the efficiency and efficacy of the analysis and optimisation stages are discussed, and recommendations are made for parameter combinations. Some of the key findings were that increasing the adjacency ratio increased the efficiency only modestly – the largest effect was for the minimum and maximum element size parameters – and that the most dramatic reduction in solve time can be achieved by not setting the minimum element size too low, assuming mapping onto a background mesh with a minimum element size of 1. Wiley 2017-02-07 Article PeerReviewed Panesar, Ajit, Brackett, David, Ashcroft, Ian, Wildman, Ricky D. and Hague, Richard (2017) Hierarchical remeshing strategies with mesh mapping for topology optimisation. International Journal for Numerical Methods in Engineering . ISSN 1097-0207 http://onlinelibrary.wiley.com/doi/10.1002/nme.5488/abstract doi:10.1002/nme.5488 doi:10.1002/nme.5488
spellingShingle Panesar, Ajit
Brackett, David
Ashcroft, Ian
Wildman, Ricky D.
Hague, Richard
Hierarchical remeshing strategies with mesh mapping for topology optimisation
title Hierarchical remeshing strategies with mesh mapping for topology optimisation
title_full Hierarchical remeshing strategies with mesh mapping for topology optimisation
title_fullStr Hierarchical remeshing strategies with mesh mapping for topology optimisation
title_full_unstemmed Hierarchical remeshing strategies with mesh mapping for topology optimisation
title_short Hierarchical remeshing strategies with mesh mapping for topology optimisation
title_sort hierarchical remeshing strategies with mesh mapping for topology optimisation
url https://eprints.nottingham.ac.uk/40456/
https://eprints.nottingham.ac.uk/40456/
https://eprints.nottingham.ac.uk/40456/