Decomposition theory for multidisciplinary design optimization problems with mixed integer quasiseparable subsystems

Numerous hierarchical and nonhierarchical decomposition strategies for the optimization of large scale systems, comprised of interacting subsystems, have been proposed. With a few exceptions, all of these strategies are essentially heuristic in nature. Recent work considered a class of optimization problems, called quasiseparable, narrow enough for a rigorous decomposition theory, yet general enough to encompass many large scale engineering design problems. The subsystems for these problems involve local design variables and global system variables, but no variables from other subsystems. The objective function is a sum of a global system criterion and the subsystems’ criteria. The essential idea is to give each subsystem a budget and global system variable values, and then ask the subsystems to independently maximize their constraint margins. Using these constraint margins, a system optimization then adjusts the values of the system variables and subsystem budgets. The subsystem margin problems are totally independent, always feasible, and could even be done asynchronously in a parallel computing context. An important detail is that the subsystem tasks, in practice, would be to construct response surface approximations to the constraint margin functions, and the system level optimization would use these margin surrogate functions. The present paper extends the quasiseparable necessary conditions for continuous variables to include discrete subsystem variables, although the continuous necessary and sufficient conditions do not extend to include integer variables.     

A local convergence analysis of bilevel decomposition algorithms

Multidisciplinary design optimization (MDO) problems are engineering design problems that require the consideration of the interaction between several design disciplines. Due to the organizational aspects of MDO problems, decomposition algorithms are often the only feasible solution approach. Decomposition algorithms reformulate the MDO problem as a set of independent subproblems, one per discipline, and a coordinating master problem. A popular approach to MDO problems is bilevel decomposition algorithms. These algorithms use nonlinear optimization techniques to solve both the master problem and the subproblems. In this paper, we propose two new bilevel decomposition algorithms and analyze their properties. In particular, we show that the proposed problem formulations are mathematically equivalent to the original problem and that the proposed algorithms converge locally at a superlinear rate. Our computational experiments illustrate the numerical performance of the algorithms.     

An uncertain multidisciplinary design optimization method using interval convex models

This article proposes an uncertain multi-objective multidisciplinary design optimization methodology, which employs the interval model to represent the uncertainties of uncertain-but-bounded parameters. The interval number programming method is applied to transform each uncertain objective function into two deterministic objective functions, and a satisfaction degree of intervals is used to convert both the uncertain inequality and equality constraints to deterministic inequality constraints. In doing so, an unconstrained deterministic optimization problem will be constructed in association with the penalty function method. The design will be finally formulated as a nested three-loop optimization, a class of highly challenging problems in the area of engineering design optimization. An advanced hierarchical optimization scheme is developed to solve the proposed optimization problem based on the multidisciplinary feasible strategy, which is a well-studied method able to reduce the dimensions of multidisciplinary design optimization problems by using the design variables as independent optimization variables. In the hierarchical optimization system, the non-dominated sorting genetic algorithm II, sequential quadratic programming method and Gauss–Seidel iterative approach are applied to the outer, middle and inner loops of the optimization problem, respectively. Typical numerical examples are used to demonstrate the effectiveness of the proposed methodology.     

Collaborative optimization with inverse reliability for multidisciplinary systems uncertainty analysis

This article introduces a method which combines the collaborative optimization framework and the inverse reliability strategy to assess the uncertainty encountered in the multidisciplinary design process. This method conducts the sub-system analysis and optimization concurrently and then improves the process of searching for the most probable point (MPP). It reduces the load of the system-level optimizer significantly. This advantage is specifically more prominent for large-scale engineering system design. Meanwhile, because the disciplinary analyses are treated as the equality constraints in the disciplinary optimization, the computation load can be further reduced. Examples are used to illustrate the accuracy and efficiency of the proposed method.     

Decomposition of multidisciplinary optimization problems: formulations and application to a simplified wing design

Several formulations for solving multidisciplinary design optimization (MDO) problems are presented and applied to a test case. Two bi-level hierarchical decomposition approaches are compared with two classical single-level approaches without decomposition of the optimization problem. A methodology to decompose MDO problems and a new formulation based on this decomposition are proposed. The problem considered here for validation of the different formulations involves the shape and structural optimization of a conceptual wing model. The efficiency of the design strategies are compared on the basis of optimization results.     

