Choice Of Redundancy Strategies Research Articles

An exact Markov chain model for reliability–redundancy allocation problem with a choice of redundancy strategy

An exact Markov chain model for reliability–redundancy allocation problem with a choice of redundancy strategy

Reliability optimization for non-repairable series-parallel systems with a choice of redundancy strategies and heterogeneous components: Erlang time-to-failure distribution

The redundancy allocation problem (RAP) of non-repairable series-parallel systems considering cold standby components and imperfect switching mechanism has been traditionally formulated with the objective of maximizing a lower bound on system reliability instead of exact system reliability. This objective function has been considered due to the difficulty of determining a closed-form expression for the system reliability equation. But, the solution that maximizes the lower bound for system reliability does not necessarily maximize exact system reliability and thus, the obtained system reliability may be far from the optimal reliability. This article attempts to overcome the mentioned drawback. Under the assumption that component time-to-failure is distributed according to an Erlang distribution and switch time-to-failure is exponentially distributed, a closed-form expression for the subsystem cold standby reliability equation is derived by solving an integrodifference equation. A semi-analytical expression is also derived for the reliability equation of a subsystem with mixed redundancy strategy. The accuracy and the correctness of the derived equations are validated analytically. Using these equations, the RAP of non-repairable series-parallel systems with a choice of redundancy strategies is formulated. The proposed mathematical model maximizes exact system reliability at mission time given system design constraints. Unlike most of the previous formulations, the possibility of using heterogeneous components in each subsystem is provided so that the active components can be of one type and the standby ones of the other. The results of an illustrative example demonstrate the high performance of the proposed model in determining optimal design configuration and increasing system reliability.

Water cycle algorithm for solving the reliability-redundancy allocation problem with a choice of redundancy strategies

This paper proposes a new mathematical model for the reliability-redundancy allocation problem (RRAP) with a choice of redundancy strategies. To maximize the reliability of a system, this model chooses the best redundancy strategy from among both active and standby ones for each subsystem. For those with a standby strategy, a continuous time Markov chain model is used to calculate the exact reliability values. In order to solve the proposed mixed-integer non-linear programing model, a powerful evolutionary algorithm, called water cycle algorithm (WCA), is developed and implemented on three famous benchmark problems. Finally, the results of different benchmark problems are compared with those previously reported to show the superiority of the proposed model and the efficiency of WCA.

Reliability optimization for non-repairable series-parallel systems with a choice of redundancy strategies: Erlang time-to-failure distribution

This article deals with a new redundancy allocation model for non-repairable series-parallel systems with multiple strategy choices. The proposed model simultaneously determines the type of components, number of active and standby components to maximize system reliability subject to design constraints. Traditionally, due to complexity and difficulty in obtaining the closed form version of system reliability, a convenient lower-bound on system reliability has been widely applied to approximate it. Assuming that switching mechanism time-to-failure is exponentially distributed, the closed form version of the reliability of subsystems with cold standby redundancy is derived analytically for the first time. This is successfully performed using Markov process and solving the relevant set of differential-difference equations. With respect to the obtained formulation, a semi-analytical expression for the reliability of subsystems with mixed redundancy strategy is also extracted. Component time-to-failure is assumed to follow an Erlang distribution which is suitable for most engineering design problems. The presented model is linear and in the form of standard zero-one integer programs and thus using integer programming algorithms guarantees optimal solutions. The computational results of solving a well-known example indicate the high performance of the proposed model in improving system reliability.

Redundancy allocation problem for k-out-of-n systems with a choice of redundancy strategies

To increase the reliability of a specific system, using redundant components is a common method which is called redundancy allocation problem (RAP). Some of the RAP studies have focused on k-out-of-n systems. However, all of these studies assumed predetermined active or standby strategies for each subsystem. In this paper, for the first time, we propose a k-out-of-n system with a choice of redundancy strategies. Therefore, a k-out-of-n series–parallel system is considered when the redundancy strategy can be chosen for each subsystem. In other words, in the proposed model, the redundancy strategy is considered as an additional decision variable and an exact method based on integer programming is used to obtain the optimal solution of the problem. As the optimization of RAP belongs to the NP-hard class of problems, a modified version of genetic algorithm (GA) is also developed. The exact method and the proposed GA are implemented on a well-known test problem and the results demonstrate the efficiency of the new approach compared with the previous studies.

Reliability Optimization for Complicated Systems with a Choice of Redundancy Strategies

