# Fuzzy Multiobjective Reliability Optimization Problem of Industrial Systems Using Particle Swarm Optimization

Authors: Harish Garg
Journal: Journal of Industrial Mathematics
 (2013)

---

## Abstract

The present work investigates the reliability optimization problem of the repairable industrial
systems by utilizing uncertain, limited, and imprecise data. In many practical situations where reliability enhancement is involved, the decision making is complicated because of the presence of several mutually conflicting objectives. Moreover, data collected or available for the systems are vague, ambiguous, qualitative, and imprecise in nature due to various practical constraints and hence create some difficulties in optimizing the design problems. To handle these problems, this work presents an interactive method for solving the fuzzy multiobjective optimization decision-making problem, which can be used for the optimization decision making of the reliability with two or more objectives. Based on the preference of the decision makers toward the objectives, fuzzy multi-objective optimization problem is converted into crisp optimization problem and then solved with evolutionary algorithm. The proposed approach has been applied to the decomposition unit of a urea fertilizer plant situated in the northern part of India producing 1500–2000 metric tons per day.


---

## Body

## 1. Introduction

Reliability in general can be defined as the ability of a system to perform its required functions under stated conditions for a specified period of time. Reliability technology is an important phenomenon and is widely used for increasing the efficiency, risk analysis, production availability studies, and design of industrial systems. The industrial systems run continuously and suffer failure over a period of time which can be brought back in to service by proper repair or replacement. Consequently, it may be extremely difficult, if it is not possible to construct accurate and complete mathematical model for the system in order to access the reliability because of inadequate knowledge about the basic failure events [1, 2]. In highly competitive industrial market, the concept of failure analysis is an unavoidable fact in complex industrial systems. Reliability of such systems not only depends on the reliability of each element of these systems but also depends on occurrence of sequence of failures.Generally, the design problems are always stated in precise mathematical forms. It must be recognized that many practical problems encountered by designers and decision makers would take place in an environment in which the statements might be vague or imprecise. Usually, it is difficult to describe the goals and constraints of such optimization problems by crisp relations through equations and/or descriptions. In such situations, the traditional reliability theory, based on probabilistic and binary state assumptions, does not always provide useful information to the practitioners due to the limitation of being able to handle only quantitative information [3–5]. An alternative for this fuzzy set theory [6] can build a model to represent a subjective estimation of possible effect of the given values on the problem and permit the incorporation of vagueness in the conventional set theory that can be used to deal with uncertainty quantitatively. Due to incomplete and uncertain input information, mathematical models of such problems are developed in fuzzy environment, and the optimization problem under consideration becomes a fuzzy programming problem. The fuzzy set-based optimization was firstly introduced by Bellman and Zadeh [7] in their seminal paper on decision making in a fuzzy environment, in which the concepts of fuzzy constraint, fuzzy objective, and fuzzy decision were introduced. After this pioneering work, these concepts were subsequently profusely used and applied by many investigators. In most of the practical design situation, the presence of several conflicting objectives which are nonlinear and ambiguous complicates the reliability apportionment. For instance, a designer is required to minimize the system cost while simultaneously maximizing the system reliability. Therefore, multiobjective functions become an important aspect in the reliability design of the engineering systems, and hence various researchers [8–15] used different methods to solve reliability optimization problem in fuzzy environment.In multiobjective optimization problems (MOOPs), it is difficult or rarely possible to find an optimal solution for all the objectives which simultaneously optimize the problem in fuzzy environment. For handling such types of situations, one usually tries to search for a solution which is as close to the decision makers (DMs) expectations as possible. For this  reason, problem is solved is an interactive manner in which DM is initially asked to specify his or her preferences towards the objectives. Based on these preferences, the problem is solved, and the DM is provided with a possible solution. If the DM is satisfied with this solution, the problem ends there; otherwise, he or she is asked to modify his or her preferences in the light of the earlier obtained results. This iterative procedure is continued till a satisfactory solution is achieved which is close to DM’s expectations.The present work is an extension of the work earlier done by Sharma and Garg [16] and Kumar [17], in which the cost factor was not considered in mathematical modeling. In this study, a conflicting multiobjective nonlinear programming problem is considered in fuzzy environment where we maximize the reliability and minimize the cost of the system. A conflicting nature between the objectives is resolved with the help of the fuzzy technique. Also, the intention is to use compensatory operator for aggregation of the different fuzzy goals and a robust global optimization technique, namely particle swarm optimization (PSO), for solution of the resultant single objective optimization problem thus formulated with the choice of the DM/system expert regarding the priority amongst the objectives. The technique is explained through a case study of decomposition unit of a fertilizer plant, a complex repairable industrial system. The rest of the chapter is organized as follows. Section 2 describes the general definitions related to multiobjective optimization problem, while corresponding reliability optimization model is given in Section 3. The solution procedure for solving the multiobjective reliability optimization problem is described in Section 4. A system description for illustrating the approach has been given in Section 5, while their corresponding results and analysis are done in Section 6. Finally, some concrete conclusions are drawn and are presented in Section 7.


## 2. A General Multiobjective Nonlinear Programming Problem

A multiobjective nonlinear programming problem is to find the solution vector or vector of design variablesx=(x1,x2,…,xK)T that optimizes a vector of objective functions
(1)f(x)={f1(x),f2(x),…fb(x)}
over the feasible design space X. The problem is modeled as follows (WLOG we assume the minimization):(2)Minimize:f(x)subjectto:hν(x)=0,ν=1,2,…,Igj(x)≤0,j=1,2,…,Jxkl≤xk≤xku,k=1,2,…,K,
where f1(x),f2(x),…,fb(x) are the individual objective functions; hν(x) and gj(x) are equality and inequality constrained functions, respectively. xkl and xku are the lower and upper bounds of decision variable xk, respectively. The concept of optimality in single objective is not directly applicable in MOOPs. For this reason, a classification of the solutions is introduced in terms of Pareto optimality according to the following definitions, in terms of minimization.Definition 1 (Pareto optimal).
A solution vectorx*∈X is Pareto optimal solution if there does not exist another point x∈X such that ft(x)≤ft(x*) for all t=1,2,…,b and fs(x)<fs(x*) for at least one s. Such solutions are also called true Pareto optimal solution.Definition 2 (Pareto dominance).
A dominancex dominates y denoted as x≻y if and only if ft(x)≤ft(y), and thereexistsqs.t.fq(x)<fq(y),t,q∈{1,2,…,b}. If there are no solutions which dominate x, then x is nondominated.Definition 3 (Pareto set).
A set of nondominated solutions{x*∣¬∃x:x≻x*} are said to be a Pareto set.Definition 4 (Pareto front).
The set of vectors in the objective space that are an image of a Pareto set that is{f(x*)∣¬∃x:x≻x*}.In general, there exist a number of Pareto optimal solutions to a multiobjective optimization problems. Due to multiobjectives, the selection of such objectives clearly depends on the problem under study and the decision maker (DM) criteria. Thus, the designer must select a compromise or a satisfying solution from the Pareto optimal solution set according to his or her preference.


