Reliability Optimization by Considering Time‐Dependent Reliability for Components

Reliability optimization is an important and challenging topic both in engineering and industrial situations as its objective is to design a highly reliable system that operates more safely and efficiently under constraints. Redundancy allocation problem (RAP), as one of the most well‐known problems in reliability optimization, has been the subject of many studies over the past few decades. RAP aims to find the best structure and the optimal redundancy level for each subsystem. The main goal in RAP is to maximize the overall system reliability considering some constraints. In all the previous RAP studies, the reliability of the components is considered constant during the system's mission time. However, reliability is time‐dependent and needs to be considered and monitored during the system's lifetime. In this paper, the reliability of components is considered as a function of time, and the RAP is reformulated by introducing a new criterion called ‘mission design life’ defined as the integration of the system reliability function during the mission time. We propose an efficient algorithm for this problem and demonstrate its performance using two examples. Furthermore, we demonstrate the importance of the new approach using a benchmark problem in RAP. Copyright © 2017 John Wiley & Sons, Ltd.     

Topology optimization of fluid problems using genetic algorithm assisted by the Kriging model

A non‐gradient‐based approach for topology optimization using a genetic algorithm is proposed in this paper. The genetic algorithm used in this paper is assisted by the Kriging surrogate model to reduce computational cost required for function evaluation. To validate the non‐gradient‐based topology optimization method in flow problems, this research focuses on two single‐objective optimization problems, where the objective functions are to minimize pressure loss and to maximize heat transfer of flow channels, and one multi‐objective optimization problem, which combines earlier two single‐objective optimization problems. The shape of flow channels is represented by the level set function. The pressure loss and the heat transfer performance of the channels are evaluated by the Building‐Cube Method code, which is a Cartesian‐mesh CFD solver. The proposed method resulted in an agreement with previous study in the single‐objective problems in its topology and achieved global exploration of non‐dominated solutions in the multi‐objective problems. © 2016 The Authors International Journal for Numerical Methods in Engineering Published by John Wiley & Sons Ltd     

Multi-objective optimization of generalized reliability design problems using feature models—A concept for early design stages

Reliability optimization problems such as the redundancy allocation problem (RAP) have been of considerable interest in the past. However, due to the restrictions of the design space formulation, they may not be applicable in all practical design problems. A method with high modelling freedom for rapid design screening is desirable, especially in early design stages. This work presents a novel approach to reliability optimization. Feature modelling, a specification method originating from software engineering, is applied for the fast specification and enumeration of complex design spaces. It is shown how feature models can not only describe arbitrary RAPs but also much more complex design problems. The design screening is accomplished by a multi-objective evolutionary algorithm for probabilistic objectives. Comparing averages or medians may hide the true characteristics of this distributions. Therefore the algorithm uses solely the probability of a system dominating another to achieve the Pareto optimal set. We illustrate the approach by specifying a RAP and a more complex design space and screening them with the evolutionary algorithm.     

Robust structural damage identification based on multi‐objective optimization

Inverse analysis for structural damage identification often involves an optimization process that minimizes the discrepancies between the computed responses and the measured responses. Conventional single‐objective optimization approach defines the objective function by combining multiple error terms into a single one, which leads to a weaker constraint in solving the identification problem. A multi‐objective approach is proposed, which minimizes multiple error terms simultaneously. Its non‐domination‐based convergence provides a stronger constraint that enables robust identification of damages with lower false‐negative detection rate. Another merit of the proposed approach is quantified confidence in damage detection through processing Pareto‐optimal solutions. Numerical examples that simulate static testing are provided to compare the proposed approach with conventional formulation based on single‐objective optimization. Copyright © 2009 John Wiley & Sons, Ltd.     

A non‐dominance‐based online stopping criterion for multi‐objective evolutionary algorithms

A non‐dominance criterion‐based metric that tracks the growth of an archive of non‐dominated solutions over a few generations is proposed to generate a convergence curve for multi‐objective evolutionary algorithms (MOEAs). It was observed that, similar to single‐objective optimization problems, there were significant advances toward the Pareto optimal front in the early phase of evolution while relatively smaller improvements were obtained as the population matured. This convergence curve was used to terminate the MOEA search to obtain a good trade‐off between the computational cost and the quality of the solutions. Two analytical and two crashworthiness optimization problems were used to demonstrate the practical utility of the proposed metric. Copyright © 2010 John Wiley & Sons, Ltd.     

