共 24 条
Orthogonal simplified swarm optimization for the series-parallel redundancy allocation problem with a mix of components
被引:63
作者:
Yeh, Wei-Chang
[1
]
机构:
[1] Natl Tsing Hua Univ, Dept Ind Engn & Engn Management, Integrat & Collaborat Lab, Hsinchu, Taiwan
关键词:
Reliability;
Series-parallel system;
Redundancy allocation problem (RAP);
Simplified swarm optimization (SSO);
Orthogonal array test (OA);
RELIABILITY OPTIMIZATION;
ALGORITHM;
SEARCH;
D O I:
10.1016/j.knosys.2014.03.011
中图分类号:
TP18 [人工智能理论];
学科分类号:
081104 ;
0812 ;
0835 ;
1405 ;
摘要:
This work presents a novel orthogonal simplified swarm optimization scheme (OSSO) that combines repetitive orthogonal array testing (ROA), re-initialize population (RIP), and SSO for solving intractable large-scale engineering problems. This scheme is applied to the series-parallel redundancy allocation problem (RAP) with a mix of components. RAP 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 difficulties confronted by RAP are to maintain feasibility with respect to three nonlinear constraints, namely, cost-, weight-, and volume-related constraints. As evidence of the utility of the proposed approach, we present extensive computational results on random test problems. The computational results compare favorably with previously developed algorithms in the literature. The results in this paper show that the proposed OSSO can perform excellently in a limited computation time. (c) 2014 Elsevier B.V. All rights reserved.
引用
收藏
页码:1 / 12
页数:12
相关论文