Solving reliability redundancy allocation problems using an artificial bee colony algorithm

  • Authors:

  • Wei-Chang Yeh;Tsung-Jung Hsieh

  • Affiliations:

  • Department of Industrial Engineering and Engineering Management, National Tsing Hua University, No. 101, Section 2, Kuang-Fu Road, Hsinchu 30013, Taiwan, ROC;Department of Industrial Engineering and Engineering Management, National Tsing Hua University, No. 101, Section 2, Kuang-Fu Road, Hsinchu 30013, Taiwan, ROC

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2011

Quantified Score

Hi-index 0.01

Visualization

Abstract

This paper proposed a penalty guided artificial bee colony algorithm (ABC) to solve the reliability redundancy allocation problem (RAP). The redundancy allocation problem involves setting reliability objectives for components or subsystems in order to meet the resource consumption constraint, e.g. the total cost. RAP has been an active area of research for the past four decades. The difficulty that one is confronted with the RAP is the maintenance of feasibility with respect to three nonlinear constraints, namely, cost, weight and volume related constraints. In this paper nonlinearly mixed-integer reliability design problems are investigated where both the number of redundancy components and the corresponding component reliability in each subsystem are to be decided simultaneously so as to maximize the reliability of the system. The reliability design problems have been studied in the literature for decades, usually using mathematical programming or heuristic optimization approaches. To the best of our knowledge the ABC algorithm can search over promising feasible and infeasible regions to find the feasible optimal/near-optimal solution effectively and efficiently; numerical examples indicate that the proposed approach performs well with the reliability redundant allocation design problems considered in this paper and computational results compare favorably with previously-developed algorithms in the literature.