Coupling ant colony and the degraded ceiling algorithm for the redundancy allocation problem of series–parallel systems

The redundancy allocation problem (RAP) is a well known NP-hard problem which involves the selection of elements and redundancy levels to maximize system reliability given various system-level constraints. As telecommunications and internet protocol networks, manufacturing and power systems are becoming more and more complex, while requiring short developments schedules and very high reliability, it is becoming increasingly important to develop efficient solutions to the RAP. This paper presents an efficient algorithm to solve this reliability optimization problem. The idea of a heuristic approach design is inspired from the ant colony meta-heuristic optimization method and the degraded ceiling local search technique. Our hybridization of the ant colony meta-heuristic with the degraded ceiling performs well and is competitive with the best-known heuristics for redundancy allocation. Numerical results for the 33 test problems from previous research are reported and compared. The solutions found by our approach are all better than or are in par with the well-known best solutions.     

Intelligent interactive multiobjective optimization method and its application to reliability optimization

In most practical situations involving reliability optimization, there are several mutually conflicting goals such as maximizing the system reliability and minimizing the cost, weight and volume. This paper develops an effective multiobjective optimization method, the Intelligent Interactive Multiobjective Optimization Method (IIMOM). In IIMOM, the general concept of the model parameter vector is proposed. From a practical point of view, a designer's preference structure model is built using Artificial Neural Networks (ANNs) with the model parameter vector as the input and the preference information articulated by the designer over representative samples from the Pareto frontier as the desired output. Then with the ANN model of the designer's preference structure as the objective, an optimization problem is solved to search for improved solutions and guide the interactive optimization process intelligently. IIMOM is applied to the reliability optimization problem of a multi-stage mixed system with five different value functions simulating the designer in the solution evaluation process. The results illustrate that IIMOM is effective in capturing different kinds of preference structures of the designer, and it provides a complete and effective solution for medium- and small-scale multiobjective optimization problems.     

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.     

Practical solutions for multi-objective optimization: An application to system reliability design problems

For multiple-objective optimization problems, a common solution methodology is to determine a Pareto optimal set. Unfortunately, these sets are often large and can become difficult to comprehend and consider. Two methods are presented as practical approaches to reduce the size of the Pareto optimal set for multiple-objective system reliability design problems. The first method is a pseudo-ranking scheme that helps the decision maker select solutions that reflect his/her objective function priorities. In the second approach, we used data mining clustering techniques to group the data by using the k-means algorithm to find clusters of similar solutions. This provides the decision maker with just k general solutions to choose from. With this second method, from the clustered Pareto optimal set, we attempted to find solutions which are likely to be more relevant to the decision maker. These are solutions where a small improvement in one objective would lead to a large deterioration in at least one other objective. To demonstrate how these methods work, the well-known redundancy allocation problem was solved as a multiple objective problem by using the NSGA genetic algorithm to initially find the Pareto optimal solutions, and then, the two proposed methods are applied to prune the Pareto set.     

Redundancy allocation for series-parallel systems using a max-min approach

The redundancy allocation problem is formulated with the objective of maximizing the minimum subsystem reliability for a series-parallel system. This is a new problem formulation that offers several distinct benefits compared to traditional problem formulations. Since time-to-failure of the system is dictated by the minimum subsystem time-to-failure, a logical design strategy is to increase the minimum subsystem reliability as high as possible, given constraints on the system. For some system design problems, a preferred design objective may be to maximize the minimum subsystem reliability. Additionally, the max-min formulation can serve as a useful and efficient surrogate for optimization problems to maximize system reliability. This is accomplished by sequentially solving a series of max-min subproblems by fixing the minimum subsystem reliability to create a new problem. For this new formulation, it becomes possible to linearize the problem and use integer programming methods to determine system design configurations that allow mixing of functionally equivalent component types within a subsystem. This is the first time the mixing of component types has been addressed using integer programming. The methodology is demonstrated on three problems.     

Multi-objective genetic algorithm for solving N-version program design problem

