期刊文献+

基于改进离散粒子群算法优化故障等级的传感器布局

Optimized Sensor Layout Considering Fault Level Based on Improved Discrete Particle Swarm Algorithm
下载PDF
导出
摘要 文章提出一种基于改进离散粒子群算法优化故障等级的传感器布局方法用于解决传感器检测故障的布局问题,通过故障模式影响和危害性分析得到系统的故障模式,对系统故障模式进行故障等级划分;然后依据故障等级漏检率构造约束条件,传感器成本构造适应度函数;并构造出非线性优化学习因子的动态调整策略;利用改进的离散粒子群算法求解故障漏检率约束条件下适应度函数最优的传感器布局离散序列,仿真实验表明应用文章方法布局具有在满足不同故障等级的漏检率条件下的成本低优越性。 A sensor layout method based on improved discrete particle swarm algorithm to optimize the fault level is proposed to solve the layout problem of sensor detection faults.The system failure mode is obtained through failure mode impact and criticality analysis,and the system failure mode is divided into fault levels.Then constraint conditions are constructed based on the failure rate missed detection rate,the fitness function is constructed for the sensor cost.A dynamic adjustment strategy is constructed for nonlin-ear optimization learning factors.The improved discrete particle swarm algorithm is used to solve the optimal fitness function under the constraint condition of the fault missed detection rate.The simulation experiment shows the superiority of the application of this paper to get a lower cost with satisfaction of different fault level.
作者 詹梦园 李震 田璐 苗虹 ZHAN Mengyuan;LI Zhen;TIAN Lu;MIAO Hong(School of Electronics and Information,Jiangsu University of Science and Technology,Zhenjiang 212003;School of Economics and Management,Jiangsu University of Science and Technology,Zhenjiang 212003)
出处 《计算机与数字工程》 2023年第12期2795-2800,共6页 Computer & Digital Engineering
关键词 离散粒子群算法 故障等级 学习因子 传感器布局 discrete particle swarm algorithm failure level learning factor sensor layout
  • 相关文献

参考文献6

二级参考文献70

  • 1Eberhart R, Kennedy J. A new optimizer using particle swarm theory. Proceedings of the 6^th International Symposium on Micro Machine and Human Science. Nagoya, Japan, 1995,39-43.
  • 2Kennedy J, Eberhart R. Particle swarm optimization. IEEE International Conference on Neural Networks. Piscataway, New Jersy: IEEE Service Center, 1995, 1942-1948.
  • 3Shi Y, Eberhart R. A modified particle swarm optimizer. IEEE International Conference on Evolutionary Computation. New Jersy: IEEE Press, 1998, 69-73.
  • 4Aler B, Vincent J, Anyakoha C. A review of particle swarm optimization. Natural Computing, 2008, 7(3):109-124.
  • 5LiuJ H, FanXP, QuZH. An improvedparticle swarm optimization with mutation based on similarity. The 3^rd International Conference on Natural Computation. Haikou, China, 2007,9 : 824-828.
  • 6Kennedy J, Eberhart R. A discrete binary version of the particle swarm algorithm. Proceeding of the World Multieonference on Systemics, Cybernetics and Informaties. New Jersy: Piseataway, 1997, 4104-4109.
  • 7Salman A, Ahmad I, Al- madani S. Particle swarm optimization for task assignment problem. Microprocessors and Microsystems, 2002, 26(8) :363-371.
  • 8Lian Z, Gu X, Jiao B. A novel particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan. Chaos Solitons and Fractals, 2008, 35(5): 851-861.
  • 9Liao C J, Tseng C T, Luarn P. A discrete version of particle swarm optimization for flowshop scheduling problem. Computers and Operations Research, 2007, 34(10): 3099--3111.
  • 10Correa E S, Freitas A A, Johnson C G. Particle swarm for attribute selection in Bayesian classification: An application to protein function prediction. Journal of Artificial Evolution and Applications, 2008, 8(2): 1-12.

共引文献147

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部