A surrogate assisted adaptive framework for robust topology optimization

Souvik Chakraborty, Somdatta Goswami, Timon Rabczuk

Research output: Contribution to journalArticle

Abstract

This paper presents a novel approach for robust topology optimization (RTO). The proposed approach integrates the hybrid polynomial correlated function expansion (H-PCFE) with the deterministic topology optimization (DTO) algorithm, where H-PCFE is used for computing the moments associated with the objective function in robust design optimization (RDO). It is argued that re-training the H-PCFE model at every iteration will make the overall algorithm computationally expensive and time-consuming. To alleviate this issue, an adaptive algorithm is proposed that automatically decides whether to retrain the H-PCFE model or to use the available H-PCFE model. Since RTO involves a large number of design variables, we also argue that, from a computational point of view, gradient-based optimization algorithms are better suited over gradient-free optimization techniques. However, the bottleneck of using gradient-based optimization algorithms is associated with the computation of the gradients. To address this issue, we propose a procedure for computing the gradients of the objective function in RTO. The proposed approach is highly flexible and can be integrated with the already available DTO codes from literature. To illustrate the performance of the proposed approach, three well-known benchmark problems have been solved; two of them being on the 2D MBB beam and one more on a 3D cantilever beam. As compared to the results of the DTO, RTO yields conservative results which are visible from the additional limbs appearing in the optimized topology of the structure. Furthermore, to justify the use of H-PCFE as a surrogate within the proposed framework, a comparative assessment of the proposed approach against the popular surrogate models has also been presented. It is observed that H-PCFE outperforms other popular surrogate models such as Kriging, radial basis function and polynomial chaos expansion, in both accuracy and efficiency.

LanguageEnglish
Pages63-84
Number of pages22
JournalComputer Methods in Applied Mechanics and Engineering
Volume346
DOIs
Publication statusPublished - 2019 Apr 1

Fingerprint

Shape optimization
topology
polynomials
optimization
Polynomials
expansion
gradients
kriging
cantilever beams
design optimization
Cantilever beams
Adaptive algorithms
limbs
Chaos theory
iteration
chaos
education
Topology
moments

Keywords

  • H-PCFE
  • RDO
  • Topology optimization
  • Uncertainty

ASJC Scopus subject areas

  • Computational Mechanics
  • Mechanics of Materials
  • Mechanical Engineering
  • Physics and Astronomy(all)
  • Computer Science Applications

Cite this

A surrogate assisted adaptive framework for robust topology optimization. / Chakraborty, Souvik; Goswami, Somdatta; Rabczuk, Timon.

In: Computer Methods in Applied Mechanics and Engineering, Vol. 346, 01.04.2019, p. 63-84.

Research output: Contribution to journalArticle

Chakraborty, Souvik ; Goswami, Somdatta ; Rabczuk, Timon. / A surrogate assisted adaptive framework for robust topology optimization. In: Computer Methods in Applied Mechanics and Engineering. 2019 ; Vol. 346. pp. 63-84.
@article{59ad886b0a3b4c5dbec15f529c808ddb,
title = "A surrogate assisted adaptive framework for robust topology optimization",
abstract = "This paper presents a novel approach for robust topology optimization (RTO). The proposed approach integrates the hybrid polynomial correlated function expansion (H-PCFE) with the deterministic topology optimization (DTO) algorithm, where H-PCFE is used for computing the moments associated with the objective function in robust design optimization (RDO). It is argued that re-training the H-PCFE model at every iteration will make the overall algorithm computationally expensive and time-consuming. To alleviate this issue, an adaptive algorithm is proposed that automatically decides whether to retrain the H-PCFE model or to use the available H-PCFE model. Since RTO involves a large number of design variables, we also argue that, from a computational point of view, gradient-based optimization algorithms are better suited over gradient-free optimization techniques. However, the bottleneck of using gradient-based optimization algorithms is associated with the computation of the gradients. To address this issue, we propose a procedure for computing the gradients of the objective function in RTO. The proposed approach is highly flexible and can be integrated with the already available DTO codes from literature. To illustrate the performance of the proposed approach, three well-known benchmark problems have been solved; two of them being on the 2D MBB beam and one more on a 3D cantilever beam. As compared to the results of the DTO, RTO yields conservative results which are visible from the additional limbs appearing in the optimized topology of the structure. Furthermore, to justify the use of H-PCFE as a surrogate within the proposed framework, a comparative assessment of the proposed approach against the popular surrogate models has also been presented. It is observed that H-PCFE outperforms other popular surrogate models such as Kriging, radial basis function and polynomial chaos expansion, in both accuracy and efficiency.",
keywords = "H-PCFE, RDO, Topology optimization, Uncertainty",
author = "Souvik Chakraborty and Somdatta Goswami and Timon Rabczuk",
year = "2019",
month = "4",
day = "1",
doi = "10.1016/j.cma.2018.11.030",
language = "English",
volume = "346",
pages = "63--84",
journal = "Computer Methods in Applied Mechanics and Engineering",
issn = "0045-7825",
publisher = "Elsevier",

}

