An accurate penalty-based approach for reliability-based design optimization

A typical reliability-based design optimization (RBDO) problem is usually formulated as a stochastic optimization model where the performance of a system is optimized with the reliability requirements being satisfied. Most existing RBDO methods divide the problem into two sub-problems: one relates to reliability analysis, the other relates to optimization. Traditional approaches nest the two sub-problems with the reliability analysis as the inner loop and the optimization as the outer loop. Such nested approaches face the challenge of prohibitive computational expense that drives recent research focusing on decoupling the two loops or even fundamentally transforming the two-loop structure into one deterministic optimization problem. While promising, the potential issue in these computationally efficient approaches is the lowered accuracy. In this paper, a new decoupled approach, which performs the two loops sequentially, is proposed. First, a deterministic optimization problem is solved to locate the means of the uncertain design variables. After the mean values are determined, the reliability analysis is performed. A new deterministic optimization problem is then restructured with a penalty added to each limit-state function to improve the solution iteratively. Most existing research on decoupled approaches linearizes the limit-state functions or introduces the penalty into the limit-state functions, which may suffer the approximation error. In this research, the penalty term is introduced to change the right hand side (RHS) value of the deterministic constraints. Without linearizing or transforming the formulations of limit-state function, this penalty-based approach effectively improves the accuracy of RBDO. Comparison experiments are conducted to illustrate how the proposed method obtains improved solutions with acceptable computational cost when compared to other RBDO approaches collected from literature.     

Ant system for reliability optimization of a series system with multiple-choice and budget constraints

Many researchers have shown that insect colonies behavior can be seen as a natural model of collective problem solving. The analogy between the way ants look for food and combinatorial optimization problems has given rise to a new computational paradigm, which is called ant system. This paper presents an application of ant system in a reliability optimization problem for a series system with multiple-choice constraints incorporated at each subsystem, to maximize the system reliability subject to the system budget. The problem is formulated as a nonlinear binary integer programming problem and characterized as an NP-hard problem. This problem is solved by developing and demonstrating a problem-specific ant system algorithm. In this algorithm, solutions of the reliability optimization problem are repeatedly constructed by considering the trace factor and the desirability factor. A local search is used to improve the quality of the solutions obtained by each ant. A penalty factor is introduced to deal with the budget constraint. Simulations have shown that the proposed ant system is efficient with respect to the quality of solutions and the computing time.     

Model correction factor method for reliability problems involving integrals of non-Gaussian random fields

The model correction factor method (MCFM) is used in conjunction with the first-order reliability method (FORM) to solve structural reliability problems involving integrals of non-Gaussian random fields. The approach replaces the limit-state function with an idealized one, in which the integrals are considered to be Gaussian. Conventional FORM analysis yields the linearization point of the idealized limit-state surface. A model correction factor is then introduced to push the idealized limit-state surface onto the actual limit-state surface. A few iterations yield a good approximation of the reliability index for the original problem. This method has application to many civil engineering problems that involve random fields of material properties or loads. An application to reliability analysis of foundation piles illustrates the proposed method.     

Fault-tolerant embedded system design and optimization considering reliability estimation uncertainty

In this paper, we model embedded system design and optimization, considering component redundancy and uncertainty in the component reliability estimates. The systems being studied consist of software embedded in associated hardware components. Very often, component reliability values are not known exactly. Therefore, for reliability analysis studies and system optimization, it is meaningful to consider component reliability estimates as random variables with associated estimation uncertainty. In this new research, the system design process is formulated as a multiple-objective optimization problem to maximize an estimate of system reliability, and also, to minimize the variance of the reliability estimate. The two objectives are combined by penalizing the variance for prospective solutions. The two most common fault-tolerant embedded system architectures, N-Version Programming and Recovery Block, are considered as strategies to improve system reliability by providing system redundancy. Four distinct models are presented to demonstrate the proposed optimization techniques with or without redundancy. For many design problems, multiple functionally equivalent software versions have failure correlation even if they have been independently developed. The failure correlation may result from faults in the software specification, faults from a voting algorithm, and/or related faults from any two software versions. Our approach considers this correlation in formulating practical optimization models. Genetic algorithms with a dynamic penalty function are applied in solving this optimization problem, and reasonable and interesting results are obtained and discussed.     

