An efficient strategy for reliability-based multidisciplinary design optimization of twin-web disk with non-probabilistic model

The twin-web disk holds big promise for increasing efficiency of the aircraft engine. Its reliability-based multidisciplinary design optimization involves several disciplines including fluid mechanics, heat transfer, structural strength, and vibration. The solution to this optimization problem requires three-loop calculations including loops for optimization, reliability, and interdisciplinary consistence often making its computational cost unacceptably high. The lack of sufficient amount of probabilistic data, especially for this brand-new turbine disk, makes matters worse. In this paper, the non-probabilistic uncertain variables are described by an evidence theory-based fuzzy set method, which we extend to general structure of uncertain data. We also propose two modifications of the active learning kriging model: one of them for the purpose of optimization with respect to the distance from the optimum point and another one for the purpose of assessing reliability by introducing the importance concept. Applications of these two modifications are demonstrated in this paper. Finally, a multi-adaptive learning kriging strategy for non-probabilistic reliability-based multidisciplinary design optimization of twin-web disk is proposed to improve its power efficiency and reliability in a computationally effective way.     

Time-dependent reliability-based design optimization with probabilistic and interval uncertainties

Time-dependent reliability-based design optimization with both probabilistic and interval uncertainties is a cost-consuming problem in engineering practice which generally needs huge computational burden. In order to deal with this issue, a sequential single-loop optimization strategy is established in this work. The established sequential single-loop optimization strategy converts the original triple-loop optimization into a sequence of deterministic optimization, the estimations of time instant and interval value that corresponding to the worst case scenario, and the minimum performance target point searching. Two key points in the sequential single-loop optimization strategy guarantee the high efficiency of the proposed strategy. One is that no iterative searching step is needed to find the minimum performance target point at each iteration in the proposed sequential single-loop optimization strategy. The other is that only the correction step needs the reliability analysis to correct the design parameter solutions. In the example section, four minimum performance target point searching techniques are combined with the sequential single-loop optimization strategy to solve the corresponding optimization problems so to illustrate the effectiveness of the established strategy.     

Novel reliability-based optimization method for thermal structure with hybrid random,interval and fuzzy parameters

In this paper, novel reliability-based optimization model and method are proposed for thermal structure design with random, interval and fuzzy uncertainties in material properties, external loads and boundary conditions. Random variables are used to quantify the probabilistic uncertainty with sufficient sample data; whereas, interval variables and fuzzy variables are adopted to model the non-probabilistic uncertainty associated with objective limited information and subjective expert opinions, respectively. Using the interval ranking strategy, the level-cut limit state function is precisely quantified to represent the safety state. The eventual safety possibility is derived based on multiple integral, where the cut levels of different fuzzy variables are considered to be independent. Then a hybrid reliability-based optimization model is established with considerable computational cost caused by three-layer nested loop. To improve the computational efficiency, a subinterval vertex method is presented to replace the inner-loop and middle-loop. Comparing numerical results with traditional reliability model, a mono-objective example and a multi-objective example are provided to demonstrate the feasibility of proposed method for hybrid reliability analysis and optimization in practical engineering.     

Discrete optimization problems with interval parameters

Optimization problems on graphs with interval parameters are considered, and exponential and polynomial bounds for their computational complexity are obtained. For a certain subclass of polynomially solvable problems, two algorithms are proposed—one of them for finding an optimal solution and the other one for finding a suboptimal solution. Sufficient conditions for the statistical efficiency of the algorithm for finding a suboptimal solution are obtained.     

New simulation-based frameworks for multi-objective reliability-based design optimization of structures

