Multi-Path Heuristic for Redundancy Allocation: The Tree Heuristic

Ha, Chunghun; Kuo, Way

doi:10.1109/tr.2005.859227

Cited by 21 publications

(17 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Recently, Agarwal et al (2010) proposed a heuristic in which the solutions obtained are near-optimal in k-neighborhood ( k ⩾ 2). It is also applicable for separable and monotonic non-decreasing constraint functions and this algorithm performs better than those in Kohda and Inoue (1982), Shi (1987), Kim and Yum (1993), Agarwal and Aggarwal (2004, 2006) Ha and Kuo (2006) and Agarwal and Aggarwal (2008).…”

Section: Introductionmentioning

confidence: 99%

Heuristic algorithm for optimal redundancy allocation in complex systems

Aggarwal

2019

JQME

View full text Add to dashboard Cite

Purpose The purpose of this paper is to present an efficient heuristic algorithm based on the 3-neighborhood approach. In this paper, search is made from sides of both feasible and infeasible regions to find near-optimal solutions. Design/methodology/approach The algorithm performs a series of selection and exchange operations in 3-neighborhood to see whether this exchange yields still an improved feasible solution or converges to a near-optimal solution in which case the algorithm stops. Findings The proposed algorithm has been tested on complex system structures which have been widely used. The results show that this 3-neighborhood approach not only can obtain various known solutions but also is computationally efficient for various complex systems. Research limitations/implications In general, the proposed heuristic is applicable to any coherent system with no restrictions on constraint functions; however, to enforce convergence, inferior solutions might be included only when they are not being too far from the optimum. Practical implications It is observed that the proposed heuristic is reasonably proficient in terms of various measures of performance and computational time. Social implications Reliability optimization is very important in real life systems such as computer and communication systems, telecommunications, automobile, nuclear, defense systems, etc. It is an important issue prior to real life systems design. Originality/value The utilization of 3-neighborhood strategy seems to be encouraging as it efficiently enforces the convergence to a near-optimal solution; indeed, it attains quality solutions in less computational time in comparison to other existing heuristic algorithms.

show abstract

Section: Introductionmentioning

confidence: 99%

Heuristic algorithm for optimal redundancy allocation in complex systems

Aggarwal

2019

JQME

View full text Add to dashboard Cite

show abstract

“…Over the past decades, several deterministic methods have been used to solve the RRAP, such as the heuristic methods [9][10][11], the branch and bound method [12,13], the integer programming [14] and the dynamic programming method [15,16]. However, these methods have shown some weaknesses.…”

Section: Introductionmentioning

confidence: 99%

A swarm intelligence-based approach for reliability–redundancy allocation problems

Guedria

Hassine

2019

J Braz. Soc. Mech. Sci. Eng.

View full text Add to dashboard Cite

This paper presents a new algorithm belonging to the class of swarm intelligence methods, called the adaptive simplified PSO (ASPSO)-based algorithm, for solving reliability-redundancy allocation problems. In this constrained nonlinear mixed-integer problem, both the number of redundant components and their reliability in each subsystem are to be decided simultaneously so as to maximize the reliability of the system. The proposed ASPSO operates with a new updating model to adjust the position of particles, without dealing with velocity. In addition, a randomization technique, based on the dispersion of particle bests through the search space, is used to speed up the convergence of the proposed approach and prevent it from being trapped within the local optimum. Moreover, to control the balance between exploration and exploitation, during the search process, two adaptive functions are utilized. The simulation results of four different benchmarks for the reliabilityredundancy allocation problem are reported and compared. Accordingly, the solutions given by the new presented approach are all superior to those best known solutions provided by several methods in the literature.

show abstract

“…Recently Ha and Kuo (2006) proposed a tree heuristic for solving the general redundancy allocation problem in reliability optimization. They have concluded that their algorithm outperforms that of Kim and Yum (1993).…”

Section: Introductionmentioning

confidence: 99%

“…The algorithm is tested for eight sets of problems (with linear constraints) each with ten randomly generated data and a five‐unit bridge structure with both, linear and nonlinear constraints. It is observed that there is much overall improvement in various measures of performance, namely, Average relative error A, Maximum relative error M, and Optimality rate O in comparison to the Agarwal and Aggarwal (2006, 2008) and Ha and Kuo (2006) algorithms. Besides, computational time is also reduced significantly.…”

Section: Introductionmentioning

confidence: 99%

Optimal redundancy allocation in complex systems

Agarwal

Aggarwal

Sharma

2010

Journal of Quality in Maintenance Engineering

View full text Add to dashboard Cite

PurposeThis paper aims to focus on solving highly constrained redundancy optimization problems in binary complex systems.Design/methodology/approachThe proposed algorithm searches a possibly improved solution in the k‐neighborhood (k≥2) of the current best feasible solution, by adding one unit in a selected subsystem and eliminating one from some other subsystem(s).FindingsThe algorithm is tested on complex system structures from the literature by solving a set of problems (with both linear and non‐linear constraints), with given and randomly generated data. It is observed that, compared with the other existing heuristics, there is much overall improvement in various performance measures.Practical implicationsThe proposed algorithm is a better alternative and can be easily and efficiently applied to numerous real life systems such as computer and communication systems, telecommunication networks, automobile, nuclear and defense systems etc., giving optimal/near‐optimal solutions.Originality/valueResearchers in reliability optimization have placed emphasis on heuristic approaches. The paper presents a new heuristic algorithm for solving the constrained redundancy optimization problems in complex binary systems.

show abstract

Multi-Path Heuristic for Redundancy Allocation: The Tree Heuristic

Cited by 21 publications

References 24 publications

Heuristic algorithm for optimal redundancy allocation in complex systems

Heuristic algorithm for optimal redundancy allocation in complex systems

A swarm intelligence-based approach for reliability–redundancy allocation problems

Optimal redundancy allocation in complex systems

Contact Info

Product

Resources

About