Reliability Optimization for Complicated Systems with a Choice of Redundancy Strategies

A knowledge-based archive multi-objective simulated annealing algorithm to optimize series–parallel system with choice of redundancy strategies

Redundancy allocation problem (RAP) is one of the best-developed problems in reliability engineering studies. This problem follows to optimize the reliability of a system containing s sub-systems under different constraints, including cost, weight, and volume restrictions using redundant components for each sub-system. Various solving methodologies have been used to optimize this problem, including exact, heuristic, and meta-heuristic algorithms. In this paper, an efficient multi-objective meta-heuristic algorithm based on simulated annealing (SA) is developed to solve multi-objective RAP (MORAP). This algorithm is knowledge-based archive multi-objective simulated annealing (KBAMOSA). KBAMOSA applies a memory matrix to reinforce the neighborhood structure to achieve better quality solutions. The results analysis and comparisons demonstrate the performance of the proposed algorithm for solving MORAP.

Minimum–Maximum regret redundancy allocation with the choice of redundancy strategy and multiple choice of component type under uncertainty

This paper deals with a redundancy allocation problem in series–parallel systems with the choice of redundancy strategy, including active and cold standby strategies in which component’s time to failure follows an Erlang distribution. The scale parameter of Erlang distribution and consequently the reliability of each component are imprecise in terms of interval data, and only the lower and upper bounds are known. This problem, for the first time, is formulated through Min–Max regret criterion, which is commonly used to define robust solutions. The resulting problem formulation contains an unlimited number of constraints, and a Benders’ decomposition method is implemented to deal with the given problem. This method is compared with an enumeration method to show its effectiveness. The performance of the proposed model using the Benders’ decomposition method is examined over different problem sizes, and the associated results are analyzed.

Interval programming for the redundancy allocation with choices of redundancy strategy and component type under uncertainty: Erlang time to failure distribution

Engineering design problems involve meeting system’s performance requirements such as reliability which is in close relation to appropriate selection of components and determination of a system level architecture. In this paper a new nonlinear redundancy allocation model with the choice of redundancy strategy and component types is presented. The redundancy strategies can be in forms of active and cold standby. Also there is a choice for no redundancy strategy. We assume that time to failure follows Erlang distribution which is parameterized in terms of shape and scale parameters which are usually determined deterministically. In this paper we release the deterministic assumption of the scale parameter since in reality the estimation of this parameter accompanies with uncertainty. Also, the cost and weights are not known exactly due to estimation uncertainties and fluctuations. The uncertain proposed model maximizes the system’s reliability, which is converted into a deterministic multi-objective model maximizing left bound and center of intervals. Finally, a numerical example is presented to show the performance of the proposed method.

An efficient simulated annealing algorithm for the redundancy allocation problem with a choice of redundancy strategies

The redundancy allocation problem (RAP) is an important reliability optimization problem. This paper studies a specific RAP in which redundancy strategies are chosen. To do so, the choice of the redundancy strategies among active and cold standby is considered as decision variables. The goal is to select the redundancy strategy, component, and redundancy level for each subsystem such that the system reliability is maximized. Since RAP is a NP-hard problem, we propose an efficient simulated annealing algorithm (SA) to solve it. In addition, to evaluating the performance of the proposed algorithm, it is compared with well-known algorithms in the literature for different test problems. The results of the performance analysis show a relatively satisfactory efficiency of the proposed SA algorithm.

Multi-objective reliability optimization of series-parallel systems with a choice of redundancy strategies

This paper proposes a variant of the Non-dominated Sorting Genetic Algorithm (NSGA-II) to solve a novel mathematical model for multi-objective redundancy allocation problems (MORAP). Most researchers about redundancy allocation problem (RAP) have focused on single objective optimization, while there has been some limited research which addresses multi-objective optimization. Also all mathematical multi-objective models of general RAP assume that the type of redundancy strategy for each subsystem is predetermined and known a priori. In general, active redundancy has traditionally received greater attention; however, in practice both active and cold-standby redundancies may be used within a particular system design. The choice of redundancy strategy then becomes an additional decision variable. Thus, the proposed model and solution method are to select the best redundancy strategy, type of components, and levels of redundancy for each subsystem that maximizes the system reliability and minimize total system cost under system-level constraints. This problem belongs to the NP-hard class. This paper presents a second-generation Multiple-Objective Evolutionary Algorithm (MOEA), named NSGA-II to find the best solution for the given problem. The proposed algorithm demonstrates the ability to identify a set of optimal solutions (Pareto front), which provides the Decision Maker (DM) with a complete picture of the optimal solution space. After finding the Pareto front, a procedure is used to select the best solution from the Pareto front. Finally, the advantages of the presented multi-objective model and of the proposed algorithm are illustrated by solving test problems taken from the literature and the robustness of the proposed NSGA-II is discussed.

