Abstract
This paper presents two new heuristic methods for solving constrained redundancy allocation problems in varied complex systems, such as computer networks, communication systems, transportation systems, etc. The first method consists of two steps: selection of optimal path and then determination of optimal redundant subsystem in the chosen path. The second method consists of only one step, i.e. calculation of a sensitivity factor, which considerably reduces the iteration time. Computational results show that the first method consistently performs better than Shi's method in terms of solution quality and computing time. The computational efficiency of the second method far exceeds the existing heuristics.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
