Uncertain multiobjective redundancy allocation problem of repairable systems based on artificial bee colony algorithm

• DOI: 10.1016/j.cja.2014.10.014
• Publication Date: 2014-10-20T02:49:20Z
• Authors: Jiansheng Guo; Zutong Wang; Mingfa Zheng; Ying Wang
• Keywords: Tournament selection; Benchmark (surveying)

Based on the uncertainty theory, this paper is devoted to redundancy allocation problem in repairable parallel-series systems with uncertain factors, where failure rate, repair rate and other relative coefficients involved are considered as variables. The availability of system corresponding designing cost two optimization objectives. A crisp multiobjective formulation presented basis theory solve resultant problem. For solving efficiently, a new artificial bee colony algorithm proposed search Pareto efficient set, which introduces rank value crowding distance greedy selection strategy, applies fast non-dominated sort procedure exploitation inserts tournament onlooker phase. It shows that outperforms NSGA-II greatly can efficiently. Finally, numerical example provided illustrate approach.