## 3. Reliability Optimization Model

Reliability is one of the vital attributes of performance in arriving at the optimal design of a system because it directly and significantly influences the system’s performance. In practical, the problem of system reliability may be formed as a typical nonlinear programming problem with nonlinear costfunctions in fuzzy environment.


### 3.1. Formulation of System Reliability Model

Let us consider that the reliability problem of a system consists ofn components. Each component has reliability Ri for the ith components for i=1,2,…,n. Then, the system reliability is written in the form of reliability of each component as
(3)Rs(R1,R2,…,Rn)={∏i=1n‍Riforseriessystem1-∏i=1n‍(1-Ri)forparallelsystemorcombinationofseriesandparallelsystem.According to Aggarwal and Gupta [18], the cost of reliability is monotonically increasing function of reliability and hence based on the fact that the ith components reliability cost is Ci(Ri). Therefore, the system cost is given by
(4)Cs(R1,R2,…,Rn)=∑i=1n‍Ci(Ri).In reliability optimization problems, it is often required to minimize or maximize several objectives subject to several constraints. For instance, a designer is required to minimize the system cost while simultaneously maximizing the system reliability. Therefore, multiobjective functions become an important aspect in the reliability design of the engineering systems. Hence, the suitable form of optimization model of series system reliability problem by considering the system reliability and cost as objective is(5)Maximize:Rs(R1,R2,…,Rn)={∏i=1n‍Riforseriessystem1-∏i=1n‍(1-Ri)forparallelsystemorcombinationofseriesandparallelsystemMinimize:Cs(R1,R2,…,Rn)=∑i=1n‍Ci(Ri)subjecttoRi,min⩽Ri⩽1,Rs,min⩽Rs⩽1fori=1,2,…,n.


### 3.2. System Reliability Optimization Model in Fuzzy Environment

The necessary features of the cost versus maintainability function are equivalent to the cost versus reliability function as given by Aggarwal and Gupta [18]. It is very complicated decision-making process to determine the reliability components in fuzzy objective as well as constraint goal. It involves many uncertain factors and becomes a nonstochastic vague decision-making process. Therefore, the reliability allocation model (5) can be represented by fuzzy nonlinear programming to make the model more flexible and adoptable to the human decision process. Therefore, in fuzzy environment, the optimization problem (5) becomes
(6)Max~:{Rs,-Cs}subjecttoRi,min⩽Ri⩽1,Rs,min⩽Rs⩽1fori=1,2,…,n.
The symbol Max~ denotes a relaxed or fuzzy version of “Max.”


## 3.1. Formulation of System Reliability Model

Let us consider that the reliability problem of a system consists ofn components. Each component has reliability Ri for the ith components for i=1,2,…,n. Then, the system reliability is written in the form of reliability of each component as
(3)Rs(R1,R2,…,Rn)={∏i=1n‍Riforseriessystem1-∏i=1n‍(1-Ri)forparallelsystemorcombinationofseriesandparallelsystem.According to Aggarwal and Gupta [18], the cost of reliability is monotonically increasing function of reliability and hence based on the fact that the ith components reliability cost is Ci(Ri). Therefore, the system cost is given by
(4)Cs(R1,R2,…,Rn)=∑i=1n‍Ci(Ri).In reliability optimization problems, it is often required to minimize or maximize several objectives subject to several constraints. For instance, a designer is required to minimize the system cost while simultaneously maximizing the system reliability. Therefore, multiobjective functions become an important aspect in the reliability design of the engineering systems. Hence, the suitable form of optimization model of series system reliability problem by considering the system reliability and cost as objective is(5)Maximize:Rs(R1,R2,…,Rn)={∏i=1n‍Riforseriessystem1-∏i=1n‍(1-Ri)forparallelsystemorcombinationofseriesandparallelsystemMinimize:Cs(R1,R2,…,Rn)=∑i=1n‍Ci(Ri)subjecttoRi,min⩽Ri⩽1,Rs,min⩽Rs⩽1fori=1,2,…,n.


## 3.2. System Reliability Optimization Model in Fuzzy Environment

The necessary features of the cost versus maintainability function are equivalent to the cost versus reliability function as given by Aggarwal and Gupta [18]. It is very complicated decision-making process to determine the reliability components in fuzzy objective as well as constraint goal. It involves many uncertain factors and becomes a nonstochastic vague decision-making process. Therefore, the reliability allocation model (5) can be represented by fuzzy nonlinear programming to make the model more flexible and adoptable to the human decision process. Therefore, in fuzzy environment, the optimization problem (5) becomes
(6)Max~:{Rs,-Cs}subjecttoRi,min⩽Ri⩽1,Rs,min⩽Rs⩽1fori=1,2,…,n.
The symbol Max~ denotes a relaxed or fuzzy version of “Max.”


## 4. Interactive Methods for Solving Multiobjective Reliability Optimization Problems

Multiobjective optimization is intensively used in engineering applications for simultaneously optimizing the collection of objective functions systematically. In general, reliability optimization problem is solved with the assumption that the coefficients or cost of components is specified in a precise way. In real life, there are many diverse situations due to uncertainty in judgments, lack of evidence, and so forth such that there are incompleteness and unreliability of input information, and hence it is not possible to get relevant precise data for the reliability system. These types of impreciseness in data are well handled with the help of defining their membership functions by fuzzy set theory instead of representing by random variable. Thus, due to these, the concerned optimization problems are modeled in fuzzy environment, and hence the problem under consideration becomes a fuzzy programming problem. But in a multiobjective optimization problem, an optimal solution which simultaneously optimizes all the objectives, and that too when the problem is modeled in a fuzzy environment, is rarely possible. In such situations, one usually tries to search for the best possible solution in the presence of imprecise information which is as close to the DM’s expectations as possible. Search of such a satisfying solution requires solving the multiobjective fuzzy optimization problem iteratively in an interactive manner, wherein the DM is initially asked to specify his or her preferences and expectations. Based on these preferences, the problem is solved, and the DM is provided with a possible solution. If the DM is satisfied with this solution, the problem ends there; otherwise, he or she is asked to modify his or her preferences in the light of the earlier obtained results. This iterative procedure is continued till a satisfactory solution is achieved which is close to DM’s expectations. The detail of the computational procedure for solving the fuzzy multiobjective reliability optimization problem in an iterative way is described in the following steps.Step 1 (find the ideal and anti-ideal values of each objective function).
First step in the proposed technique is to find the minimal and maximal feasible values of the objective functions. For this reason each objective function has been solved separately by taking single objective optimization problem under given set of constraints. The corresponding solutions thus obtained are known as ideal solutions. Based on these solutions, (R1* and R2*), minimal and maximal values of each objective are calculated as
(7)Rsl=min{Rs(R1*),Rs(R2*)},Rsu=max{Rs(R1*),Rs(R2*)},Csl=min{Cs(R1*),Cs(R2*)},Csu=max{Cs(R1*),Cs(R2*)},
where R1* and R2* are the ideal solutions of the objective functions corresponding to minimization and maximization, respectively.Step 2 (establishing the fuzzy goals towards the objective functions).
In the traditional optimization, the design feasibility is considered as either satisfied or violated. For many engineering applications, the transition from infeasibility to feasibility is not obvious, because of not only the vague information in the design constraints but also the factors that can affect the design scenario, such as designer’s knowledge, manufacture precision, and material properties. For this reason, they are modeled in such a way that the transition from infeasible state to feasible state is smooth and gradual with subjectivity. To incorporate the DM’s vague idea about in which region of the objective the optimum should be, the degree of fuzziness is used. Essentially, the approach is to translate the functions to a common scale [0,1] by the means of mathematical transformations, combine them using the geometric mean, and optimize the overall metric. In this paper, the problem is fuzzified with the help of linear membership functions. Let R~s and C~s be the fuzzy region of satisfaction of system reliability (Rs) and system cost (Cs), respectively, and let μRs and μCs be their corresponding membership functions. Then, the fuzzy objective stated by a designer can be quantified by eliciting corresponding linear membership functions, using the minimal and maximal feasible values of each objective as obtained during Step 1, and is defined as.
For maximization goal (Rs)
(8)μRs(x)={1,Rs(x)⩾RsuRs(x)-RslRsu-Rsl,Rsl⩽Rs(x)⩽Rsu0,Rs(x)⩽Rsl.
Here, μRs(x) is strictly monotonically increasing function of Rs(x).
For minimization goal (Cs)
(9)μCs(x)={1,Cs(x)⩽CslCsu-Cs(x)Csu-Csl,Csl⩽Cs(x)⩽Csu0,Cs(x)⩾Csu.
Here, μCs(x) is strictly monotonically decreasing function of Cs(x).Step 3 (equivalent single optimization problem).
Using the achieved objectives’ membership functions ofRs and Cs, it is very important to choose the aggregation operator. Even since Zadeh [6] suggested that ∧, that is, min be used for the intersection of fuzzy sets as
(10)μD=μRs∧μCs.
The two objectives μRs and μCs in (10) are equally important. This is not true in a real-life situation; that is, DMs sometimes do not pay equal attention to these two objectives. Owing to this (10), is modified, according to the importance of the objective, by Huang [11] as
(11)μD=(1∧μRsw1)∧(1∧μCsw2),
where w1 and w2∈[0,1] are called the objective weights. Thus, using the achieved objectives’ membership functions and DM/system expert preferences in the form of weights W=[w1,w2], problem is formulated as a single objective optimization problem and is given as
(12)Maximize:μD(x)=(1∧μRs(x)w1)∧(1∧μCs(x)w2),Subjecttoxkl≤xk≤xku,k=1,2,…,K,wt∈[0,1],t=1,2,
where ∧ indicates the intersection or min operator, wt represents the tth objective weight, in the form of the importance of the objective functions, suggested by DM, x is the vector of decision variables, and xkl and xku are the lower and upper bounds of decision vector xk, respectively. The obtained optimization problem is solved with the particle swarm optimization algorithm which has been described in Section 4.1.Step 4 (adjusting the preference parameters).
If the DM is satisfied by the solution obtained in Step3, then the approach stops successfully. Otherwise, the key preference parameters, that is, decision maker’s preferences regarding the relative importance of each objective function (W=[w1,w2]), can be altered to meet the DM’s choice, and the method again goes back to Step 3. The process is repeated until DM is satisfied. We are just showing one run of the approach here as we assume that in this problem DM is satisfied by the results obtained in Step 3.


### 4.1. A Survey of PSO Algorithm

The particle swarm optimization (PSO) algorithm was firstly proposed by Kennedy and Eberhart [19, 20] and has deserved some attention during the last years in the global optimization field. PSO algorithm is based on the population of agents or particles and tries to simulate its social behavior in optimal exploration of problem space. The PSO algorithm is inspired by social behavior of bird flocking, animal hording, or fish schooling. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. PSO is initialized with a group of random particles (solutions) and then searches for optima by updating generations. During every iteration, each particle is updated by following two “best” values. The first one is the position vector of the best solution (fitness), this particle has achieved so far. The fitness value is also stored. This position is called pbest. Another “best” position that is tracked by the particle swarm optimizer is the best position, obtained so far by any particle in the population. This best position is the current global best and is called gbest. After finding the two best values, the particle updates its velocity and position according to (13) and (14), respectively,
(13)vk+1i=w*vki+c1*ud*(pbesti-xki)+c2*Ud*(gbestk-xki),(14)xk+1i=xki+vk+1i,
where vki is the velocity of ith particle at the kth iteration and xki is currently the solution (or position) of the ith particle. ud and Ud are random numbers generated uniformly between 0 and 1. c1 is the self-confidence (cognitive) factor, and c2 is the swarm confidence (social) factor. Finally, w is the inertia factor that takes linearly decreasing values downward according to a predefined number of iterations. The first term in (13) represents the effect of the inertia of the particle, the second term represents the particle memory influence, and the third term represents the swarm (society) influence. The algorithm for the PSO can be summarized as follows. (1)
Initialize the swarmxi, the position of particles is randomly initialized within the hypercube of feasible space.(2)
Set iteration counterk=1.(3)
Evaluate the performancef of each particle, using its current position xi.(4)
Compare the performance of each individual to its best performance so far. Iff(xi)<f(pbesti), then f(pbesti)=f(xi), pbesti=xi.(5)
Compare the performance of each particle to the global best particle. Iff(xi)<f(gbest), then f(gbest)=f(xi), gbest=xi.(6)
Update the velocity of the particle according to (13).(7)
Move each particle to a new position using (14).(8)
Update iteration counter by 1; that is,k=k+1.(9)
Go to Step3, and repeat until convergence.


## 4.1. A Survey of PSO Algorithm

The particle swarm optimization (PSO) algorithm was firstly proposed by Kennedy and Eberhart [19, 20] and has deserved some attention during the last years in the global optimization field. PSO algorithm is based on the population of agents or particles and tries to simulate its social behavior in optimal exploration of problem space. The PSO algorithm is inspired by social behavior of bird flocking, animal hording, or fish schooling. In PSO, the potential solutions, called particles, fly through the problem space by following the current optimum particles. PSO is initialized with a group of random particles (solutions) and then searches for optima by updating generations. During every iteration, each particle is updated by following two “best” values. The first one is the position vector of the best solution (fitness), this particle has achieved so far. The fitness value is also stored. This position is called pbest. Another “best” position that is tracked by the particle swarm optimizer is the best position, obtained so far by any particle in the population. This best position is the current global best and is called gbest. After finding the two best values, the particle updates its velocity and position according to (13) and (14), respectively,
(13)vk+1i=w*vki+c1*ud*(pbesti-xki)+c2*Ud*(gbestk-xki),(14)xk+1i=xki+vk+1i,
where vki is the velocity of ith particle at the kth iteration and xki is currently the solution (or position) of the ith particle. ud and Ud are random numbers generated uniformly between 0 and 1. c1 is the self-confidence (cognitive) factor, and c2 is the swarm confidence (social) factor. Finally, w is the inertia factor that takes linearly decreasing values downward according to a predefined number of iterations. The first term in (13) represents the effect of the inertia of the particle, the second term represents the particle memory influence, and the third term represents the swarm (society) influence. The algorithm for the PSO can be summarized as follows. (1)
Initialize the swarmxi, the position of particles is randomly initialized within the hypercube of feasible space.(2)
Set iteration counterk=1.(3)
Evaluate the performancef of each particle, using its current position xi.(4)
Compare the performance of each individual to its best performance so far. Iff(xi)<f(pbesti), then f(pbesti)=f(xi), pbesti=xi.(5)
Compare the performance of each particle to the global best particle. Iff(xi)<f(gbest), then f(gbest)=f(xi), gbest=xi.(6)
Update the velocity of the particle according to (13).(7)
Move each particle to a new position using (14).(8)
Update iteration counter by 1; that is,k=k+1.(9)
Go to Step3, and repeat until convergence.


## 5. Illustrative Example

To illustrate, a fertilizer plant situated in the northern part of India and producing approximately 1500–2000 metric tons per day has been considered as a main system [17]. The brief description of the system is given below.


### 5.1. System Description

The fertilizer plants are large, complex, and repairable engineering unit which is a combination of ammonia and urea plant. The urea plant is composed of synthesis, decomposition, crystallization, and prilling system, arranged in predetermined configuration [16, 17]. In this process, the ammonia and CO2 enter the urea synthesis reactor. The reactants from urea synthesis reactor enter the urea decomposer in which urea is separated from reactants. These are further sent to urea crystallizer in which the urea solution is concentrated and crystallized. The urea crystals are separated by centrifuge and conveyed pneumatically to the top of urea prilling system. In this system, urea crystals are melted and sprayed through distributers and fall down in urea prilling tower against the ascending air allowing getting prilled on the way. The prilled urea is collected at the bottom of urea prilling, system and sent to bagging section. Among the various functional units in the plant such as urea synthesis, urea decomposition, urea crystallization, urea prilling and urea recovery, urea decomposition is one of the most important and vital functional processes which is the subject of our discussion.


### 5.2. Decomposition System

The gas-liquid mixture (urea, NH3, CO2, Biuret) flows from a reactor at 126°C into the upper part of a high-pressure decomposer, where the flashed gases are separated. The liquid falls through a sieve plate, which comes into contact with high-temperature gas available from the reboiler and the falling film heater. The same process is repeated in a low-pressure absorber. In the reboiler, the liquid is further heated to 151°C with medium-pressure steam, so that the remaining ammonia and carbonate are released as gases. The solution is then further heated to 165°C in the falling film heater, which reduces the Biuret formation and hydrolysis of urea. The overhead gases from the high-pressure decomposer go to the high-pressure absorber cooler. The liquid flows to the top of the low-pressure absorber and is cooled in a heat exchanger. Additional flashing of the solution takes place in the upper part of the low-pressure absorber to reduce the solution pressure from 17.5 to 2.5 kg/cm2. The low-pressure absorber has four sieve trays and a packed bed. In the packed bed, the remaining ammonia is stripped off by CO2 gas. The overhead gases go to the low-pressure absorber cooler, in which the pressure is controlled at 2.2 kg/cm2. Most of the excess ammonia and carbonate are separated from the solution flowing to the gas separator. The gas separator has two parts: (a) the upper part is at 105°C and 0.3 kg/cm2; here the remaining small amounts of ammonia and CO2 are recovered by reducing the pressure; the sensible heat of solution is enough to vaporize these gases; (b) the lower part has a packed section at 110°C and atmospheric pressure. Air containing a small amount of ammonia and CO2 is fed off from the gas absorber by an off-gas blower to remove the remaining small amounts of ammonia and CO2 present on the solution. Off-gases from the lower and upper parts are mixed and fed to the off-gas condenser. The urea solution, concentrated to 70–75%, is fed to a crystallizer. In brief, the various subsystems and the components associated with them are defined as below. (i)
SubsystemAi has two units. Unit A1 is called the reboiler for the high-pressure absorber, and unit A2 is called the falling film heater for the low-pressure absorber. Failure of A1 or A2 causes complete failure of the system.(ii)
SubsystemBi has two units in series. Unit B1 is called high-pressure absorber, and B2 is called low-pressure absorber (the component contained of sieve trays and packed bed for tripping off the remaining ammonia). Failure of either unit causes the failure of whole system.(iii)
SubsystemC, the gas separator, has one unit only (used to separate the gases obtained from pressure absorbers. The solution is fed to crystallization unit for further processing) arranged in series with B1 and B2.(iv)
SubsystemEi has two units in series that is E1 and E2 where E1 is low-pressure heat exchanger, and E2 is high-pressure heat exchanger with standby unit (the heat exchangers are used to recover the heat of the gases). Failure of both at a time will cause complete failure of the system.The schematic diagram of the system is shown in Figure1. The data related to main components of the system, in the form of failure rate (λi’s) and repair time (τi’s), is collected from the historical or available records of the industry and is integrated with expertise of maintenance personnel which is given in Table 1 [16].Table 1
Input data for decomposition system.
Components→
Reboiler
Falling film pressure
Absorber
Gas separator
Heat exchanger
High pressure
Low pressure
Low pressure
High pressure
Failure rateλi (hrs−1)
4.154 ×10-4
3.952 ×10-4
1.592 ×10-4
4.783 ×10-4
2.612 ×10-4
6.956 ×10-4
6.264 ×10-4
Repair timeτi (hrs)
3.1746
2.6421
3.3323
4.7619
4.899
4.6831
6.2310Figure 1
Schematic diagram of the decomposition unit.


### 5.3. Reliability Optimization Problem

The multiobjective reliability optimization problem for the considered system is formulated by taking systems reliability and cost as an objective and crisp failure rates (λi’s) and repair times (τi’s) as decision variables under the considered ±15% uncertainty level or support towards the data as
(15)MaximizeRs=exp(-λst).MinimizeCs=∑j=17‍{ajlog(11-exp(-λjt))+bj}s.t.(1-s)xk≤xk≤(1+s)xk,xk=[λ1,λ2,…,λ7,τ1,τ2,…,τ7]T,λ3=λ4=λ5=λ6;λ7=λ8;λ9=λ10,τ3=τ4=τ5=τ6;τ7=τ8;τ9=τ10,t=10,s=0.15(considereduncertaintylevel),
where λs is the system failure rate whose expression is given by
(16)λs=λ1+λ2+λ3+λ4+λ5+λ6λ7(τ6+τ7).
The different values for the parameters aj(j=1,2,…,7) are 24, 8, 8.75, 7.14, 3.33, 18, and 18, respectively, and for bj(j=1,2,…,7) are 120, 80, 70, 50, 30, 50, and 50, respectively, are chosen randomly.


## 5.1. System Description

The fertilizer plants are large, complex, and repairable engineering unit which is a combination of ammonia and urea plant. The urea plant is composed of synthesis, decomposition, crystallization, and prilling system, arranged in predetermined configuration [16, 17]. In this process, the ammonia and CO2 enter the urea synthesis reactor. The reactants from urea synthesis reactor enter the urea decomposer in which urea is separated from reactants. These are further sent to urea crystallizer in which the urea solution is concentrated and crystallized. The urea crystals are separated by centrifuge and conveyed pneumatically to the top of urea prilling system. In this system, urea crystals are melted and sprayed through distributers and fall down in urea prilling tower against the ascending air allowing getting prilled on the way. The prilled urea is collected at the bottom of urea prilling, system and sent to bagging section. Among the various functional units in the plant such as urea synthesis, urea decomposition, urea crystallization, urea prilling and urea recovery, urea decomposition is one of the most important and vital functional processes which is the subject of our discussion.


## 5.2. Decomposition System

The gas-liquid mixture (urea, NH3, CO2, Biuret) flows from a reactor at 126°C into the upper part of a high-pressure decomposer, where the flashed gases are separated. The liquid falls through a sieve plate, which comes into contact with high-temperature gas available from the reboiler and the falling film heater. The same process is repeated in a low-pressure absorber. In the reboiler, the liquid is further heated to 151°C with medium-pressure steam, so that the remaining ammonia and carbonate are released as gases. The solution is then further heated to 165°C in the falling film heater, which reduces the Biuret formation and hydrolysis of urea. The overhead gases from the high-pressure decomposer go to the high-pressure absorber cooler. The liquid flows to the top of the low-pressure absorber and is cooled in a heat exchanger. Additional flashing of the solution takes place in the upper part of the low-pressure absorber to reduce the solution pressure from 17.5 to 2.5 kg/cm2. The low-pressure absorber has four sieve trays and a packed bed. In the packed bed, the remaining ammonia is stripped off by CO2 gas. The overhead gases go to the low-pressure absorber cooler, in which the pressure is controlled at 2.2 kg/cm2. Most of the excess ammonia and carbonate are separated from the solution flowing to the gas separator. The gas separator has two parts: (a) the upper part is at 105°C and 0.3 kg/cm2; here the remaining small amounts of ammonia and CO2 are recovered by reducing the pressure; the sensible heat of solution is enough to vaporize these gases; (b) the lower part has a packed section at 110°C and atmospheric pressure. Air containing a small amount of ammonia and CO2 is fed off from the gas absorber by an off-gas blower to remove the remaining small amounts of ammonia and CO2 present on the solution. Off-gases from the lower and upper parts are mixed and fed to the off-gas condenser. The urea solution, concentrated to 70–75%, is fed to a crystallizer. In brief, the various subsystems and the components associated with them are defined as below. (i)
SubsystemAi has two units. Unit A1 is called the reboiler for the high-pressure absorber, and unit A2 is called the falling film heater for the low-pressure absorber. Failure of A1 or A2 causes complete failure of the system.(ii)
SubsystemBi has two units in series. Unit B1 is called high-pressure absorber, and B2 is called low-pressure absorber (the component contained of sieve trays and packed bed for tripping off the remaining ammonia). Failure of either unit causes the failure of whole system.(iii)
SubsystemC, the gas separator, has one unit only (used to separate the gases obtained from pressure absorbers. The solution is fed to crystallization unit for further processing) arranged in series with B1 and B2.(iv)
SubsystemEi has two units in series that is E1 and E2 where E1 is low-pressure heat exchanger, and E2 is high-pressure heat exchanger with standby unit (the heat exchangers are used to recover the heat of the gases). Failure of both at a time will cause complete failure of the system.The schematic diagram of the system is shown in Figure1. The data related to main components of the system, in the form of failure rate (λi’s) and repair time (τi’s), is collected from the historical or available records of the industry and is integrated with expertise of maintenance personnel which is given in Table 1 [16].Table 1
Input data for decomposition system.
Components→
Reboiler
Falling film pressure
Absorber
Gas separator
Heat exchanger
High pressure
Low pressure
Low pressure
High pressure
Failure rateλi (hrs−1)
4.154 ×10-4
3.952 ×10-4
1.592 ×10-4
4.783 ×10-4
2.612 ×10-4
6.956 ×10-4
6.264 ×10-4
Repair timeτi (hrs)
3.1746
2.6421
3.3323
4.7619
4.899
4.6831
6.2310Figure 1
Schematic diagram of the decomposition unit.


## 5.3. Reliability Optimization Problem

The multiobjective reliability optimization problem for the considered system is formulated by taking systems reliability and cost as an objective and crisp failure rates (λi’s) and repair times (τi’s) as decision variables under the considered ±15% uncertainty level or support towards the data as
(15)MaximizeRs=exp(-λst).MinimizeCs=∑j=17‍{ajlog(11-exp(-λjt))+bj}s.t.(1-s)xk≤xk≤(1+s)xk,xk=[λ1,λ2,…,λ7,τ1,τ2,…,τ7]T,λ3=λ4=λ5=λ6;λ7=λ8;λ9=λ10,τ3=τ4=τ5=τ6;τ7=τ8;τ9=τ10,t=10,s=0.15(considereduncertaintylevel),
where λs is the system failure rate whose expression is given by
(16)λs=λ1+λ2+λ3+λ4+λ5+λ6λ7(τ6+τ7).
The different values for the parameters aj(j=1,2,…,7) are 24, 8, 8.75, 7.14, 3.33, 18, and 18, respectively, and for bj(j=1,2,…,7) are 120, 80, 70, 50, 30, 50, and 50, respectively, are chosen randomly.


## 6. Computation Results

This section turns to the description and analysis of the results obtained by the optimization tests.


### 6.1. Parameter Setting

In all algorithms, the values of the common parameters such as population size and total evaluation number are chosen to be the same. Population size and the maximum evaluation number are taken as20×D, where D is dimension of the problem and 1500, respectively, for the function. The method has been implemented in MATLAB (MathWorks); and in order to eliminate stochastic discrepancy, 30 independent runs have been made that involve 30 different initial trial solutions. The termination criterion has been set either limited to a maximum number of generations or to the order of relative error equal to 10-6, whichever is achieved first. The other randomly specified parameters of algorithms are given below.


#### 6.1.1.  GA Settings

In our experiment, real-coded genetic algorithm is utilized to find optimal values. Roulette wheel selection criterion is employed to choose better-fitted chromosomes. One-point crossover with the rate of 0.9 and random point mutation with the rate of 0.01 are used in the present analysis for the reproduction of new solution.


#### 6.1.2.  PSO Settings

Except common parameters (population number and maximum evaluation number), cognitive (c1) and social (c2) components are constants that can be used to change the weighting between personal and population experience, respectively. In our experiments, cognitive and the social components were both set to 1.49. Inertia weight (w), which determines how the previous velocity of the particle influences the velocity in the next iteration, was defined as the linearly decreases from initial weight w1=0.9 to final weight w2=0.4 with the relation w=w2+(itermax-iter)(w1-w2)/itermax where itermax is the maximum number of iteration, and iter is used iteration number [21].


### 6.2. Results and Discussions

The ideal values of the objective functions are given asRsl=0.98046407, Rsu=0.98554720, Csl=1039.731722, and Csu=1065.984110. Based on these ideal values, a fuzzy region of satisfaction corresponding to the objective functions is to be constructed as follows:
(6.2)μCs(x)={1Cs(x)⩽Csl1065.984110-Cs(x)26.252388,Csl⩽Cs(x)≤Csu0Cs(x)⩾Csu,μRs(x)={1Rs(x)⩾RsuRs(x)-0.980464070.00508313,Rsl⩽Rs(x)⩽Rsu0Rs(x)⩽Rsl.Using these constructed membership functions and their weight vector as suggested by DM/system experts corresponding to the two objective functions, the equivalent crisp optimization problem is formulated as follows:(18)Maximize:(1∧μRs(x)w1)∧(1∧μCs(x)w2)s.t.(1-s)xk≤xk≤(1+s)xk,w1,w2∈[0,1].PSO has been used to solve (18) with the initial preference of the weight towards the objectives as W1=[1,1]. Since in the first iteration DM does not want the preference towards the objectives; that is, they pay equal attention towards each objective. Hence, the weight vector is taken as 1 for each objective. Results corresponding to the first iteration are shown in Table 2, which is (Rs,Cs)=(0.98359477,1049.92107) with membership value (μRs,μCs)=(61.59%,61.89%). Not satisfied with this outcome or willing to know other possible optimal solutions, keeping this result in view, let DM be decided to give more importance on reliability objective than cost objective and give a preference weight vector 1 corresponding to reliability and 0.5 to cost; that is, W2=[1,0.5]. In other words, DM wants to pay two times more attention towards the reliability objective than cost objective. Outcome of this iteration is (Rs,Cs)=(0.98451928,1055.59802) with membership value (μRs,μCs)=(79.77%,39.56%). Process is repeated till DM is fully satisfied. In this way, DM obtained the different possible solution for different satisfaction levels. Process is stopped after V iteration (it may continue further till DM is satisfied). Outcome of iteration V is (Rs,Cs)=(0.98255695,1044.58702) with membership value (μRs,μCs)=(41.17%,81.50%). This result shows that 41.17% achievement for reliability and 81.50% for cost of respective fuzzy goals. A comparison of the results listed in the table with the results obtained by GA. It has been seen from the table that the results computed by PSO are better in terms of preferences given by the DM towards the objectives as compared to GA results. Thus, for different preferences suggested by DMs, optimum values of systems’ reliability and cost are achieved. The optimum design parameters of design variables corresponding to optimum values are also summarized in Table 2. Based on these decision variables, the system analyst or decision makers may plan the schedule for proper maintenance in regular interval of time.Table 2
Solution of the reliability optimization problem of decomposition unit.
Iteration
I
II
III
IV
V
DM's specifications
w
1
1
1.0
0.8
0.2
0.5
w
2
1
0.5
0.2
0.8
1.0
Optimal solutions
GA
PSO
GA
PSO
GA
PSO
GA
PSO
GA
PSO
R
s
0.98354732
0.98359477
0.98448525
0.98451928
0.98457160
0.98490067
0.98148708
0.98196024
0.98249201
0.98255695
C
s
1050.08904
1049.92107
1055.41446
1055.59802
1058.82001
1060.22555
1044.65868
1044.40826
1045.18398
1044.58702
μ
R
s
0.60656516
0.61590008
0.79108284
0.79777686
0.80807072
0.87280766
0.20125489
0.29434040
0.39895339
0.41172939
μ
C
s
0.60547141
0.61186965
0.40261657
0.39562458
0.27289344
0.21935346
0.81232320
0.82186227
0.79231361
0.81505298
Components
Decisions variables corresponding to main components of the system
Reboiler
λ
1
0.00039899
0.00042160
0.00039268
0.00040844
0.00036386
0.00036711
0.00045088
0.00047668
0.00047393
0.00047633
τ
1
3.41917961
3.20053049
3.08205706
3.21261946
2.96797346
3.53481960
3.26222415
2.97512622
3.53888380
3.00761187
Failing filmpressure
λ
2
0.00044663
0.00042886
0.00037677
0.00035879
0.00035364
0.00034103
0.00044963
0.00042684
0.00043888
0.00045194
τ
2
2.93743121
2.34624642
2.25336207
2.55005113
2.77588849
2.93459081
2.55655906
2.56886790
2.45037358
2.85729986
High-pressureabsorber
λ
3
0.00016881
0.00016359
0.00015166
0.00014887
0.00013784
0.00013539
0.00017353
0.00016944
0.00015574
0.00017686
τ
3
2.86356110
3.69610183
3.15673746
3.28073616
3.78864854
2.84273867
3.53782239
3.61115141
3.03502479
3.70232160
Low-pressureabsorber
λ
4
0.00041113
0.00040656
0.00041406
0.00040844
0.00045041
0.00041815
0.00052870
0.00048036
0.00041970
0.00040953
τ
4
4.67082848
5.40042764
4.53173006
5.13121490
4.47381088
4.73186495
4.91856082
4.34826476
5.36085440
5.42475860
Gas separator
λ
5
0.00022738
0.00022736
0.00022342
0.00023100
0.00024459
0.00025474
0.00026109
0.00026287
0.00027281
0.00023944
τ
5
5.03045165
4.75765199
5.59215645
4.43617242
5.29292018
5.26627347
5.17559317
5.08274082
5.26603842
4.63483241
Low-pressureheat exchanger
λ
6
0.00078750
0.00079645
0.00079211
0.00079277
0.00075087
0.00073172
0.00072920
0.00078562
0.00079247
0.00079769
τ
6
4.73045809
5.24059032
4.78957351
4.76132947
4.45209374
3.99216974
4.13200468
4.38574566
5.07896810
4.94539576
High-pressureheat exchanger
λ
7
0.00070098
0.00071119
0.00061423
0.00055696
0.00057015
0.00065517
0.00062168
0.00055713
0.00058711
0.00065981
τ
7
6.16937271
5.62696440
5.56932906
5.76412417
6.12199584
6.48829057
6.49184949
5.34442022
6.18770089
5.68156701


## 6.1. Parameter Setting

In all algorithms, the values of the common parameters such as population size and total evaluation number are chosen to be the same. Population size and the maximum evaluation number are taken as20×D, where D is dimension of the problem and 1500, respectively, for the function. The method has been implemented in MATLAB (MathWorks); and in order to eliminate stochastic discrepancy, 30 independent runs have been made that involve 30 different initial trial solutions. The termination criterion has been set either limited to a maximum number of generations or to the order of relative error equal to 10-6, whichever is achieved first. The other randomly specified parameters of algorithms are given below.


### 6.1.1.  GA Settings

In our experiment, real-coded genetic algorithm is utilized to find optimal values. Roulette wheel selection criterion is employed to choose better-fitted chromosomes. One-point crossover with the rate of 0.9 and random point mutation with the rate of 0.01 are used in the present analysis for the reproduction of new solution.


### 6.1.2.  PSO Settings

Except common parameters (population number and maximum evaluation number), cognitive (c1) and social (c2) components are constants that can be used to change the weighting between personal and population experience, respectively. In our experiments, cognitive and the social components were both set to 1.49. Inertia weight (w), which determines how the previous velocity of the particle influences the velocity in the next iteration, was defined as the linearly decreases from initial weight w1=0.9 to final weight w2=0.4 with the relation w=w2+(itermax-iter)(w1-w2)/itermax where itermax is the maximum number of iteration, and iter is used iteration number [21].


## 6.1.1.  GA Settings

In our experiment, real-coded genetic algorithm is utilized to find optimal values. Roulette wheel selection criterion is employed to choose better-fitted chromosomes. One-point crossover with the rate of 0.9 and random point mutation with the rate of 0.01 are used in the present analysis for the reproduction of new solution.


## 6.1.2.  PSO Settings

Except common parameters (population number and maximum evaluation number), cognitive (c1) and social (c2) components are constants that can be used to change the weighting between personal and population experience, respectively. In our experiments, cognitive and the social components were both set to 1.49. Inertia weight (w), which determines how the previous velocity of the particle influences the velocity in the next iteration, was defined as the linearly decreases from initial weight w1=0.9 to final weight w2=0.4 with the relation w=w2+(itermax-iter)(w1-w2)/itermax where itermax is the maximum number of iteration, and iter is used iteration number [21].


## 6.2. Results and Discussions

The ideal values of the objective functions are given asRsl=0.98046407, Rsu=0.98554720, Csl=1039.731722, and Csu=1065.984110. Based on these ideal values, a fuzzy region of satisfaction corresponding to the objective functions is to be constructed as follows:
(6.2)μCs(x)={1Cs(x)⩽Csl1065.984110-Cs(x)26.252388,Csl⩽Cs(x)≤Csu0Cs(x)⩾Csu,μRs(x)={1Rs(x)⩾RsuRs(x)-0.980464070.00508313,Rsl⩽Rs(x)⩽Rsu0Rs(x)⩽Rsl.Using these constructed membership functions and their weight vector as suggested by DM/system experts corresponding to the two objective functions, the equivalent crisp optimization problem is formulated as follows:(18)Maximize:(1∧μRs(x)w1)∧(1∧μCs(x)w2)s.t.(1-s)xk≤xk≤(1+s)xk,w1,w2∈[0,1].PSO has been used to solve (18) with the initial preference of the weight towards the objectives as W1=[1,1]. Since in the first iteration DM does not want the preference towards the objectives; that is, they pay equal attention towards each objective. Hence, the weight vector is taken as 1 for each objective. Results corresponding to the first iteration are shown in Table 2, which is (Rs,Cs)=(0.98359477,1049.92107) with membership value (μRs,μCs)=(61.59%,61.89%). Not satisfied with this outcome or willing to know other possible optimal solutions, keeping this result in view, let DM be decided to give more importance on reliability objective than cost objective and give a preference weight vector 1 corresponding to reliability and 0.5 to cost; that is, W2=[1,0.5]. In other words, DM wants to pay two times more attention towards the reliability objective than cost objective. Outcome of this iteration is (Rs,Cs)=(0.98451928,1055.59802) with membership value (μRs,μCs)=(79.77%,39.56%). Process is repeated till DM is fully satisfied. In this way, DM obtained the different possible solution for different satisfaction levels. Process is stopped after V iteration (it may continue further till DM is satisfied). Outcome of iteration V is (Rs,Cs)=(0.98255695,1044.58702) with membership value (μRs,μCs)=(41.17%,81.50%). This result shows that 41.17% achievement for reliability and 81.50% for cost of respective fuzzy goals. A comparison of the results listed in the table with the results obtained by GA. It has been seen from the table that the results computed by PSO are better in terms of preferences given by the DM towards the objectives as compared to GA results. Thus, for different preferences suggested by DMs, optimum values of systems’ reliability and cost are achieved. The optimum design parameters of design variables corresponding to optimum values are also summarized in Table 2. Based on these decision variables, the system analyst or decision makers may plan the schedule for proper maintenance in regular interval of time.Table 2
Solution of the reliability optimization problem of decomposition unit.
Iteration
I
II
III
IV
V
DM's specifications
w
1
1
1.0
0.8
0.2
0.5
w
2
1
0.5
0.2
0.8
1.0
Optimal solutions
GA
PSO
GA
PSO
GA
PSO
GA
PSO
GA
PSO
R
s
0.98354732
0.98359477
0.98448525
0.98451928
0.98457160
0.98490067
0.98148708
0.98196024
0.98249201
0.98255695
C
s
1050.08904
1049.92107
1055.41446
1055.59802
1058.82001
1060.22555
1044.65868
1044.40826
1045.18398
1044.58702
μ
R
s
0.60656516
0.61590008
0.79108284
0.79777686
0.80807072
0.87280766
0.20125489
0.29434040
0.39895339
0.41172939
μ
C
s
0.60547141
0.61186965
0.40261657
0.39562458
0.27289344
0.21935346
0.81232320
0.82186227
0.79231361
0.81505298
Components
Decisions variables corresponding to main components of the system
Reboiler
λ
1
0.00039899
0.00042160
0.00039268
0.00040844
0.00036386
0.00036711
0.00045088
0.00047668
0.00047393
0.00047633
τ
1
3.41917961
3.20053049
3.08205706
3.21261946
2.96797346
3.53481960
3.26222415
2.97512622
3.53888380
3.00761187
Failing filmpressure
λ
2
0.00044663
0.00042886
0.00037677
0.00035879
0.00035364
0.00034103
0.00044963
0.00042684
0.00043888
0.00045194
τ
2
2.93743121
2.34624642
2.25336207
2.55005113
2.77588849
2.93459081
2.55655906
2.56886790
2.45037358
2.85729986
High-pressureabsorber
λ
3
0.00016881
0.00016359
0.00015166
0.00014887
0.00013784
0.00013539
0.00017353
0.00016944
0.00015574
0.00017686
τ
3
2.86356110
3.69610183
3.15673746
3.28073616
3.78864854
2.84273867
3.53782239
3.61115141
3.03502479
3.70232160
Low-pressureabsorber
λ
4
0.00041113
0.00040656
0.00041406
0.00040844
0.00045041
0.00041815
0.00052870
0.00048036
0.00041970
0.00040953
τ
4
4.67082848
5.40042764
4.53173006
5.13121490
4.47381088
4.73186495
4.91856082
4.34826476
5.36085440
5.42475860
Gas separator
λ
5
0.00022738
0.00022736
0.00022342
0.00023100
0.00024459
0.00025474
0.00026109
0.00026287
0.00027281
0.00023944
τ
5
5.03045165
4.75765199
5.59215645
4.43617242
5.29292018
5.26627347
5.17559317
5.08274082
5.26603842
4.63483241
Low-pressureheat exchanger
λ
6
0.00078750
0.00079645
0.00079211
0.00079277
0.00075087
0.00073172
0.00072920
0.00078562
0.00079247
0.00079769
τ
6
4.73045809
5.24059032
4.78957351
4.76132947
4.45209374
3.99216974
4.13200468
4.38574566
5.07896810
4.94539576
High-pressureheat exchanger
λ
7
0.00070098
0.00071119
0.00061423
0.00055696
0.00057015
0.00065517
0.00062168
0.00055713
0.00058711
0.00065981
τ
7
6.16937271
5.62696440
5.56932906
5.76412417
6.12199584
6.48829057
6.49184949
5.34442022
6.18770089
5.68156701


## 7. Conclusion

This paper reports the multiobjective optimization problem of the urea decomposition unit of a fertilizer plant under the fuzzy environment where we maximize the reliability and minimize the cost of the system. A proposed approach suggests a way for achieving the optimum performance of the system with the help of experts/DMs elicitation. A mutual conflicting nature of the objectives is resolved with the help of fuzzy set theory after constructing the fuzzy region of satisfaction by taking linear membership functions. Since reliability decision is usually made in the earliest stage of system design and the information at this stage is incomplete and imprecise, it is necessary to rely on the experience of DMs and experts. Based on their preferences in the form of weights towards the objectives along with the achieved objective membership functions, FMOOP is reformulated as a single objective optimization problem and then solves with the PSO and GA iteratively. The one run of the approach has been shown here as we assume that in the problem DM is satisfied by the obtained results. Through this approach, a decision support system has been developed which helps the plant maintenance personnel in deciding his future strategy to gain optimum performance of the system. The decision variable corresponding to the main components of each subsystem/unit of a plant is reported which may be targeted so that optimum system performance could be achieved by using the discussed approach.The present work done may be extended for a system in hybrid configuration, for example, series, parallel, series-parallel, and so forth. The presented methodology will be further extended and improved using other optimization tools/algorithms and artificial neural network will be used to handle the complex nature of the systems. As a constant, failure rate model has been taken in the analysis, so authors are engaged in the approach for further analysis such as resource allocation, facility planning and management, inventory control, network analysis, and job shop scheduling for an arbitrary failure rate model instead of constant failure rate model.



---

*Source: 872450-2013-04-24.xml*