博弈分析法在建筑设计方案优化中的应用

  建筑设计是开发商投资的关键阶段。根据我国建筑设计规范与法规体系的要求,借助博弈理论,分析建筑设计质量在设计方不同态度情况下的设计方案优化问题,采用博弈中的图解分析法,说明委托方与设计方之间的博弈,提出优化建筑设计方案的对策,从而使建筑设计方案达到最优。     

A single-loop optimization method for reliability analysis with second order uncertainty

Reliability analysis may involve random variables and interval variables. In addition, some of the random variables may have interval distribution parameters owing to limited information. This kind of uncertainty is called second order uncertainty. This article develops an efficient reliability method for problems involving the three aforementioned types of uncertain input variables. The analysis produces the maximum and minimum reliability and is computationally demanding because two loops are needed: a reliability analysis loop with respect to random variables and an interval analysis loop for extreme responses with respect to interval variables. The first order reliability method and nonlinear optimization are used for the two loops, respectively. For computational efficiency, the two loops are combined into a single loop by treating the Karush–Kuhn–Tucker (KKT) optimal conditions of the interval analysis as constraints. Three examples are presented to demonstrate the proposed method.     

Fast parallel algorithms for the Maximum Empty Rectangle problem

We present efficient parallel algorithms for the maximum empty rectangle problem in this paper. On crew pram, we solve the area version of this problem inO(log ² n) time usingO(nlogn) processors. The perimeter version of this problem is solved inO(logn) time usingO(nlog ² n) processors. On erew pram, we solve both the problems inO(logn) time usingO(n ²/logn) processors. We also present anO(logn) time algorithm on a mesh-of-trees architecture.     

Uncertainty quantification using evidence theory in multidisciplinary design optimization

Advances in computational performance have led to the development of large-scale simulation tools for design. Systems generated using such simulation tools can fail in service if the uncertainty of the simulation tool's performance predictions is not accounted for. In this research an investigation of how uncertainty can be quantified in multidisciplinary systems analysis subject to epistemic uncertainty associated with the disciplinary design tools and input parameters is undertaken. Evidence theory is used to quantify uncertainty in terms of the uncertain measures of belief and plausibility. To illustrate the methodology, multidisciplinary analysis problems are introduced as an extension to the epistemic uncertainty challenge problems identified by Sandia National Laboratories.After uncertainty has been characterized mathematically the designer seeks the optimum design under uncertainty. The measures of uncertainty provided by evidence theory are discontinuous functions. Such non-smooth functions cannot be used in traditional gradient-based optimizers because the sensitivities of the uncertain measures are not properly defined. In this research surrogate models are used to represent the uncertain measures as continuous functions. A sequential approximate optimization approach is used to drive the optimization process. The methodology is illustrated in application to multidisciplinary example problems.     

Differential evolution techniques for the structure-control design of a five-bar parallel robot

The present work deals with the use of a constraint-handling differential evolution algorithm to solve a nonlinear dynamic optimization problem (NLDOP) with 51 decision variables. A novel mechatronic design approach is proposed as an NLDOP, where both the structural parameters of a non-redundant parallel robot and the control parameters are simultaneously designed with respect to a performance criterion. Additionally, the dynamic model of the parallel robot is included in the NLDOP as an equality constraint. The obtained solution will be a set of optimal geometric parameters and optimal PID control gains. The optimal geometric parameters adjust the dynamic and the kinematic parameters, optimizing then, the link shapes of the robot. The proposed mechatronic design approach is applied to design simultaneously both the mechanical structure of a five-bar parallel robot and the PID controller.     

A new efficient convergence criterion for reducing computational expense in topology optimization: reducible design variable method

