Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings
Proceedings of the Eighth International Conference on Probabilistic Safety Assessment & Management (PSAM)Available to Purchase
Editor
Michael G. Stamatelatos
Michael G. Stamatelatos
Search for other works by this author on:
Harold S. Blackman
Harold S. Blackman
Search for other works by this author on:
ISBN-10:
0791802442
No. of Pages:
2576
Publisher:
ASME Press
Publication date:
2006

The redundancy allocation problem (RAP) is a well known NP-hard problem which involves the selection of elements and redundancy levels to maximize system reliability given various systemlevel constraints. As telecommunications and internet protocol networks, manufacturing and power systems are becoming more and more complex, while requiring short developments schedules and very high reliability, it is becoming increasingly important to develop efficient solutions to the RAP. This paper presents an efficient algorithm to solve this reliability optimization problem. The idea of a heuristic approach design is inspired from the ant colony meta-heuristic optimization method and the degraded ceiling local search technique. Our hybridization of the ant colony meta-heuristic with the degraded ceiling performs well and is competitive with the best-known heuristics for redundancy allocation. Numerical results for the 33 test problems from previous research are reported and compared. The solutions found by our approach are all better than or are in par with the well-known best solutions.

Abstract
1. Introduction
2. Hybrid solution approach: ACO/DC
4. Conclusions
References
This content is only available via PDF.
You do not currently have access to this chapter.

or Create an Account

Close Modal
Close Modal