Optimization of imperfect preventive maintenance for multi-state systems

The paper generalizes a preventive maintenance optimization problem to multi-state systems, which have a range of performance levels. Multi-state system reliability is defined as the ability to satisfy given demand. The reliability of system elements is characterized by their hazard functions. The possible preventive maintenance actions are characterized by their ability to affect the effective age of equipment. An algorithm is developed which obtains the sequence of maintenance actions providing system functioning with the desired level of reliability during its lifetime by minimum maintenance cost.To evaluate multi-state system reliability, a universal generating function technique is applied. A genetic algorithm (GA) is used as an optimization technique. Basic GA procedures adapted to the given problem are presented. Examples of the determination of optimal preventive maintenance plans are demonstrated.     

Optimal separation of elements in vulnerable multi-state systems

In this paper we consider vulnerable systems, which can have different states corresponding to different combinations of available elements composing the system. Each state can be characterized by a system performance rate, which is the quantitative measure of a system’s ability to perform its task. Both the impact of external factors (attack) and internal causes (failures) affect system survivability, which is determined as probability of meeting a given demand.One of the ways to enhance system survivability is to separate elements with the same functionality (parallel elements). Since system elements can have different performance rates and different availability, the way in which they are separated strongly affects system survivability. In this paper we formulate the problem of how to separate the elements of series-parallel system in order to achieve a maximal possible level of system survivability by the limited cost.An algorithm based on the universal moment generating function method is suggested for determination of the vulnerable series-parallel multi-state system survivability. A genetic algorithm is used as optimization tool in order to solve the structure optimization problem.     

Optimizing survivability of vulnerable series–parallel multi-state systems

In this paper we consider vulnerable systems which can have different states corresponding to different combinations of available elements composing the system. Each state can be characterized by a system performance rate, which is the quantitative measure of a system's ability to perform its task. Both the impact of external factors (attack) and internal causes (failures) affect system survivability which is determined as probability of meeting a given demand.We formulate the problem of finding structure of series–parallel multi-state system (including choice of system elements, their separation and protection) in order to achieve a desired level of system survivability by the minimal cost.An algorithm based on the universal generating function method is suggested for determination of the vulnerable series–parallel multi-state system survivability. A genetic algorithm is used as optimization tool in order to solve the structure optimization problem.     

Structure optimization of multi-state system with time redundancy

In this article, a multi-state system with time redundancy where each system element has its own operation time is considered. In addition, the system total task must be performed during the restricted time. The reliability optimization problem is treated as finding the minimal cost system structure subject to the reliability constraint. A method for reliability optimization for systems with time redundancy is proposed. This method is based on the universal generating function technique for the reliability index computation and on genetic algorithm for the optimization. It provides a solution for the optimization problem for the complex series–parallel system and for the system with bridge topology. Two types of systems will illustrate the approach: systems with ordinary hot reserve and systems with work sharing between elements connected in parallel. Numerical examples are also given.     

Allocation of test times in multi-state systems for reliability growth testing

This paper generalizes a reliability growth test allocation problem to series-parallel multi-state systems. An algorithm, which determines the testing time for each system element in order to maximize the entire system reliability when total testing resources are limited, is suggested. The algorithm can handle both repairable and non-repairable multi-state systems. The Crow/AMSAA reliability growth model is used to evaluate the influence of testing time on the reliability of the elements composing the system. System reliability is defined as the ability of the system to satisfy variable demand represented by a cumulative demand curve. To evaluate multi-state system reliability, a universal generating function technique is applied. A Genetic Algorithm (GA) is used as an optimization technique. The basic GA procedures adapted to the given problem are presented. Examples of the determination of reliability growth test plans are demonstrated.     

Optimal allocation of elements in a linear multi-state sliding window system

This paper proposes a new model that generalizes the consecutive k-out-of-r-from-n:F system to multi-state case. In this model (named linear multi-state sliding window system) the system consists of n linearly ordered multi-state elements. Each element can have different states: from complete failure up to perfect functioning. A performance rate is associated with each state. The system fails if the sum of the performance rates of any r consecutive elements is lower than a demand W.An algorithm is suggested that finds the order of elements with different characteristics within linear multi-state sliding window system, which provides the greatest possible system reliability. The algorithm is based on using a universal generating function technique for system reliability evaluation. A genetic algorithm is used as the optimization tool. Illustrative examples are presented.     