A bi-objective model to optimize reliability and cost of system with a choice of redundancy strategies

Reliability problems are an important type of optimization problems that are motivated by different needs of real-world applications such as telecommunication systems, transformation systems, and electrical systems, so on. This paper studies a special type of these problems which is called redundancy allocation problem (RAP) and develops a bi-objective RAP (BORAP). The model includes non-repairable series–parallel systems in which the redundancy strategy is considered as a decision variable for individual subsystems. The objective functions of the model are (1) maximizing system reliability and (2) minimizing the system cost. Meanwhile, subject to system-level constraint, the best redundancy strategy among active or cold-standby, component type, and the redundancy level for each subsystem should be determined. To have a more practical model, we have also considered non-constant component hazard functions and imperfect switching of cold-standby redundant component. To solve the model, since RAP belong to the NP-hard class of the optimization problems, two effective multi-objective metaheuristic algorithms named non-dominated sorting genetic algorithms (NSGA-II) and multi-objective particle swarm optimization (MOPSO) are proposed. Finally, the performance of the algorithms is analyzed on a typical case and conclusions are demonstrated.

Reliability optimization of series-parallel systems with a choice of redundancy strategies using a genetic algorithm

This paper proposes a genetic algorithm (GA) for a redundancy allocation problem for the series-parallel system when the redundancy strategy can be chosen for individual subsystems. Majority of the solution methods for the general redundancy allocation problems assume that the redundancy strategy for each subsystem is predetermined and fixed. In general, active redundancy has received more attention in the past. However, in practice both active and cold-standby redundancies may be used within a particular system design and the choice of the redundancy strategy becomes an additional decision variable. Thus, the problem is to select the best redundancy strategy, component, and redundancy level for each subsystem in order to maximize the system reliability under system-level constraints. This belongs to the NP-hard class of problems. Due to its complexity, it is so difficult to optimally solve such a problem by using traditional optimization tools. It is demonstrated in this paper that GA is an efficient method for solving this type of problems. Finally, computational results for a typical scenario are presented and the robustness of the proposed algorithm is discussed.

Maximization of System Reliability with a Choice of Redundancy Strategies

Optimal solutions to the redundancy allocation problem are determined when either active or cold-standby redundancy can be selectively chosen for individual subsystems. This problem involves the selection of components and redundancy levels to maximize system reliability. Previously, solutions to the problem could only be found if analysts were restricted to a predetermined redundancy strategy for the complete system. Generally, it had been assumed that active redundancy was to be used. However, in practice both active and cold-standby redundancy may be used within a particular system design and the choice of redundancy strategy becomes an additional decision variable. Available optimization algorithms are inadequate for these design problems and better alternatives are required. The methodology presented here is specifically developed to accommodate the case where there is a choice of redundancy strategy. The problem is formulated with imperfect sensing and switching of cold-standby redundant components and k -Erlang distributed time-to-failure. Optimal solutions to the problem are found by an equivalent problem formulation and integer programming. The methodology is demonstrated on a well-known test problem with interesting results. The optimal system design is distinctly different from the corresponding design obtained with only active redundancy. The availability of this tool can result in more reliable and cost-effective engineering designs.

The positive management of redundancy survivors: issues and lessons

Examines the concerns of survivors who remain in organizations following redundancies. Categorizes the issues which arise from these concerns and uncertainties into three categories: issues which arise following notification of forthcoming redundancies; issues arising from the notification of those affected; and issues following notification and termination of contract. Based on in‐depth interviews with senior human resource practitioners in 40 organizations, utilizes organizational practices and learning to explore the management of these issues. Recognizes the relationship between choice of redundancy strategy and the nature of the issues which arise. Argues that while organizations may be concerned with the needs of redundant staff, this will be insufficient to address the concerns and uncertainties of survivors. Also evaluates organizational practices aimed at building survivors′ commitment in the longer term. Argues that while organizations are attempting to recast their culture and their employment ...