A new efficient convergence criterion, named the reducible design variable method (RDVM), is proposed to save computational expense in topology optimization. There are two types of computational costs: one is to calculate the governing equations, and the other is to update the design variables. In conventional topology optimization, the number of design variables is usually fixed during the optimization procedure. Thus, the computational expense linearly increases with respect to the iteration number. Some design variables, however, quickly converge and some other design variables slowly converge. The idea of the proposed method is to adaptively reduce the number of design variables on the basis of the history of each design variable during optimization. Using the RDVM, those design variables that quickly converge are not considered as design variables for the next iterations. This means that the number of design variables can be reduced to save the computational costs of updating design variables. Then, the iteration will repeat until the number of design variables becomes 0. In addition, the proposed method can lead to faster convergence of the optimization procedure, which indeed is a more significant time saving. It is also revealed that the RDVM gives identical optimal solutions as those by conventional methods. We confirmed the numerical efficiency and solution effectiveness of the RDVM with respect to two types of optimization: static linear elastic minimization, and linear vibration problems with the first eigenvalue as the objective function for maximization. Copyright © 2012 John Wiley & Sons, Ltd.     

复杂系统的多学科设计优化综述

从设计和分析的本质出发,结合复杂系统的特点,通过分析传统设计优化流程在面对复杂系统时存在的困难和缺陷,指出多学科设计优化(multidisciplinary design optimization,MDO)方法是解决复杂系统设计优化问题的一种有效措施.在此基础上,介绍了多学科优化方法的基本思想,总结了子系统耦合方式及MDO在处理耦合时的基本方法,归纳了MDO的知识框架和主要研究内容.最后在现有研究成果的基础上,对MDO今后的研究提出了几点参考意见.     

A parallel particle swarm optimization algorithm for multi-objective optimization problems

In this article, a new proposal of using particle swarm optimization algorithms to solve multi-objective optimization problems is presented. The algorithm is constructed based on the concept of Pareto dominance, as well as a state-of-the-art ‘parallel’ computing technique that intends to improve algorithmic effectiveness and efficiency simultaneously. The proposed parallel particle swarm multi-objective evolutionary algorithm (PPS-MOEA) is tested through a variety of standard test functions taken from the literature; its performance is compared with six noted multi-objective algorithms. The computational experience gained from the first two experiments indicates that the algorithm proposed in this article is extremely competitive when compared with other MOEAs, being able to accurately, reliably and robustly approximate the true Pareto front in almost every tested case. To justify the motivation behind the research of the parallel swarm structure, the computational results of the third experiment confirm the PPS-MOEA's merit in solving really high-dimensional multi-objective optimization problems.     

Distributionally robust optimization for engineering design under uncertainty

This paper addresses the challenge of design optimization under uncertainty when the designer only has limited data to characterize uncertain variables. We demonstrate that the error incurred when estimating a probability distribution from limited data affects the out-of-sample performance (ie, performance under the true distribution) of optimized designs. We demonstrate how this can be mitigated by reformulating the engineering design problem as a distributionally robust optimization (DRO) problem. We present computationally efficient algorithms for solving the resulting DRO problem. The performance of the DRO approach is explored in a practical setting by applying it to an acoustic horn design problem. The DRO approach is compared against traditional approaches to optimization under uncertainty, namely, sample-average approximation and multiobjective optimization incorporating a risk reduction objective. In contrast with the multiobjective approach, the proposed DRO approach does not use an explicit risk reduction objective but rather specifies a so-called ambiguity set of possible distributions and optimizes against the worst-case distribution in this set. Our results show that the DRO designs, in some cases, significantly outperform those designs found using the sample-average or the multiobjective approach.     

A globally convergent algorithm for transportation continuous network design problem

The continuous network design problem (CNDP) is characterized by a bilevel programming model, in which the upper level problem is generally to minimize the total system cost under limited expenditure, while at the lower level the network users make choices with regard to route conditions following the user equilibrium principle. In this paper, the bilevel programming model for CNDP is transformed into a single level convex programming problem by virtue of an optimal-value function tool and the relationship between System Optimum (SO) and User Equilibrium (UE). By exploring the inherent nature of the CNDP, the optimal-value function for the lower level user equilibrium problem is proved to be continuously differentiable and its derivative in link capacity enhancement can be obtained efficiently by implementing user equilibrium assignment subroutine. However, the reaction (or response) function between the upper and lower level problem is implicit and its gradient is difficult to obtain. Although, here we approximately express the gradient with the difference concept at each iteration, based on the method of successive averages (MSA), we propose a globally convergent algorithm to solve the single level convex programming problem. Comparing with widely used heuristic algorithms, such as sensitivity analysis based (SAB) method, the proposed algorithm needs not strong hypothesis conditions and complex computation for the inverse matrix. Finally, a numerical example is presented to compare the proposed method with some existing algorithms.     