In the present study, two new simulation-based frameworks are proposed for multi-objective reliability-based design optimization (MORBDO). The first is based on hybrid non-dominated sorting weighted simulation method (NSWSM) in conjunction with iterative local searches that is efficient for continuous MORBDO problems. According to NSWSM, uniform samples are generated within the design space and, then, the set of feasible samples are separated. Thereafter, the non-dominated sorting operator is employed to extract the approximated Pareto front. The iterative local sample generation is then performed in order to enhance the accuracy, diversity, and increase the extent of non-dominated solutions. In the second framework, a pseudo-double loop algorithm is presented based on hybrid weighted simulation method (WSM) and the Non-dominated Sorting Genetic Algorithm II (NSGA-II) that is efficient for problems including both discrete and continuous variables. According to hybrid WSM-NSGA-II, proper non-dominated solutions are produced in each generation of NSGA-II and, subsequently, WSM evaluates the reliability level of each candidate solution until the algorithm converges to the true Pareto solutions. The valuable characteristic of presented approaches is that only one simulation run is required for WSM during entire optimization process, even if solutions for different levels of reliability be desired. Illustrative examples indicate that NSWSM with the proposed local search strategy is more efficient for small dimension continuous problems. However, WSM-NSGA-II outperforms NSWSM in terms of solutions quality and computational efficiency, specifically for discrete MORBDOs. Employing global optimizer in WSM-NSGA-II provided more accurate results with lower samples than NSWSM.     

Efficient interval partitioning for constrained global optimization

A new efficient interval partitioning approach to solve constrained global optimization problems is proposed. This involves a new parallel subdivision direction selection method as well as an adaptive tree search. The latter explores nodes (intervals in variable domains) using a restricted hybrid depth-first and best-first branching strategy. This hybrid approach is also used for activating local search to identify feasible stationary points. The new tree search management technique results in improved performance across standard solution and computational indicators when compared to previously proposed techniques. On the other hand, the new parallel subdivision direction selection rule detects infeasible and suboptimal boxes earlier than existing rules, and this contributes to performance by enabling earlier reliable deletion of such subintervals from the search space.     

Efficient solution of interval optimization problem

In this paper the interval valued function is defined in the parametric form and its properties are studied. A methodology is developed to study the existence of the solution of a general interval optimization problem, which is expressed in terms of the interval valued functions. The methodology is applied to the interval valued convex quadratic programming problem.     

Super parametric convex model and its application for non-probabilistic reliability-based design optimization

In this study, we attempt to propose a new super parametric convex model by giving the mathematical definition, in which an effective minimum volume method is constructed to give a reasonable enveloping of limited experimental samples by selecting a proper super parameter. Two novel reliability calculation algorithms, including nominal value method and advanced nominal value method, are proposed to evaluate the non-probabilistic reliability index. To investigate the influence of non-probabilistic convex model type on non-probabilistic reliability-based design optimization, an effective approach based on advanced nominal value method is further developed. Four examples, including two numerical examples and two engineering applications, are tested to demonstrate the superiority of the proposed non-probabilistic reliability analysis and optimization technique.     

Enriched self-adjusted performance measure approach for reliability-based design optimization of complex engineering problems

For reliability-based design optimization (RBDO) of practical structural/mechanical problems under highly nonlinear constraints, it is an important characteristic of the performance measure approach (PMA) to show robustness and high convergence rate. In this study, self-adjusted mean value is used in the PMA iterative formula to improve the robustness and efficiency of the RBDO-based PMA for nonlinear engineering problems based on dynamic search direction. A novel merit function is applied to adjust the modified search direction in the enriched self-adjusted mean value (ESMV) method, which can control the instability and value of the step size for highly nonlinear probabilistic constraints in RBDO problems. The convergence performance of the enriched self-adjusted PMA is illustrated using four nonlinear engineering problems. In particular, a complex engineering example of aircraft stiffened panel is used to compare the RBDO results of different reliability methods. The results demonstrate that the proposed self-adjusted steepest descent search direction can improve the computational efficiency and robustness of the PMA compared to existing modified reliability methods for nonlinear RBDO problems.     

A hybrid self-adjusted mean value method for reliability-based design optimization using sufficient descent condition

