This paper presents a global optimization method for solving the series-parallelredundancy allocation problems of determining the optimal number of redundant components in order to maximize the system reliability subject to multiple resource restrictions. Our problems are nonlinear integer programming problems that are in general hard to deal with. We transform them into binary integer programming problems and find global optimal solutions using GAMS. Computational results show that tabu search among heuristic methods is a powerful heuristic one. It is believed that our approach would be a very useful tool to evaluate the efficiency of heuristic methods for the moderate size of problems such as Fyffe et al.[1].
展开▼
