Heuristic methods for solving redundancy allocation in complex systems
by Pardeep Kumar, D.K. Chaturvedi, G.L. Pahuja
International Journal of Reliability and Safety (IJRS), Vol. 4, No. 2/3, 2010

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.

Online publication date: Fri, 02-Apr-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Reliability and Safety (IJRS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com