IPSO-based hybrid approaches for reliability-redundancy allocation problems

被引:14
作者
Zhang HongQi [1 ,2 ]
Hu XiangTao [2 ,3 ]
Shao XiaoDong [1 ]
Li ZiCheng [3 ]
Wang YuHui [3 ]
机构
[1] Xidian Univ, Sch Mechanoelect Engn, Xian 710071, Peoples R China
[2] CETC, Res Inst 38, Hefei 230088, Peoples R China
[3] Huazhong Univ Sci & Technol, State Key Lab Digital Mfg Equipment & Technol, Wuhan 430074, Peoples R China
关键词
reliability-redundancy allocation problem; particle swarm optimization; hybrid approach; harmony search; PARTICLE SWARM OPTIMIZATION; ALGORITHM; SYSTEMS; OPERATOR; SEARCH; DESIGN; SOLVE;
D O I
10.1007/s11431-013-5372-5
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The problem of maximizing system reliability through component reliability choices and component redundancy is called reli-ability-redundancy allocation problem (RAP), and it is a difficult but realistic nonlinear mixed-integer optimization problem. For the RAP, we pay attention to an improved particle swarm optimization (IPSO), and introduce four hybrid approaches for combining the IPSO with other conventional search techniques, such as harmony search (HS) and LXPM (a real coded GA). The basic structure of the hybrid approaches includes two phases. After devising an initial solution by the HS or LXPM technique in the first phase, the IPSO performs an optimal search in the next phase. In addition, a new procedure by using golden search, named GS, is developed for further improving the solutions obtained by IPSO. Consequently, four ISPO-based hybrid approaches are proposed including HS-IPSO, LXPM-IPSO, HS-IPSO-GS, and LXPM-IPSO-GS. In order to validate the per-formance of proposed approaches, five nonlinear mixed-integer RAPs are investigated where both the number of redundancy components and the corresponding component reliability in each subsystem are to be decided simultaneously. As shown, the proposed approaches are all superior in terms of both optimal solutions and robustness to those by IPSO. Especially, the pro-posed LXPM-IPSO-GS has shown more excellent performance than other typical approaches in the literature.
引用
收藏
页码:2854 / 2864
页数:11
相关论文
共 36 条
[1]   Modified imperialist competitive algorithm based on attraction and repulsion concepts for reliability-redundancy optimization [J].
Afonso, Leonardo Dallegrave ;
Mariani, Viviana Cocco ;
Coelho, Leandro dos Santos .
EXPERT SYSTEMS WITH APPLICATIONS, 2013, 40 (09) :3794-3802
[2]  
[Anonymous], 2006, IEEE SWARM INT S 200
[3]  
[Anonymous], 1975, ADAPTATION NATURAL A
[4]   A differential evolution algorithm to solve redundancy allocation problems [J].
Beji, Noura ;
Jarboui, Bassem ;
Siarry, Patrick ;
Chabchoub, Habib .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2012, 19 (06) :809-824
[5]   IAs based approach for reliability redundancy allocation problems [J].
Chen, Ta-Cheng .
APPLIED MATHEMATICS AND COMPUTATION, 2006, 182 (02) :1556-1567
[6]   ON THE COMPUTATIONAL-COMPLEXITY OF RELIABILITY REDUNDANCY ALLOCATION IN A SERIES SYSTEM [J].
CHERN, MS .
OPERATIONS RESEARCH LETTERS, 1992, 11 (05) :309-315
[7]   An efficient particle swarm approach for mixed-integer programming in reliability-redundancy optimization applications [J].
Coelho, Leandro dos Santos .
RELIABILITY ENGINEERING & SYSTEM SAFETY, 2009, 94 (04) :830-837
[8]  
De Jong K., 1975, THESIS U MICHIGAN MI
[9]   A new mutation operator for real coded genetic algorithms [J].
Deep, Kusum ;
Thakur, Manoj .
APPLIED MATHEMATICS AND COMPUTATION, 2007, 193 (01) :211-230
[10]   A new crossover operator for real coded genetic algorithms [J].
Deep, Kusum ;
Thakur, Manoj .
APPLIED MATHEMATICS AND COMPUTATION, 2007, 188 (01) :895-911