A combined approach to solve the redundancy optimization problem for multi-state systems under repair policies

This paper combines universal moment generating function technique with stochastic Petri nets to solve the redundancy optimization problem for multi-state systems under repair policies. Redundant elements are included in order to achieve a desirable level of production availability. The elements of the system are characterized by their cost, performance and availability. These elements are chosen from a list of products available on the market. The number of repair teams is less than the number of reparable elements, and a repair policy specifies the maintenance priorities between the system elements. A heuristic is proposed to determine the minimal cost system configuration under availability constraints. This heuristic, first applies universal moment generating function technique to evaluate the system availability, assuming unlimited maintenance resources. Once a preliminary solution is found by the optimization algorithm, stochastic Petri nets are used to model different repair policies, and to find the best system configuration (architecture and number of repairmen) in terms of global performance (availability and cost). This combined procedure is applied to a reference example.     

Harmony search algorithm: application to the redundancy optimization problem

The redundancy optimization problem is a well known NP-hard problem which involves the selection of elements and redundancy levels to maximize system performance, given different system-level constraints. This article presents an efficient algorithm based on the harmony search algorithm (HSA) to solve this optimization problem. The HSA is a new nature-inspired algorithm which mimics the improvization process of music players. Two kinds of problems are considered in testing the proposed algorithm, with the first limited to the binary series–parallel system, where the problem consists of a selection of elements and redundancy levels used to maximize the system reliability given various system-level constraints; the second problem for its part concerns the multi-state series–parallel systems with performance levels ranging from perfect operation to complete failure, and in which identical redundant elements are included in order to achieve a desirable level of availability. Numerical results for test problems from previous research are reported and compared. The results of HSA showed that this algorithm could provide very good solutions when compared to those obtained through other approaches.     

Minmax defense strategy for complex multi-state systems

This paper presents a general optimization methodology that merges game theory and multi-state system survivability theory. The defender has multiple alternatives of defense strategy that presumes separation and protection of system elements. The attacker also has multiple alternatives of its attack strategy based on a combination of different possible attack actions against different groups of system elements. The defender minimizes, and the attacker maximizes, the expected damage caused by the attack (taking into account the unreliability of system elements and the multi-state nature of complex series-parallel systems). The problem is defined as a two-period minmax non-cooperative game between the defender who moves first and the attacker who moves second. An exhaustive minmax optimization algorithm is presented based on a double-loop genetic algorithm for determining the solution. A universal generating function technique is applied for evaluating the losses caused by system performance reduction. Illustrative examples with solutions are presented.     

Consecutive sliding window systems

This paper proposes a new model that generalizes the linear multi-state sliding window system to the case of m consecutive overlapping windows. In this model the system consists of n linearly ordered multi-state elements. Each element can have different states: from complete failure up to perfect functioning. A performance rate is associated with each state. The system fails if in each of at least m consecutive overlapping groups of r consecutive elements (windows) the sum of the performance rates of elements belonging to the group is lower than a minimum allowable level. An algorithm for system reliability evaluation is suggested which is based on an extended universal moment generating function. Examples of evaluating system reliability and elements' reliability importance indices are presented.     

Optimal structure of fault-tolerant software systems

This paper considers software systems consisting of fault-tolerant components. These components are built from functionally equivalent but independently developed versions characterized by different reliability and execution time. Because of hardware resource constraints, the number of versions that can run simultaneously is limited. The expected system execution time and its reliability (defined as probability of obtaining the correct output within a specified time) strictly depend on parameters of software versions and sequence of their execution. The system structure optimization problem is formulated in which one has to choose software versions for each component and find the sequence of their execution in order to achieve the greatest system reliability subject to cost constraints. The versions are to be chosen from a list of available products. Each version is characterized by its reliability, execution time and cost.The suggested optimization procedure is based on an algorithm for determining system execution time distribution that uses the moment generating function approach and on the genetic algorithm. Both N-version programming and the recovery block scheme are considered within a universal model. Illustrated example is presented.     

Multi-state component criticality analysis for reliability improvement in multi-state systems

