3-状态设备网络GRAP问题迭代PSO算法  

PSO Algorithm for GRAP Problem in Three-state Device Network System

作　　者：付军[1] 李东魁[1] 

机构地区：[1]包头师范学院信息科学与技术学院,内蒙古包头014030

出　　处：《工业控制计算机》2022年第5期107-109,共3页Industrial Control Computer

基　　金：内蒙古自然科学基金项目(2018MS06031)。

摘　　要：研究3-状态设备网络GRAP问题,即允许子系统可选择不同类型的元件,确定选择元件的冗余度,满足系统重量和费用约束的前提下,使系统可靠度最大。设计了一个离散型,具有动态变化权重,具有压缩系数的迭代PSO算法用于问题求解,通过对推广的FYFFE问题模拟仿真,验证算法的有效性和正确性。结果表明:PSO算法很好地解决了3-状态设备网络GRAP问题,算法具有快速、易于编程实现、原理容易理解等特点。This paper studies the GRAP problem of three-state device network,which allows subsystems to select different types of components,determines the redundancy of the selected components,and meets the weight and cost constraints of the system,so that the system has the greatest reliability.A discrete iterative PSO algorithm with dynamic change weights and compression coefficients is designed to solve the problem.The effectiveness and correctness of the algorithm are verified by simulation of the extended FYFFE problem.The results show that the PSO algorithm solves the GRAP problem of three-state device network very well.The algorithm is fast,easy to program and implement,and the principle is easy to understand.

关 键 词：3-状态 广义的可靠性冗余分配问题(GRAP) 粒子群优化算法(PSO) 仿真 算法 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]