摘要
本文提出一种新的诊断策略-蚁群系统(Ant Colony System,简称ACS)在比较模型下的快速精确诊断算法,即在系统中通过模拟蚁群获取食物的过程,并对其最短路径进行分析,结合ACS环诊断策略,得到关于序列的重要性质,基于这些性质,从而提出一种快速精确诊断算法,此算法的时间复杂度为O(N),其中N为蚁群中蚂蚁的数量.
This paper presents a newdiagnostic strategy,a fast precise diagnosis algorithm for Ant Colony System( ACS) under the comparison model,through simulating the process of ant colonies obtain food in the system,analyze the shortest path of them,and combined with ACS ring diagnosis strategy,then we come up with a lot of important properties of the sequences,based on these properties,a fast precise diagnosis algorithm is proposed,the time complexity of the algorithm is O( N),where N represent the amount of ants.
作者
陈芳
梁家荣
张乾
CHEN Fang;LIANG Jia-rong;ZHANG Qian(School of Computer and Electronic Information,Guangxi University,Nanning 530004,China)
出处
《小型微型计算机系统》
CSCD
北大核心
2019年第3期515-519,共5页
Journal of Chinese Computer Systems
基金
国家自然科学基金项目(61363002)资助
关键词
蚁群系统
比较模型
快速精确诊断算法
ACS环诊断策略
时间复杂度
ant colony system
comparison model
a fast precise diagnosis algorithm
ACS ring diagnosis strategy
time complexity
