Nivesh Dommaraju, M. Bujny, S. Menzel, M. Olhofer, F. Duddeck
{"title":"Cooperative Multi-objective Topology Optimization Using Clustering and Metamodeling","authors":"Nivesh Dommaraju, M. Bujny, S. Menzel, M. Olhofer, F. Duddeck","doi":"10.1109/CEC55065.2022.9870326","DOIUrl":null,"url":null,"abstract":"Topology optimization optimizes material layout in a design space for a given objective, such as crash energy absorption, and a set of boundary conditions. In industrial applications, multi-objective topology optimization requires expensive simulations to evaluate the objectives and generate multiple Pareto-optimal solutions. So, it is more economical to identify preferred regions on the Pareto front and generate only the desired solutions. Clustering methods, a widely used subclass of machine learning methods, provide an unsupervised approach to summarize the dataset, which eases the identification of the preferred set of designs. However, generating solutions similar to the preferred designs based on different metrics is a challenging task. In this paper, we present an interactive method to generate designs similar to a preferred set using one of the state-of-the-art weighted-sum approaches called scaled energy weighting - hybrid cellular automata (SEW-HCA). To avoid unnecessary computations, metamodels are used to predict the desired weight vectors needed by SEW-HCA. We evaluate an application of our method for cooperative topology optimization using a cantilever multi-load-case problem and a crashworthiness optimization problem. Using the proposed method, we could successfully generate designs that are similar to preferred solutions based on geometry and performance. We believe that this is a crucial component that will improve the usefulness of multi-objective topology optimization in real-world applications.","PeriodicalId":153241,"journal":{"name":"2022 IEEE Congress on Evolutionary Computation (CEC)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE Congress on Evolutionary Computation (CEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CEC55065.2022.9870326","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
Topology optimization optimizes material layout in a design space for a given objective, such as crash energy absorption, and a set of boundary conditions. In industrial applications, multi-objective topology optimization requires expensive simulations to evaluate the objectives and generate multiple Pareto-optimal solutions. So, it is more economical to identify preferred regions on the Pareto front and generate only the desired solutions. Clustering methods, a widely used subclass of machine learning methods, provide an unsupervised approach to summarize the dataset, which eases the identification of the preferred set of designs. However, generating solutions similar to the preferred designs based on different metrics is a challenging task. In this paper, we present an interactive method to generate designs similar to a preferred set using one of the state-of-the-art weighted-sum approaches called scaled energy weighting - hybrid cellular automata (SEW-HCA). To avoid unnecessary computations, metamodels are used to predict the desired weight vectors needed by SEW-HCA. We evaluate an application of our method for cooperative topology optimization using a cantilever multi-load-case problem and a crashworthiness optimization problem. Using the proposed method, we could successfully generate designs that are similar to preferred solutions based on geometry and performance. We believe that this is a crucial component that will improve the usefulness of multi-objective topology optimization in real-world applications.