.png){kind=icon}
返回
Topology optimization of binary structures using Integer Linear Programming
.png){kind=icon}
PRE
AI
DOI：10.1016/j.finel.2017.10.006.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This work proposes an improved method for gradient-based topology optimization in a discrete setting of design variables. The method combines the features of BESO developed by Huang and Xie [1] and the discrete topology optimization method of Svanberg and Werme [2] to improve the effectiveness of binary variable optimization. Herein the objective and constraint functions are sequentially linearized using Taylor's first order approximation, similarly as carried out in [2]. Integer Linear Programming (ILP) is used to compute globally optimal solutions for these linear optimization problems, allowing the method to accommodate any type of constraints explicitly, without the need for any Lagrange multipliers or thresholds for sensitivities (like the modern BESO [1]), or heuristics (like the early ESO/BESO methods [3]). In the linearized problems, the constraint targets are relaxed so as to allow only small changes in topology during an update and to ensure the existence of feasible solutions for the ILP. This process of relaxing the constraints and updating the design variables by using ILP is repeated until convergence. The proposed method does not require any gradual refinement of mesh, unlike in [2] and the sensitivities every iteration are smoothened by using the mesh-independent BESO filter. Few examples of compliance minimization are shown to demonstrate that mathematical programming yields similar results as that of BESO for volume-constrained problems. Some examples of volume minimization subject to a compliance constraint are presented to demonstrate the effectiveness of the method in dealing with a non-volume constraint. Volume minimization with a compliance constraint in the case of design-dependent fluid pressure loading is also presented using the proposed method. An example is presented to show the effectiveness of the method in dealing with displacement constraints. The results signify that the method can be used for topology optimization problems involving non-volume constraints without the use of heuristics, Lagrange multipliers and hierarchical mesh refinement.
Keyword:
Topology optimization
Integer Linear Programming
Relaxation
Filter
Truncation error
Compliance
Displacement constraint
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.5
论文数:
2.6K
被引数:
5.1K
机构
引用论文
Introducing the sequential linear programming level-set method for topology optimization引入用于拓扑优化的顺序线性规划水平集方法
OAAI
OAAI分享收藏Stiffness design of geometrically nonlinear structures using topology optimization基于拓扑优化的几何非线性结构刚度设计
PREAI
分享收藏分享收藏An immersed boundary approach for shape and topology optimization of stationary fluid-structure interaction problems用于固定流体-结构相互作用问题的形状和拓扑优化的浸入边界方法
PREAI
分享收藏Convergent and mesh-independent solutions for the bi-directional evolutionary structural optimization method双向进化结构优化方法的收敛和网格无关解
PREAI
分享收藏Evolutionary topology optimization of continuum structures with an additional displacement constraint具有附加位移约束的连续体结构的进化拓扑优化
PREAI
分享收藏SURF: A connectivity-based space filling curve construction algorithm in high genus 3D surface WSNsSURF: 一种基于连通性的高属三维曲面WSNs空间填充曲线构建算法
PREAI
分享收藏Sequential integer programming methods for stress constrained topology optimization应力约束拓扑优化的序列整数规划方法
PREAI
分享收藏Concurrent topological design of composite thermoelastic macrostructure and microstructure with multi-phase material for maximum stiffness具有多相材料的复合热弹性宏观结构和微观结构的并行拓扑设计，以实现最大刚度.png)
COMPOSITE STRUCTURES
COMPOSITE STRUCTURESIF7.1
PREAI
分享收藏
查看更多内容