Due to the efficiency and simplicity, advanced mean value (AMV) method is widely used to evaluate the probabilistic constraints in reliability-based design optimization (RBDO) problems. However, it may produce unstable results as periodic and chaos solutions for highly nonlinear performance functions. In this paper, the AMV is modified based on a self-adaptive step size, named as the self-adjusted mean value (SMV) method, where the step size for reliability analysis is adjusted based on a power function dynamically. Then, a hybrid self-adjusted mean value (HSMV) method is developed to enhance the robustness and efficiency of iterative scheme in the reliability loop, where the AMV is combined with the SMV on the basis of sufficient descent condition. Finally, the proposed methods (i.e. SMV and HSMV) are compared with other existing performance measure approaches through several nonlinear mathematical/structural examples. Results show that the SMV and HSMV are more efficient with enhanced robustness for both convex and concave performance functions.     

Exponential stabilization of stochastic interval system with time dependent parameters

There has been growing interest in analyzing stability in design controls of stochastic systems. This interest arises out of the need to develop robust control strategies for systems with uncertain dynamics. This paper is concerned with the examination of conditions under which the desired structure of a stochastic interval system with time dependent parameters is stabilizable. Necessary and sufficient condition under which two-level preconditioner guarantees quadratic mean exponential stability of the desired structure of uncontrolled stochastic interval system is presented. Sufficient condition for exponential stability of the equilibrium solution of uncontrolled stochastic interval system is also presented.     

Reliability stochastic optimization for a series system with interval component reliability via genetic algorithm

This paper deals with chance constraints based reliability stochastic optimization problem in the series system. This problem can be formulated as a nonlinear integer programming problem of maximizing the overall system reliability under chance constraints due to resources. The assumption of traditional reliability optimization problem is that the reliability of a component is known as a fixed quantity which lies in the open interval (0, 1). However, in real life situations, the reliability of an individual component may vary due to some realistic factors and it is sensible to treat this as a positive imprecise number and this imprecise number is represented by an interval valued number. In this work, we have formulated the reliability optimization problem as a chance constraints based reliability stochastic optimization problem with interval valued reliabilities of components. Then, the chance constraints of the problem are converted into the equivalent deterministic form. The transformed problem has been formulated as an unconstrained integer programming problem with interval coefficients by Big-M penalty technique. Then to solve this problem, we have developed a real coded genetic algorithm (GA) for integer variables with tournament selection, uniform crossover and one-neighborhood mutation. To illustrate the model two numerical examples have been solved by our developed GA. Finally to study the stability of our developed GA with respect to the different GA parameters, sensitivity analyses have been done graphically.     

Efficient model for interval goal programming with arbitrary penalty function

Penalty function is a key factor in interval goal programming (IGP), especially for decision makers weighing resources vis-à-vis goals. Many approaches (Chang et al. J Oper Res Soc 57:469–473, 2006; Chang and Lin Eur J Oper Res 199, 9–20, 2009; Jones et al. Omega 23, 41–48, 1995; Romero Eur J Oper Res 153, 675–686, 2004; Vitoriano and Romero J Oper Res Soc 50, 1280–1283, 1999)have been proposed for treating several types of penalty functions in the past several decades. The recent approach of Chang and Lin (Eur J Oper Res 199, 9–20, 2009) considers the S-shaped penalty function. Although there are many approaches cited in literature, all are complicated and inefficient. The current paper proposes a novel and concise uniform model to treat any arbitrary penalty function in IGP. The efficiency and usefulness of the proposed model are demonstrated in several numeric examples.     

Computation of bounds for eigenvalues of structures with interval parameters

In this paper, the computation of eigenvalue bounds for generalized interval eigenvalue problem is considered. Two algorithms based on the properties of continuous functions are developed for evaluating upper and lower eigenvalue bounds of structures with interval parameters. The method can provide the tightest bounds within a given precision. Numerical examples illustrate the effectiveness of the proposed method.     

Adaptive control and synchronization of a coupled dynamo system with uncertain parameters

This paper treats the adaptive control and synchronization of the coupled dynamo system with unknown parameters. Based on the Lyapunov stability technique, an adaptive control laws are derived such that the coupled dynamo system is asymptotically stable and the two identical dynamo systems are asymptotically synchronized. Also the update rules of the unknown parameters are derived. Finally, numerical simulation of the controlled and synchronized systems are presented.     