An efficient approach for reliability-based topology optimization

This article presents an efficient approach for reliability-based topology optimization (RBTO) in which the computational effort involved in solving the RBTO problem is equivalent to that of solving a deterministic topology optimization (DTO) problem. The methodology presented is built upon the bidirectional evolutionary structural optimization (BESO) method used for solving the deterministic optimization problem. The proposed method is suitable for linear elastic problems with independent and normally distributed loads, subjected to deflection and reliability constraints. The linear relationship between the deflection and stiffness matrices along with the principle of superposition are exploited to handle reliability constraints to develop an efficient algorithm for solving RBTO problems. Four example problems with various random variables and single or multiple applied loads are presented to demonstrate the applicability of the proposed approach in solving RBTO problems. The major contribution of this article comes from the improved efficiency of the proposed algorithm when measured in terms of the computational effort involved in the finite element analysis runs required to compute the optimum solution. For the examples presented with a single applied load, it is shown that the CPU time required in computing the optimum solution for the RBTO problem is 15–30% less than the time required to solve the DTO problems. The improved computational efficiency allows for incorporation of reliability considerations in topology optimization without an increase in the computational time needed to solve the DTO problem.     

Deterministic network interdiction optimization via an evolutionary approach

This paper introduces an evolutionary optimization approach that can be readily applied to solve deterministic network interdiction problems. The network interdiction problem solved considers the minimization of the maximum flow that can be transmitted between a source node and a sink node for a fixed network design when there is a limited amount of resources available to interdict network links. Furthermore, the model assumes that the nominal capacity of each network link and the cost associated with their interdiction can change from link to link. For this problem, the solution approach developed is based on three steps that use: (1) Monte Carlo simulation, to generate potential network interdiction strategies, (2) Ford-Fulkerson algorithm for maximum s-t flow, to analyze strategies’ maximum source-sink flow and, (3) an evolutionary optimization technique to define, in probabilistic terms, how likely a link is to appear in the final interdiction strategy. Examples for different sizes of networks and network behavior are used throughout the paper to illustrate the approach. In terms of computational effort, the results illustrate that solutions are obtained from a significantly restricted solution search space. Finally, the authors discuss the need for a reliability perspective to network interdiction, so that solutions developed address more realistic scenarios of such problem.     

A time-variant reliability analysis method for structural systems based on stochastic process discretization

In this paper, we propose a new method for analyzing time-variant system reliability based on stochastic process discretization, which provides an effective tool for reliability design of many relatively complex structures considering the whole lifecycle. Within a design lifetime, the stochastic process is discretized into a series of random variables, and meanwhile, we can derive a time-invariant limit-state function in each time interval; the discretized random variables from the stochastic processes and the original random variables are transformed to the independent normal space, and a conventional time-invariant system reliability problem is derived through the linearization to each discretized limit-state functions; by solving this time-invariant system reliability problem, we can obtain the structural reliability or failure probability within the design lifetime. Finally, in this paper, we provide four numerical examples to verify the effectiveness of the method.     

Optimization of constrained multiple-objective reliability problems using evolutionary algorithms

This paper illustrates the use of multi-objective optimization to solve three types of reliability optimization problems: to find the optimal number of redundant components, find the reliability of components, and determine both their redundancy and reliability. In general, these problems have been formulated as single objective mixed-integer non-linear programming problems with one or several constraints and solved by using mathematical programming techniques or special heuristics. In this work, these problems are reformulated as multiple-objective problems (MOP) and then solved by using a second-generation Multiple-Objective Evolutionary Algorithm (MOEA) that allows handling constraints. The MOEA used in this paper (NSGA-II) demonstrates the ability to identify a set of optimal solutions (Pareto front), which provides the Decision Maker with a complete picture of the optimal solution space. Finally, the advantages of both MOP and MOEA approaches are illustrated by solving four redundancy problems taken from the literature.     

Cost effective simulation-based multiobjective optimization in the performance of an internal combustion engine