A network-based shortest route model for parallel disassembly line balancing problem

Disassembly lines should be balanced efficiently to increase productivity of the line and to reduce disassembly costs. This problem is called disassembly line balancing problem (DLBP). The objective of the DLBP is usually to find the minimum number of disassembly workstations required. This study introduces parallel DLBP (PDLBP) with single-product and proposes a network model based on the shortest route model (SRM) for solving PDLBP. The proposed model is illustrated via numerical examples. A comprehensive experiment is also conducted to evaluate problem-specific features of disassembly lines. To the best of our knowledge, this is the first study dealing with PDLBP. This paper will present a different point of view regarding DLBP.     

基于公理设计和相容决策支持问题法的稳健优化设计方法

 针对多目标稳健优化问题,建立了多目标稳健优化的损失函数,利用灵敏度分析方法确定各设计变量对各设计目标的影响程度,确定主要的设计参数,便于调整和控制设计参数的公差.根据信息公理与损失函数的一致性关系,建立以最小化各目标的总损失函数为目标函数.并在相容决策支持问题法框架基础上,提出一种基于公理设计和相容决策支持问题法的多目标稳健优化设计模型.实例分析表明,提出的方法是可行的.     

Sequential algorithms for structural design optimization under tolerance conditions

A deterministic optimization usually ignores the effects of uncertainties in design variables or design parameters on the constraints. In practical applications, it is required that the optimum solution can endure some tolerance so that the constraints are still satisfied when the solution undergoes variations within the tolerance range. An optimization problem under tolerance conditions is formulated in this article. It is a kind of robust design and a special case of a generalized semi-infinite programming (GSIP) problem. To overcome the deficiency of directly solving the double loop optimization, two sequential algorithms are then proposed for obtaining the solution, i.e. the double loop optimization is solved by a sequence of cycles. In each cycle a deterministic optimization and a worst case analysis are performed in succession. In sequential algorithm 1 (SA1), a shifting factor is introduced to adjust the feasible region in the next cycle, while in sequential algorithm 2 (SA2), the shifting factor is replaced by a shifting vector. Several examples are presented to demonstrate the efficiency of the proposed methods. An optimal design result based on the presented method can endure certain variation of design variables without violating the constraints. For GSIP, it is shown that SA1 can obtain a solution with equivalent accuracy and efficiency to a local reduction method (LRM). Nevertheless, the LRM is not applicable to the tolerance design problem studied in this article.     

An improvement of Kriging based sequential approximate optimization method via extended use of design of experiments

When Kriging is used as a meta-model for an inequality constrained function, approximate optimal solutions are sometimes infeasible in the case where they are active at the constraint boundary. This article explores the development of a Kriging-based meta-model that enhances the constraint feasibility of an approximate optimal solution. The trust region management scheme is used to ensure the convergence of the approximate optimal solution. The present study proposes a method of enhancing the constraint feasibility in which the currently infeasible design is replaced by the most feasible-usable design during the sequential approximate optimization process. An additional convergence condition is also included to reinforce the design accuracy and feasibility. Latin hypercube design and (2n+1) design are used as tools for design of experiments. The proposed approach is verified through a constrained mathematical function problem and a number of engineering optimization problems to support the proposed strategies.     

3-RPRR类平面全柔性并联机构拓扑优化设计

针对全柔性并联机构的构型设计不能满足精密定位和微纳制造领域的需求,为提高全柔性并联机构的整体刚度、抗振性和抗干扰性,基于3-RPRR并联机构原型,采用型综合法,设计出与并联机构原型空间运动特性一致的3-RPRR类平面全柔性机构及其支链.运用拓扑优化的方法,得到铰链最优配置的3-RPRR类平面全柔性并联机构及其支链.采用Hyperworks/Radioss软件分别对这2种3-RPRR类平面全柔性并联机构进行静力学及模态分析,仿真结果表明:在实现相同运动特性的前提下,优化后的3-RPRR类平面全柔性并联机构不仅节省材料,而且在刚度、抗振性和抗干扰性方面更优.