N-version programming (NVP) is a programming approach for constructing fault tolerant software systems. Generally, an optimization model utilized in NVP selects the optimal set of versions for each module to maximize the system reliability and to constrain the total cost to remain within a given budget. In such a model, while the number of versions included in the obtained solution is generally reduced, the budget restriction may be so rigid that it may fail to find the optimal solution. In order to ameliorate this problem, this paper proposes a novel bi-objective optimization model that maximizes the system reliability and minimizes the system total cost for designing N-version software systems. When solving multi-objective optimization problem, it is crucial to find Pareto solutions. It is, however, not easy to obtain them. In this paper, we propose a novel bi-objective optimization model that obtains many Pareto solutions efficiently.We formulate the optimal design problem of NVP as a bi-objective 0–1 nonlinear integer programming problem. In order to overcome this problem, we propose a Multi-objective genetic algorithm (MOGA), which is a powerful, though time-consuming, method to solve multi-objective optimization problems. When implementing genetic algorithm (GA), the use of an appropriate genetic representation scheme is one of the most important issues to obtain good performance. We employ random-key representation in our MOGA to find many Pareto solutions spaced as evenly as possible along the Pareto frontier. To pursue improve further performance, we introduce elitism, the Pareto-insertion and the Pareto-deletion operations based on distance between Pareto solutions in the selection process.The proposed MOGA obtains many Pareto solutions along the Pareto frontier evenly. The user of the MOGA can select the best compromise solution among the candidates by controlling the balance between the system reliability and the total cost.     

Reliability‐based design optimization with equality constraints

Equality constraints have been well studied and widely used in deterministic optimization, but they have rarely been addressed in reliability‐based design optimization (RBDO). The inclusion of an equality constraint in RBDO results in dependency among random variables. Theoretically, one random variable can be substituted in terms of remaining random variables given an equality constraint; and the equality constraint can then be eliminated. However, in practice, eliminating an equality constraint may be difficult or impossible because of complexities such as coupling, recursion, high dimensionality, non‐linearity, implicit formats, and high computational costs. The objective of this work is to develop a methodology to model equality constraints and a numerical procedure to solve a RBDO problem with equality constraints. Equality constraints are classified into demand‐based type and physics‐based type. A sequential optimization and reliability analysis strategy is used to solve RBDO with physics‐based equality constraints. The first‐order reliability method is employed for reliability analysis. The proposed method is illustrated by a mathematical example and a two‐member frame design problem. Copyright © 2007 John Wiley & Sons, Ltd.     

A human‐like numerical technique for design of engineering systems

Because of the necessity for considering various creative and engineering design criteria, optimal design of an engineering system results in a highly‐constrained multi‐objective optimization problem. Major numerical approaches to such optimal design are to force the problem into a single objective function by introducing unjustifiable additional parameters and solve it using a single‐objective optimization method. Due to its difference from human design in process, the resulting design often becomes completely different from that by a human designer. This paper presents a novel numerical design approach, which resembles the human design process. Similar to the human design process, the approach consists of two steps: (1) search for the solution space of the highly‐constrained multi‐objective optimization problem and (2) derivation of a final design solution from the solution space. Multi‐objective gradient‐based method with Lagrangian multipliers (MOGM‐LM) and centre‐of‐gravity method (CoGM) are further proposed as numerical methods for each step. The proposed approach was first applied to problems with test functions where the exact solutions are known, and results demonstrate that the proposed approach can find robust solutions, which cannot be found by conventional numerical design approaches. The approach was then applied to two practical design problems. Successful design in both the examples concludes that the proposed approach can be used for various design problems that involve both the creative and engineering design criteria. Copyright © 2005 John Wiley & Sons, Ltd.     

Enhanced multiobjective particle swarm optimization in combination with adaptive weighted gradient-based searching

This article proposes a new multiobjective optimization method for structural problems based on multiobjective particle swarm optimization (MOPSO). A gradient-based optimization method is combined with MOPSO to alleviate constraint-handling difficulties. In this method, a group of particles is divided into two groups—a dominated solution group and a non-dominated solution group. The gradient-based method, utilizing a weighting coefficient method, is applied to the latter to conduct local searching that yields superior non-dominated solutions. In order to enhance the efficiency of exploration in a multiple objective function space, the weighting coefficients are adaptively assigned considering the distribution of non-dominated solutions. A linear optimization problem is solved to determine the optimal weighting coefficients for each non-dominated solution at each iteration. Finally, numerical and structural optimization problems are solved by the proposed method to verify the optimization efficiency.     

Reliability‐based topology optimization of structures under stress constraints

