Loading…
Multi-objective topology optimization incorporating an adaptive weighed-sum method and a configuration-based clustering scheme
A novel multi-objective topology optimization method is developed by simultaneously considering the diversity and uniformity of the optimum solutions in the objective and design variable spaces. To guarantee the diversity of the solutions, a configuration-based clustering scheme is developed and app...
Saved in:
Published in: | Computer methods in applied mechanics and engineering 2021-11, Vol.385, p.114015, Article 114015 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | A novel multi-objective topology optimization method is developed by simultaneously considering the diversity and uniformity of the optimum solutions in the objective and design variable spaces. To guarantee the diversity of the solutions, a configuration-based clustering scheme is developed and applied to avoid similar designs. By clustering Pareto optimal designs during the optimization process, the searching region in the objective space is gradually reduced, and the time cost required for optimization can be decreased. Additionally, the uniformity of the solutions in the objective space is considered using an adaptive weight determination scheme. The results of the benchmark problems confirm that using the proposed method could reduce the time cost. Furthermore, the overall Pareto front and configuration of different designs are also explored.
•Weights are systematically determined to obtain evenly distributed optimum solutions.•Reference point-based compromise programming is employed in the non-convex region of the Pareto front.•Clustering scheme is proposed to distinguish the Pareto optimal designs.•Adaptive weighted-sum and configuration-based clustering are incorporated in the optimization process.•The Pareto front can be explored while reducing the optimization process time cost. |
---|---|
ISSN: | 0045-7825 1879-2138 |
DOI: | 10.1016/j.cma.2021.114015 |