Solving real-life engineering problems can be difficult because they often have multiple conflicting objectives, the objective functions involved are highly nonlinear and they contain multiple local minima. Furthermore, function values are often produced via a time-consuming simulation process. These facts suggest the need for an automated optimization tool that is efficient (in terms of number of objective function evaluations) and capable of solving global and multiobjective optimization problems. In this article, the requirements on a general simulation-based optimization system are discussed and such a system is applied to optimize the performance of a two-stroke combustion engine. In the example of a simulation-based optimization problem, the dimensions and shape of the exhaust pipe of a two-stroke engine are altered, and values of three conflicting objective functions are optimized. These values are derived from power output characteristics of the engine. The optimization approach involves interactive multiobjective optimization and provides a convenient tool to balance between conflicting objectives and to find good solutions.     

A two-stage approach for multi-objective decision making with applications to system reliability optimization

This paper proposes a two-stage approach for solving multi-objective system reliability optimization problems. In this approach, a Pareto optimal solution set is initially identified at the first stage by applying a multiple objective evolutionary algorithm (MOEA). Quite often there are a large number of Pareto optimal solutions, and it is difficult, if not impossible, to effectively choose the representative solutions for the overall problem. To overcome this challenge, an integrated multiple objective selection optimization (MOSO) method is utilized at the second stage. Specifically, a self-organizing map (SOM), with the capability of preserving the topology of the data, is applied first to classify those Pareto optimal solutions into several clusters with similar properties. Then, within each cluster, the data envelopment analysis (DEA) is performed, by comparing the relative efficiency of those solutions, to determine the final representative solutions for the overall problem. Through this sequential solution identification and pruning process, the final recommended solutions to the multi-objective system reliability optimization problem can be easily determined in a more systematic and meaningful way.     

Gender approaches to evolutionary multi-objective optimization using pre-selection of criteria

A novel idea to perform evolutionary computations (ECs) for solving highly dimensional multi-objective optimization (MOO) problems is proposed. Following the general idea of evolution, it is proposed that information about gender is used to distinguish between various groups of objectives and identify the (aggregate) nature of optimality of individuals (solutions). This identification is drawn out of the fitness of individuals and applied during parental crossover in the processes of evolutionary multi-objective optimization (EMOO). The article introduces the principles of the genetic-gender approach (GGA) and virtual gender approach (VGA), which are not just evolutionary techniques, but constitute a completely new rule (philosophy) for use in solving MOO tasks. The proposed approaches are validated against principal representatives of the EMOO algorithms of the state of the art in solving benchmark problems in the light of recognized EC performance criteria. The research shows the superiority of the gender approach in terms of effectiveness, reliability, transparency, intelligibility and MOO problem simplification, resulting in the great usefulness and practicability of GGA and VGA. Moreover, an important feature of GGA and VGA is that they alleviate the ‘curse’ of dimensionality typical of many engineering designs.     

The Horseracing Simulation algorithm for evaluation of small failure probabilities

Over the past decade, the civil engineering community has ever more realized the importance and perspective of reliability-based design optimization (RBDO). Since then several advanced stochastic simulation algorithms for computing small failure probabilities encountered in reliability analysis of engineering systems have been developed: Subset Simulation (Au and Beck (2001) [2]), Line Sampling (Schuëller et al. (2004) [3]), The Auxiliary Domain Method (Katafygiotis et al. (2007) [4]), ALIS (Katafygiotis and Zuev (2007) [5]), etc. In this paper we propose a novel advanced stochastic simulation algorithm for solving high-dimensional reliability problems, called Horseracing Simulation (HRS). The key idea behind HS is as follows. Although the reliability problem itself is high-dimensional, the limit-state function maps this high-dimensional parameter space into a one-dimensional real line. This mapping transforms a high-dimensional random parameter vector, which may represent the stochastic input load as well as any uncertain structural parameters, into a random variable with unknown distribution, which represents the uncertain structural response. It turns out that the corresponding cumulative distribution function (CDF) of this random variable of interest can be accurately approximated by empirical CDFs constructed from specially designed samples. The generation of samples is governed by a process of “racing” towards the failure domain, hence the name of the algorithm. The accuracy and efficiency of the new method are demonstrated with a real-life wind engineering example.     

Reliability-based evaluation of automotive wind noise quality