This paper evaluates and implements composite importance measures (CIM) for multi-state systems with multi-state components (MSMC). Importance measures are frequently used as a means to evaluate and rank the impact and criticality of individual components within a system yet they are less often used as a guide to prioritize system reliability improvements. For multi-state systems, previously developed measures sometimes are not appropriate and they do not meet all user needs. This study has two inter-related goals: first, to distinguish between two types of importance measures that can be used for evaluating the criticality of components in MSMC with respect to multi-state system reliability, and second, based on the CIM, to develop a component allocation heuristic to maximize system reliability improvements. The heuristic uses Monte-Carlo simulation together with the max-flow min-cut algorithm as a means to compute component CIM. These measures are then transformed into a cost-based composite metric that guides the allocation of redundant elements into the existing system. Experimental results for different system complexities show that these new CIM can effectively estimate the criticality of components with respect to multi-state system reliability. Similarly, these results show that the CIM-based heuristic can be used as a fast and effective technique to guide system reliability improvements.     

Optimizing survivability of multi-state systems with multi-level protection by multi-processor genetic algorithm

In this paper we consider vulnerable systems which can have different states corresponding to different combinations of available elements composing the system. Each state can be characterized by a performance rate, which is the quantitative measure of a system's ability to perform its task. Both the impact of external factors (stress) and internal causes (failures) affect system survivability, which is determined as probability of meeting a given demand.In order to increase the survivability of the system, a multi-level protection is applied to its subsystems. This means that a subsystem and its inner level of protection are in their turn protected by the protection of an outer level. This double-protected subsystem has its outer protection and so forth. In such systems, the protected subsystems can be destroyed only if all of the levels of their protection are destroyed. Each level of protection can be destroyed only if all of the outer levels of protection are destroyed.We formulate the problem of finding the structure of series–parallel multi-state system (including choice of system elements, choice of structure of multi-level protection and choice of protection methods) in order to achieve a desired level of system survivability by the minimal cost. An algorithm based on the universal generating function method is used for determination of the system survivability. A multi-processor version of genetic algorithm is used as optimization tool in order to solve the structure optimization problem. An application example is presented to illustrate the procedure presented in this paper.     

Extended great deluge algorithm for the imperfect preventive maintenance optimization of multi-state systems

This paper deals with preventive maintenance optimization problem for multi-state systems (MSS). This problem was initially addressed and solved by Levitin and Lisnianski [Optimization of imperfect preventive maintenance for multi-state systems. Reliab Eng Syst Saf 2000;67:193–203]. It consists on finding an optimal sequence of maintenance actions which minimizes maintenance cost while providing the desired system reliability level. This paper proposes an approach which improves the results obtained by genetic algorithm (GENITOR) in Levitin and Lisnianski [Optimization of imperfect preventive maintenance for multi-state systems. Reliab Eng Syst Saf 2000;67:193–203]. The considered MSS have a range of performance levels and their reliability is defined to be the ability to meet a given demand. This reliability is evaluated by using the universal generating function technique. An optimization method based on the extended great deluge algorithm is proposed. This method has the advantage over other methods to be simple and requires less effort for its implementation. The developed algorithm is compared to than in Levitin and Lisnianski [Optimization of imperfect preventive maintenance for multi-state systems. Reliab Eng Syst Saf 2000;67:193–203] by using a reference example and two newly generated examples. This comparison shows that the extended great deluge gives the best solutions (i.e. those with minimal costs) for 8 instances among 10.     

A heuristic for solving the redundancy allocation problem for multi-state series-parallel systems

The redundancy allocation problem is formulated with the objective of minimizing design cost, when the system exhibits a multi-state reliability behavior, given system-level performance constraints. When the multi-state nature of the system is considered, traditional solution methodologies are no longer valid. This study considers a multi-state series-parallel system (MSPS) with capacitated binary components that can provide different multi-state system performance levels. The different demand levels, which must be supplied during the system-operating period, result in the multi-state nature of the system. The new solution methodology offers several distinct benefits compared to traditional formulations of the MSPS redundancy allocation problem. For some systems, recognizing that different component versions yield different system performance is critical so that the overall system reliability estimation and associated design models the true system reliability behavior more realistically. The MSPS design problem, solved in this study, has been previously analyzed using genetic algorithms (GAs) and the universal generating function. The specific problem being addressed is one where there are multiple component choices, but once a component selection is made, only the same component type can be used to provide redundancy. This is the first time that the MSPS design problem has been addressed without using GAs. The heuristic offers more efficient and straightforward analyses. Solutions to three different problem types are obtained illustrating the simplicity and ease of application of the heuristic without compromising the intended optimization needs.     