TY - JOUR

T1 - A surrogate assisted adaptive framework for robust topology optimization

AU - Chakraborty, Souvik

AU - Goswami, Somdatta

AU - Rabczuk, Timon

PY - 2019/4/1

Y1 - 2019/4/1

N2 - This paper presents a novel approach for robust topology optimization (RTO). The proposed approach integrates the hybrid polynomial correlated function expansion (H-PCFE) with the deterministic topology optimization (DTO) algorithm, where H-PCFE is used for computing the moments associated with the objective function in robust design optimization (RDO). It is argued that re-training the H-PCFE model at every iteration will make the overall algorithm computationally expensive and time-consuming. To alleviate this issue, an adaptive algorithm is proposed that automatically decides whether to retrain the H-PCFE model or to use the available H-PCFE model. Since RTO involves a large number of design variables, we also argue that, from a computational point of view, gradient-based optimization algorithms are better suited over gradient-free optimization techniques. However, the bottleneck of using gradient-based optimization algorithms is associated with the computation of the gradients. To address this issue, we propose a procedure for computing the gradients of the objective function in RTO. The proposed approach is highly flexible and can be integrated with the already available DTO codes from literature. To illustrate the performance of the proposed approach, three well-known benchmark problems have been solved; two of them being on the 2D MBB beam and one more on a 3D cantilever beam. As compared to the results of the DTO, RTO yields conservative results which are visible from the additional limbs appearing in the optimized topology of the structure. Furthermore, to justify the use of H-PCFE as a surrogate within the proposed framework, a comparative assessment of the proposed approach against the popular surrogate models has also been presented. It is observed that H-PCFE outperforms other popular surrogate models such as Kriging, radial basis function and polynomial chaos expansion, in both accuracy and efficiency.

AB - This paper presents a novel approach for robust topology optimization (RTO). The proposed approach integrates the hybrid polynomial correlated function expansion (H-PCFE) with the deterministic topology optimization (DTO) algorithm, where H-PCFE is used for computing the moments associated with the objective function in robust design optimization (RDO). It is argued that re-training the H-PCFE model at every iteration will make the overall algorithm computationally expensive and time-consuming. To alleviate this issue, an adaptive algorithm is proposed that automatically decides whether to retrain the H-PCFE model or to use the available H-PCFE model. Since RTO involves a large number of design variables, we also argue that, from a computational point of view, gradient-based optimization algorithms are better suited over gradient-free optimization techniques. However, the bottleneck of using gradient-based optimization algorithms is associated with the computation of the gradients. To address this issue, we propose a procedure for computing the gradients of the objective function in RTO. The proposed approach is highly flexible and can be integrated with the already available DTO codes from literature. To illustrate the performance of the proposed approach, three well-known benchmark problems have been solved; two of them being on the 2D MBB beam and one more on a 3D cantilever beam. As compared to the results of the DTO, RTO yields conservative results which are visible from the additional limbs appearing in the optimized topology of the structure. Furthermore, to justify the use of H-PCFE as a surrogate within the proposed framework, a comparative assessment of the proposed approach against the popular surrogate models has also been presented. It is observed that H-PCFE outperforms other popular surrogate models such as Kriging, radial basis function and polynomial chaos expansion, in both accuracy and efficiency.

KW - H-PCFE

KW - RDO

KW - Topology optimization

KW - Uncertainty

UR - http://www.scopus.com/inward/record.url?scp=85058575832&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85058575832&partnerID=8YFLogxK

U2 - 10.1016/j.cma.2018.11.030

DO - 10.1016/j.cma.2018.11.030

M3 - Article

VL - 346

SP - 63

EP - 84

JO - Computer Methods in Applied Mechanics and Engineering

T2 - Computer Methods in Applied Mechanics and Engineering

JF - Computer Methods in Applied Mechanics and Engineering

SN - 0045-7825

ER -