This paper proposes an efficient method for the reliability analysis of a vehicle body–door subsystem with respect to an important quality issue—wind noise. A nonlinear seal model is constructed for the automotive wind noise problem and the limit state function is evaluated using finite element analysis. A multi-modal adaptive importance sampling (AIS) method is developed for reliability analysis at system level, to improve the efficiency of the Monte Carlo simulation. The method can easily handle implicit and time-dependent limit-state functions, with variables of any statistical distributions. Existing analytical as well as simulation-based methods are also investigated to solve the car door wind noise problem. It is demonstrated through this industrial application problem that the multi-modal AIS method is superior to existing methods in terms of efficiency and accuracy. A generalized framework for reliability estimation is then established for series system reliability problems with large numbers of random variables and complicated, implicit limit states.     

Application of genetic algorithm for reliability allocation in nuclear power plants

Reliability allocation is an optimization process of minimizing the total plant costs subject to the overall plant safety goal constraints. Reliability allocation was applied to determine the reliability characteristics of reactor systems, subsystems, major components and plant procedures that are consistent with a set of top-level performance goals; the core melt frequency, acute fatalities and latent fatalities. Reliability allocation can be performed to improve the design, operation and safety of new and/or existing nuclear power plants. Reliability allocation is a kind of a difficult multi-objective optimization problem as well as a global optimization problem. The genetic algorithm, known as one of the most powerful tools for most optimization problems, is applied to the reliability allocation problem of a typical pressurized water reactor in this article. One of the main problems of reliability allocation is defining realistic objective functions. Hence, in order to optimize the reliability of the system, the cost for improving and/or degrading the reliability of the system should be included in the reliability allocation process. We used techniques derived from the value impact analysis to define the realistic objective function in this article.     

Multi-objective hierarchical genetic algorithms for multilevel redundancy allocation optimization

Multilevel redundancy allocation optimization problems (MRAOPs) occur frequently when attempting to maximize the system reliability of a hierarchical system, and almost all complex engineering systems are hierarchical. Despite their practical significance, limited research has been done concerning the solving of simple MRAOPs. These problems are not only NP hard but also involve hierarchical design variables. Genetic algorithms (GAs) have been applied in solving MRAOPs, since they are computationally efficient in solving such problems, unlike exact methods, but their applications has been confined to single-objective formulation of MRAOPs. This paper proposes a multi-objective formulation of MRAOPs and a methodology for solving such problems. In this methodology, a hierarchical GA framework for multi-objective optimization is proposed by introducing hierarchical genotype encoding for design variables. In addition, we implement the proposed approach by integrating the hierarchical genotype encoding scheme with two popular multi-objective genetic algorithms (MOGAs)—the strength Pareto evolutionary genetic algorithm (SPEA2) and the non-dominated sorting genetic algorithm (NSGA-II). In the provided numerical examples, the proposed multi-objective hierarchical approach is applied to solve two hierarchical MRAOPs, a 4- and a 3-level problems. The proposed method is compared with a single-objective optimization method that uses a hierarchical genetic algorithm (HGA), also applied to solve the 3- and 4-level problems. The results show that a multi-objective hierarchical GA (MOHGA) that includes elitism and mechanism for diversity preserving performed better than a single-objective GA that only uses elitism, when solving large-scale MRAOPs. Additionally, the experimental results show that the proposed method with NSGA-II outperformed the proposed method with SPEA2 in finding useful Pareto optimal solution sets.     

Reliability based design optimization using response surfaces in application to multidisciplinary systems

Traditionally, reliability based design optimization (RBDO) is formulated as a nested optimization problem. For these problems the objective is to minimize a cost function while satisfying the reliability constraints. The reliability constraints are usually formulated as constraints on the probability of failure corresponding to each of the failure modes or a single constraint on the system probability of failure. The probability of failure is usually estimated by performing a reliability analysis. The difficulty in evaluating reliability constraints comes from the fact that modern reliability analysis methods are themselves formulated as an optimization problem. Solving such nested optimization problems is extremely expensive for large scale multidisciplinary systems which are likewise computationally intensive. In this research, a framework for performing reliability based multidisciplinary design optimization using approximations is developed. Response surface approximations (RSA) of the limit state functions are used to estimate the probability of failure. An outer loop is incorporated to ensure that the approximate RBDO converges to the actual most probable point of failure. The framework is compared with the exact RBDO procedure. In the proposed methodology, RSAs are employed to significantly reduce the computational expense associated with traditional RBDO. The proposed approach is implemented in application to multidisciplinary test problems, and the computational savings and benefits are discussed.     