Holistic reliability analysis of weighted voting systems from a multi-state perspective

The computation of the reliability of weighted voting systems is an important problem in reliability theory due to its potential application in security, target identification, safety and monitoring areas. Voting systems are used in a wide variety of applications where an acceptance or rejection decision has to be made about a binary proposition presented to the system. For these systems, it is of interest to obtain the probability so that based on the vote of decision-making units, the system aggregates these votes into the right decision when presented with such a proposition. This paper presents a holistic work on weighted voting system reliability by presenting modeling, computation, estimation and optimization techniques. The modeling part takes advantage of the structure of weighted voting systems to present a model of its reliability as a multi-state system. Next, based on the multi-state view of the system, an exact computational approach based on multi-state minimal cut and path vectors is introduced. The paper then acknowledges the computational complexity of the problem and provides a Monte Carlo simulation approach that estimates system reliability accurately and in an efficient computational time. Finally, an optimization heuristic that generates quasi-optimal solutions is presented that is able to solve the problem of maximizing the reliability of a weighted voting system based on a specified number of decision-making units with known reliability characteristics.     

Multi-state systems with multi-fault coverage

The paper introduces a new model of fault level coverage for multi-state systems in which the effectiveness of recovery mechanisms depends on the coexistence of multiple faults in related elements. Examples of this effect can be found in computing systems, electrical power distribution networks, pipelines carrying dangerous materials, etc. For evaluating reliability and performance indices of multi-state systems with imperfect multi-fault coverage, a modification of the generalized reliability block diagram (RBD) method is suggested. This method, based on a universal generating function technique, allows performance distribution of complex multi-state series–parallel system with multi-fault coverage to be obtained using a straightforward recursive procedure. Illustrative examples are presented.     

Multi-objective optimization of linear multi-state multiple sliding window system

This paper considers the optimal element sequencing in a linear multi-state multiple sliding window system that consists of n linearly ordered multi-state elements. Each multi-state element can have different states: from complete failure up to perfect functioning. A performance rate is associated with each state. The failure of type i in the system occurs if for any i (1≤i≤I) the cumulative performance of any r_i consecutive elements is lower than w_i. The element sequence strongly affects the probability of any type of system failure. The sequence that minimizes the probability of certain type of failure can provide high probability of other types of failures. Therefore the optimization problem for the multiple sliding window system is essentially multi-objective. The paper formulates and solves the multi-objective optimization problem for the multiple sliding window systems. A multi-objective Genetic Algorithm is used as the optimization engine. Illustrative examples are presented.     

An evaluation of the multi-state node networks reliability using the traditional binary-state networks reliability algorithm

A system where the components and system itself are allowed to have a number of performance levels is called the Multi-state system (MSS). A multi-state node network (MNN) is a generalization of the MSS without satisfying the flow conservation law. Evaluating the MNN reliability arises at the design and exploitation stage of many types of technical systems. Up to now, the known existing methods can only evaluate a special MNN reliability called the multi-state node acyclic network (MNAN) in which no cyclic is allowed. However, no method exists for evaluating the general MNN reliability. The main purpose of this article is to show first that each MNN reliability can be solved using any the traditional binary-state networks (TBSN) reliability algorithm with a special code for the state probability. A simple heuristic SDP algorithm based on minimal cuts (MC) for estimating the MNN reliability is presented as an example to show how the TBSN reliability algorithm is revised to solve the MNN reliability problem. To the author's knowledge, this study is the first to discuss the relationships between MNN and TBSN and also the first to present methods to solve the exact and approximated MNN reliability. One example is illustrated to show how the exact MNN reliability is obtained using the proposed algorithm.     

Redundancy analysis for repairable multi-state system by using combined stochastic processes methods and universal generating function technique

This paper discusses a type of redundancy that is typical in a multi-state system. It considers two interconnected multi-state systems where one multi-state system can satisfy its own stochastic demand and also can provide abundant resource (performance) to another system in order to improve the assisted system reliability. Traditional methods are usually not effective enough for reliability analysis for such multi-state systems because of the “dimensional curse” problem. This paper presents a new method for reliability evaluation for the repairable multi-state system considering such kind of redundancy. The proposed method is based on the combination of the universal generating function technique and random processes methods. The numerical example is presented to illustrate the proposed method.