A multi-objective framework for Pareto frontier exploration of lattice structures

被引:0
|
作者
De Weer, Tom [1 ,2 ]
Lammens, Nicolas [1 ]
Meerbergen, Karl [2 ,3 ]
机构
[1] Siemens Ind Software NV, Interleuvenlaan 68, B-3001 Leuven, Belgium
[2] Katholieke Univ Leuven, Dept Comp Sci, Celestijnenlaan 200A, B-3000 Leuven, Belgium
[3] KU Leuven Inst, Leuven AI, B-3000 Leuven, Belgium
关键词
Lattice structures; Pareto frontier; Multi-scale topology optimisation; Metamaterials; TOPOLOGY OPTIMIZATION; OPTIMAL BOUNDS; OPTIMAL-DESIGN; HOMOGENIZATION; ALGORITHM;
D O I
10.1007/s00158-023-03562-4
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
Multi-scale topology optimisation has received renewed research interest in the last decade due to the potential for increased mechanical performance and improved additive manufacturing capabilities. Most multi-scale routines rely on homogenization to bridge the scale difference, simulate part performance and eventually drive it towards an optimum. Key to macroscale performance is the search for optimal metamaterials. In this work, a multi-objective framework is proposed to reformulate this classical problem, which is to the authors' knowledge the first work to do so. The use of multiple objectives implies that the underlying structure of the optimal metamaterial performance space is a Pareto frontier: a manifold of solutions which cannot be improved upon without compromising on either stiffness or weight. The proposed framework is applied to a lattice unit cell and the map between the optimal design and performance space, through the so-called compromise space, is studied numerically. Deficiencies that cause a collapse of the Pareto frontier are resolved and the effect of design constraints is examined. In the end, it is shown that a 14-dimensional compromise space is capable of accurately capturing every Pareto-optimal performance while also ensuring a bijective map to the design space. Therefore, these properties make this lattice material model an attractive target for usage inside multi-scale routines.
引用
收藏
页数:19
相关论文
共 50 条
  • [41] Pareto Artificial Life Algorithm for Multi-Objective Optimization
    Song, Jin-Dae
    Yang, Bo-Suk
    [J]. JOURNAL OF INFORMATION TECHNOLOGY RESEARCH, 2011, 4 (02) : 43 - 60
  • [42] A multi-objective selection procedure of determining a Pareto set
    Chen, E. Jack
    Lee, Lod Hay
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (06) : 1872 - 1879
  • [43] Pareto-based multi-objective differential evolution
    Xue, F
    Sanderson, AC
    Graves, RJ
    [J]. CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS, 2003, : 862 - 869
  • [44] Path relinking in Pareto multi-objective genetic algorithms
    Basseur, M
    Seynhaeve, F
    Talbi, EC
    [J]. EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, 2005, 3410 : 120 - 134
  • [45] Representation of the pareto front for heterogeneous multi-objective optimization
    Thomann, Jana
    Eichfelder, Gabriele
    [J]. Journal of Applied and Numerical Optimization, 2019, 1 (03): : 293 - 323
  • [46] PHANTOM PARETO SYSTEMS FOR MULTI-OBJECTIVE RANKING AND SELECTION
    Applegate, Eric A.
    Hunter, Susan R.
    Feldman, Guy
    Pasupathy, Raghu
    [J]. 2017 WINTER SIMULATION CONFERENCE (WSC), 2017, : 4576 - 4577
  • [47] Scored Pareto-MEC for multi-objective optimzation
    Sun, CY
    Wang, LZ
    Gao, XZ
    [J]. SMCIA/05: PROCEEDINGS OF THE 2005 IEEE MID-SUMMER WORKSHOP ON SOFT COMPUTING IN INDUSTRIAL APPLICATIONS, 2005, : 105 - 110
  • [48] Pareto-curve continuation in multi-objective optimization
    Schmidt, Stephan
    Schulz, Volker
    [J]. PACIFIC JOURNAL OF OPTIMIZATION, 2008, 4 (02): : 243 - 258
  • [49] A review of Pareto pruning methods for multi-objective optimization
    Petchrompo, Sanyapong
    Coit, David W.
    Brintrup, Alexandra
    Wannakrairot, Anupong
    Parlikad, Ajith Kumar
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 167
  • [50] Pareto optimization to accelerate multi-objective virtual screening
    Fromer, Jenna C.
    Graff, David E.
    Coley, Connor W.
    [J]. DIGITAL DISCOVERY, 2024, 3 (03): : 467 - 481