Soft computing approach for reliability optimization: State-of-the-art survey

In the broadest sense, reliability is a measure of performance of systems. As systems have grown more complex, the consequences of their unreliable behavior have become severe in terms of cost, effort, lives, etc., and the interest in assessing system reliability and the need for improving the reliability of products and systems have become very important. Most solution methods for reliability optimization assume that systems have redundancy components in series and/or parallel systems and alternative designs are available. Reliability optimization problems concentrate on optimal allocation of redundancy components and optimal selection of alternative designs to meet system requirement. In the past two decades, numerous reliability optimization techniques have been proposed. Generally, these techniques can be classified as linear programming, dynamic programming, integer programming, geometric programming, heuristic method, Lagrangean multiplier method and so on. A Genetic Algorithm (GA), as a soft computing approach, is a powerful tool for solving various reliability optimization problems. In this paper, we briefly survey GA-based approach for various reliability optimization problems, such as reliability optimization of redundant system, reliability optimization with alternative design, reliability optimization with time-dependent reliability, reliability optimization with interval coefficients, bicriteria reliability optimization, and reliability optimization with fuzzy goals. We also introduce the hybrid approaches for combining GA with fuzzy logic, neural network and other conventional search techniques. Finally, we have some experiments with an example of various reliability optimization problems using hybrid GA approach.     

A hierarchical method for discrete structural topology design problems with local stress and displacement constraints

In this paper, we present a hierarchical optimization method for finding feasible true 0–1 solutions to finite‐element‐based topology design problems. The topology design problems are initially modelled as non‐convex mixed 0–1 programs. The hierarchical optimization method is applied to the problem of minimizing the weight of a structure subject to displacement and local design‐dependent stress constraints. The method iteratively treats a sequence of problems of increasing size of the same type as the original problem. The problems are defined on a design mesh which is initially coarse and then successively refined as needed. At each level of design mesh refinement, a neighbourhood optimization method is used to treat the problem considered. The non‐convex topology design problems are equivalently reformulated as convex all‐quadratic mixed 0–1 programs. This reformulation enables the use of methods from global optimization, which have only recently become available, for solving the problems in the sequence. Numerical examples of topology design problems of continuum structures with local stress and displacement constraints are presented. Copyright © 2006 John Wiley & Sons, Ltd.     

An entropy-based three-stage approach for multi-objective system reliability optimization considering uncertainty

This article presents a three-stage approach for solving multi-objective system reliability optimization problems considering uncertainty. The reliability of each component is considered in the formulation as a component reliability estimate in the form of an interval value and discrete values. Component reliability may vary owing to variations in the usage scenarios. Uncertainty is described by defining a set of usage scenarios. To address this problem, an entropy-based approach to the redundancy allocation problem is proposed in this study to identify the deterministic reliability of each component. In the second stage, a multi-objective evolutionary algorithm (MOEA) is applied to produce a Pareto-optimal solution set. A hybrid algorithm based on k-means and silhouettes is performed to select representative solutions in the third stage. Finally, a numerical example is presented to illustrate the performance of the proposed approach.     

Reliability Analysis Using Chaotic Particle Swarm Optimization

Reliability analysis is an important and practical way of considering uncertainty in an engineering system. In practical engineering, the limit state functions are usually implicit in terms of random variables. Traditional reliability analysis methods are time‐consuming and require derivative computing. In this paper, particle swarm optimization (PSO) is applied to reliability analysis by combining it with the first‐order reliability method. To improve the global search performance, chaotic PSO (CPSO) was proposed by combining PSO with a chaotic system. CPSO‐based reliability analysis is described and applied to four classic examples. The results show that implementation of CPSO‐based reliability analysis is easy and can yield a reliability index and design point with good accuracy. The proposed method was applied to analyze the reliability of a circular tunnel in different cases. The results show that the CPSO algorithm is very efficient at solving global optimization problems and is a good approach for reliability analysis. Copyright © 2014 John Wiley & Sons, Ltd.