In this paper, we propose an approach for reliability‐based design optimization where a structure of minimum weight subject to reliability constraints on the effective stresses is sought. The reliability‐based topology optimization problem is formulated by using the performance measure approach, and the sequential optimization and reliability assessment method is employed. This strategy allows for decoupling the reliability‐based topology optimization problem into 2 steps, namely, deterministic topology optimization and reliability analysis. In particular, the deterministic structural optimization problem subject to stress constraints is addressed with an efficient methodology based on the topological derivative concept together with a level‐set domain representation method. The resulting algorithm is applied to some benchmark problems, showing the effectiveness of the proposed approach.     

Tabu search‐based approach to multi‐objective machine‐part cell formation

The machine‐part cell formation with respect to multiple objectives has been an attractive search topic since 1990 and many methodologies have been applied to consider simultaneously more than one objective. However, the majority of these works unify the various objectives into a single objective. The final result of such an approach is a compromise solution, whose non‐dominance is not guaranteed. A Pareto‐optimality‐based multi‐objective tabu search (MOTS) algorithm is presented for the machine‐part grouping problems with multiple objectives: it minimizes the total cost, which includes intra‐ and inter‐cell transportation cost and machine investment cost, minimizing the intra‐cell loading unbalance and minimizing the inter‐cell loading unbalance. A new approach is developed to maintain the archive storing non‐dominated solutions produced by the tabu search. The comparisons and analysis show that the proposed algorithm has considerable promise in multi‐objective cell design.     

A geometrical‐based contact algorithm using a barrier method

Most methods employed in the numerical solution of contact problems in finite element simulations rely on equality‐based optimization methods. Typically, a gap function which is non‐differentiable at the point of contact is used in these kind of approaches. The gap function can be seen as the Macaulay bracket of some distance function, where the latter is differentiable at the point of contact. In this article, we propose to use the distance function directly instead of using the gap function. This will give rise to a formulation involving inequality constraints. This approach eliminates the artificially introduced non‐differentiability. To this end we propose a barrier algorithm as the method of choice to solve the problem. The method originates in optimization literature, where convergence proofs for the method are available. Copyright © 2001 John Wiley & Sons, Ltd.     

Synergy of ICA and MCDM for multi‐response optimisation problems

Of late, attempts are being made to optimise production system problems by minimum cost. A good available device in this area is response surface methodology. This methodology combines experimental designs and statistical techniques for empirical model building and optimising. In most situations simulated models for real world problems are non‐linear multi‐response, while responses are conflicting. The simultaneous optimisation of several conflicting responses is computationally expensive. So this makes the problem solving extremely complex. Since few attempts have been made to scrutinise this domain, in this paper the nonlinear continuous multi‐response problem is investigated. In order to tackle multi‐response optimisation difficulties, we propose a new hybrid meta heuristic based on the imperialist competitive algorithm. It simulates a socio–economical procedure, imperialistic competition. When there are some non‐dominated solutions in searching space, a technique for order performance by similarity to ideal solution is used to identify which non‐dominated solutions are imperialists and which ones belong to colonial societies. A particle swarm‐like mechanism is employed to model the influence of imperialists on colonies. The algorithm will continue until only one imperialist obtains all countries’ possessions. In order to prevent carrying out extensive experiments to find optimum parameters of the algorithm, we apply the Taguchi approach. Since there is no standard benchmark in this field, we use three case studies from distinguished papers in the multi‐response optimisation field. Comparing the results with some works mentioned in the literature reveals the superiority of the proposed algorithm.     

Algorithm developments for optimization problems with joint reliability constraints

We propose an algorithm for optimization under uncertainty with joint reliability constraints. Most existing research formulates constraints of random variables/parameters in probabilistic forms such that the probability of individual constraint satisfaction must be higher than a reliability target. However, engineering problems generally define reliability as the probability of satisfying constraints ‘jointly’ rather than individually. Calculating a joint reliability value requires a multiple integration over the feasible domain. This calculation is in most realistic cases impractical by use of exact methods and has become the major challenge in optimization. In this research we propose a filter‐based sequential quadratic programming algorithm with joint reliability constraints approximated by their upper bounds. This upper bound can be obtained analytically by considering the current design location, the reliability of satisfying each constraint, and the angles between every constraint pair. To further improve the efficiency of the algorithm, active‐set strategies are implemented such that intense reliability calculations only required for constraints that are likely to be active. The rest of the constraints are approximated to the level needed to understand whether constraints might become active in the next iteration. The efficiency of the proposed method enables the applications to general complex engineering problems. Copyright © 2010 John Wiley & Sons, Ltd.