Efficient robust optimization for robust control with constraints

This paper proposes an efficient computational technique for the optimal control of linear discrete-time systems subject to bounded disturbances with mixed linear constraints on the states and inputs. The problem of computing an optimal state feedback control policy, given the current state, is non-convex. A recent breakthrough has been the application of robust optimization techniques to reparameterize this problem as a convex program. While the reparameterized problem is theoretically tractable, the number of variables is quadratic in the number of stages or horizon length N and has no apparent exploitable structure, leading to computational time of per iteration of an interior-point method. We focus on the case when the disturbance set is ∞-norm bounded or the linear map of a hypercube, and the cost function involves the minimization of a quadratic cost. Here we make use of state variables to regain a sparse problem structure that is related to the structure of the original problem, that is, the policy optimization problem may be decomposed into a set of coupled finite horizon control problems. This decomposition can then be formulated as a highly structured quadratic program, solvable by primal-dual interior-point methods in which each iteration requires time. This cubic iteration time can be guaranteed using a Riccati-based block factorization technique, which is standard in discrete-time optimal control. Numerical results are presented, using a standard sparse primal-dual interior point solver, that illustrate the efficiency of this approach.     

Efficient topology optimization of thermo-elasticity problems using coupled field adjoint sensitivity analysis method

We develop a unified and efficient adjoint design sensitivity analysis (DSA) method for weakly coupled thermo-elasticity problems. Design sensitivity expressions with respect to thermal conductivity and Young's modulus are derived. Besides the temperature and displacement adjoint equations, a coupled field adjoint equation is defined regarding the obtained adjoint displacement field as the adjoint load in the temperature field. Thus, the computing cost is significantly reduced compared to other sensitivity analysis methods. The developed DSA method is further extended to a topology design optimization method. For the topology design optimization, the design variables are parameterized using a bulk material density function. Numerical examples show that the DSA method developed is extremely efficient and the optimal topology varies significantly depending on the ratio of mechanical and thermal loadings.     

Decoupled reliability-based geotechnical design of deep excavations of soil with spatial variability

This paper presents a general decoupled method for reliability-based geotechnical design that takes into account the spatial variability of soil properties. In this method, reliability analyses that require a lot of computational resources are decoupled from the optimization procedure by approximating the failure probability function globally. Failure samples are iteratively generated over the entire design space so that their global distribution information can be extracted to construct the failure probability function. The method is computationally efficient, is flexible to implement, and is well suited for geotechnical problems that may involve sophisticated models. A design example of two-dimensional deep excavation against basal heave is discussed for Singapore marine clay where the density and normalized undrained shear strength of soil mass are modeled as random fields. Results demonstrate that the proposed method works well in practice and is advantageous over the coupled or locally decoupled reliability-based geotechnical design methods.     

A system for the design of short term harvesting strategy

Short term harvesting requires decisions on which stands to harvest, what timber volume to cut, what bucking patterns (how to cut up the logs) to apply to logs in order to obtain products that satisfy demand and which harvesting machinery to use. This is an important problem in forest management and difficult to solve well in satisfying demand, while maximizing net profits. Traditionally, foresters have used manual approaches to find adequate solutions, which has shortcomings both in time spent by analysts and the quality of solutions. Since demand for timber products is defined by length, diameter and quality of each piece, this leads to a complex combinatorial problem in matching supply (standing trees) and demand. We developed one of the few reported approaches for solving the short term harvesting problem based on a computerized system, using a linear programming approach. Determining adequate bucking patterns is not trivial. We develop a column generation approach to generate such patterns. The subproblem is a specially designed branch and bound scheme. The generation of bucking patterns implemented within the LP formulation led to a significant improvement of solutions. We believe this is the first system implemented with this level of detail. This system has been advantageously implemented in several forest companies. The results obtained show improvements obtained by the firms of 5–8% in net revenues over traditional manual approaches.