Optimization of Linear Consecutive-k-Out-of-n Systems with Birnbaum Importance Based Ant Colony Optimization Algorithm

作     者：WANG Wei CAI Zhiqiang ZHAO Jiangbin SI Shubin 王伟;蔡志强;赵江滨;司书宾

作者机构：Department of Industrial EngineeringSchool of Mechanical EngineeringNorthwestern Polytechnical UniversityXi'an 710072China 

出 版 物：《Journal of Shanghai Jiaotong university(Science)》 (上海交通大学学报（英文版）)

年 卷 期：2020年第25卷第2期

页      面：253-260页

核心收录：

学科分类：07[理学] 070104[理学-应用数学] 0701[理学-数学] 

基　　金：the National Natural Science Foundation of China(Nos.71871181 and 71471147) the Overseas Expertise Introduction Project for Discipline Innovation(No.B13044) the Top International University Visiting Program for Outstanding Young Scholars of Northwestern Polytechnical University(No.201806295008) 

主　　题：linear consecutive-k-out-of-n:failure(good)(Lin/Con/k/n:F(G))system ant colony optimization(ACO)algorithm optimization Birnbaum importance(BI) 

摘      要：The linear consecutive-k-out-of-n:failure(good)(Lin/Con/k/n:F(G))system consists of n interchangeable components that have different *** components are arranged in a line path and different component assignments change the system *** optimization of Lin/Con/k/n:F(G)system is to find an optimal component assignment to maximize the system *** the number of components increases,the computation time for this problem increases *** this paper,we propose a Birnbaum importance-based ant colony optimization(BIACO)algorithm to obtain quasi optimal assignments for such *** compare its performance using the Birnbaum importance based two-stage approach(BITA)and Birnbaum importancebased genetic local search(BIGLS)algorithm from previous *** experimental results show that the BIACO algorithm has a good performance in the optimization of Lin/Con/k/n:F(G)system.