Uncertain multiobjective redundancy allocation problem of repairable systems based on artificial bee colony algorithm |
| |
Authors: | Guo Jiansheng Wang Zutong Zheng Mingfa Wang Ying |
| |
Affiliation: | 1. Materiel Management and Safety Engineering College, Air Force Engineering University, Xi’an 710051, China 2. School of Mathematics and Statistics, Xi’an Jiaotong University, Xi’an 710021, China |
| |
Abstract: | Based on the uncertainty theory, this paper is devoted to the redundancy allocation problem in repairable parallel-series systems with uncertain factors, where the failure rate, repair rate and other relative coefficients involved are considered as uncertain variables. The availability of the system and the corresponding designing cost are considered as two optimization objectives. A crisp multiobjective optimization formulation is presented on the basis of uncertainty theory to solve this resultant problem. For solving this problem efficiently, a new multiobjective artificial bee colony algorithm is proposed to search the Pareto efficient set, which introduces rank value and crowding distance in the greedy selection strategy, applies fast non-dominated sort procedure in the exploitation search and inserts tournament selection in the onlooker bee phase. It shows that the proposed algorithm outperforms NSGA-II greatly and can solve multiobjective redundancy allocation problem efficiently. Finally, a numerical example is provided to illustrate this approach. |
| |
Keywords: | Artificial bee colony algorithm Multiobjective optimization Redundancy allocation problem Repairable systems Uncertainty theory |
本文献已被 CNKI 维普 万方数据 ScienceDirect 等数据库收录! |
|