Reliability redundancy allocation: An improved realization for nonconvex nonlinear programming problems

Ha, Chunghun; Kuo, Way

doi:10.1016/j.ejor.2004.06.006

Cited by 103 publications

(44 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the above model, 1 is the reliability of the overall system if its subsystems are connected in series (parallel). Constraint sets (1) and (2) are recursive equations for calculating the reliability of any subsystem.…”

Section: Mixed Integer Programming Modelmentioning

confidence: 99%

“…Improving component reliability has been generally preferred over adding redundancy in industry, because the redundancy is difficult to add to the real systems due to the technical limitations such as weight, volume, and cost. However, recently developed advanced technologies such as semiconductor integrated circuits and nanotechnology, have revived the importance of the redundancy strategy [1].…”

Section: Introductionmentioning

confidence: 99%

“…Ha and Kuo [1] presented a branchand-bound approach to solve the redundancy allocation problem (RAP) formulated as a non-convex integer nonlinear programming model. Their computational experiments demonstrated that the method was superior to the other existing exact algorithms for RAP in terms of computation time.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Optimal Redundancy Allocation in Hierarchical Series-Parallel Systems Using Mixed Integer Programming

Ziaee¹

2013

View full text Add to dashboard Cite

Reliability optimization plays an important role in design, operation and management of the industrial systems. System reliability can be easily enhanced by improving the reliability of unreliable components and/or by using redundant configuration with subsystems/components in parallel. Redundancy Allocation Problem (RAP) was studied in this research. A mixed integer programming model was proposed to solve the problem, which considers simultaneously two objectives under several resource constraints. The model is only for the hierarchical series-parallel systems in which the elements of any subset of subsystems or components are connected in series or parallel and constitute a larger subsystem or total system. At the end of the study, the performance of the proposed approach was evaluated by a numerical example.

show abstract

Section: Mixed Integer Programming Modelmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Optimal Redundancy Allocation in Hierarchical Series-Parallel Systems Using Mixed Integer Programming

Ziaee¹

2013

View full text Add to dashboard Cite

show abstract

“…Since RAP and RRAP belong to the NP-hard class of optimization problems (Chern, 1992;Ha & Kuo, 2006) they are generally too difficult and time-consuming to solve using traditional optimization methods. More specifically when the problem size is large, most classical mathematical methods have failed to handle these optimization problems properly (Soltani, 2014).…”

Section: Introductionmentioning

confidence: 99%

Multi-objective availability-redundancy allocation problem for a system with repairable and non-repairable components

Zoulfaghari¹,

Hamadani²,

Ardakan³

2015

10.5267/j.dsl

View full text Add to dashboard Cite

Reliability is one of the most important characteristics of the electrical and mechanical systems with applications in the space communication industries, internet networks, telecommunication systems, power generation systems, and productive facilities. What adds to the importance of reliability in these systems are system complications, nature of competitive markets, and increasing production costs due to failures. This paper investigates availability optimization of a system using both repairable and non-repairable components, simultaneously. The availability-redundancy allocation problems involve the determination of component availability (i.e., life time and repair time of the components) and the redundancy levels that produce maximum system availability. These problems are often subject to some constraints on their components such as cost, weight, and volume. To maximize the availability and to minimize the total cost of the system, a new Mixed Integer Nonlinear Programming (MINLP) model is presented. To solve the proposed model, an improved version of the genetic algorithm is designed as an efficient meta-heuristic algorithm. Finally, in order to verify the efficiency of the proposed algorithm, a numerical example of a system is presented that consists of both repairable and non-repairable components.Growing Science Ltd. All rights reserved. 5

show abstract

“…This works in the second phase by using the issue of Knapsack problem to improve the results. The allocation for the sub-system redundancy with identical structure was a non-convex nonlinear programming model and Ha and Kuo (2006) presented a branch and bound to solve the problem. Lee et al (2003) compared the computational complexity of the solutions produced by two methods of Nakagava and Nakashima (1977) with each other.…”

Section: Introductionmentioning

confidence: 99%

Efficient optimization of multi-objective redundancy allocation problems in series-parallel systems

Arjestan¹

2017

10.5267/j.dsl

View full text Add to dashboard Cite

Reliability redundancy allocation: An improved realization for nonconvex nonlinear programming problems

Cited by 103 publications

References 15 publications

Optimal Redundancy Allocation in Hierarchical Series-Parallel Systems Using Mixed Integer Programming

Optimal Redundancy Allocation in Hierarchical Series-Parallel Systems Using Mixed Integer Programming

Multi-objective availability-redundancy allocation problem for a system with repairable and non-repairable components

Efficient optimization of multi-objective redundancy allocation problems in series-parallel systems

Contact Info

Product

Resources

About