首页|求解多约束离散变量结构拓扑优化的序列保守近似整数规划算法

求解多约束离散变量结构拓扑优化的序列保守近似整数规划算法

扫码查看
原文链接
  • 万方数据
  • 维普
序列近似整数规划方法通过求解一系列可分离的近似整数规划子问题成功求解多类大规模拓扑优化问题。然而，这些近似子问题的解析求解依靠正则松弛算法，正则松弛算法要求子问题必须由二次或线性的目标函数以及线性的约束函数构成。同时，序列近似整数规划方法依赖于体分比下降策略，这使得其难以处理不包含体分比约束的拓扑优化问题。为进一步地完善序列近似整数规划算法，我们受移动渐近线方法的启发，引入经典的序列保守近似规划，以获得一系列可行性稳步提升的设计，这个新方法称作序列保守近似整数规划算法。新方法会产生一系列包含倒数设计变量的非线性的近似整数规划子问题，并通过调整渐近线控制子问题的保守性。由于正则松弛算法不能求解非线性子问题，一种基于KKT(Karush-Kuhn-Tucker)条件的简单的设计变量更新准则被给出。基于上述思想，序列保守近似整数规划算法不依靠体分比约束等线性约束就可以获得稳定的优化过程，由此可以用来求解复杂的离散变量拓扑优化问题。多类不同需求的拓扑优化问题被解决，包括考虑等式约束及非等式约束的、以及考虑有效的及无效的体分比约束的问题。数值结果证明，由于保守性的引入，整个优化收敛进程可以自适应地调节无需额外的结构分析。
Sequential conservative integer programming method for multi-constrained discrete variable structure topology optimization
The sequential approximate integer programming(SAIP)method successfully solves multiple types of large-scale topology optimization problems by solving a sequence of separable approximate integer programming subproblems.However,these subproblems must be with quadratic/linear objective function with linear constraints that can be analytically solved by the canonical relaxation algorithm(CRA).Besides,SAIP relies on the decreasing volume fraction strategy so that it owns difficulties to confront topology optimization problems without active volume constraints.The success of MMA(method of moving asymptotic)inspires us to introduce the classical sequential conservative approximate programming that can generate a sequence of steadily improving feasible designs and present a sequential conservative integer programming(SCIP)method for the development of SAIP.This new method generates a sequence of nonlinear approximate integer programming subproblems containing the reciprocal variables,whose conservation is controlled by moving asymptotes.Since CRA is invalid for nonlinear subproblems,a simple design variable update rule derived by the KKT(Karush-Kuhn-Tucker)conditions is given.Based on the above idea,SCIP obtains stable optimization processes without relying on linear constraints,such as the volume constraint,and thus complex discrete variable topology optimization problems can be efficiently solved.Various requirements of topology optimization problems are handled,including equality or inequality constraints,and inactive or active volume constraints.Numerical results show that since the conservative property has been inherited,the convergence of the optimi-zation process can be regulated without additional structural analysis.

Topology optimizationSequential approximate integer programmingSequential conservative integer programmingAugmented Lagrange formulationCompliant mechanism

孙凯、程耿东、张凯庆、梁缘

展开 >

Department of Engineering Mechanics,Dalian University of Technology,Dalian 116023,China

State Key Laboratory of Structural Analysis,Optimization and CAE Software for Industrial Equipment,Dalian 116023,China

Topology optimization Sequential approximate integer programming Sequential conservative integer programming Augmented Lagrange formulation Compliant mechanism

国家重点研发计划国家自然科学基金国家自然科学基金国家自然科学基金国家自然科学基金中国博士后科学基金

2020YFB1709401122020921203200811821202ZX20220734

2024

10.1007/s10409-023-23151-X

力学学报(英文版)

力学学报(英文版)

CSTPCD
影响因子：0.363
ISSN：0567-7718
年,卷(期)：2024.40(1)
  • 40