COMPUTING MINIMAL HITTING SETS WITH PARTICLE SWARM OPTIMIZATION ALGORITHM

摘要：

In this paper, particle swarm optimization (PSO) algorithm is used to compute minimal hitting sets. Through putting forward new meanings to the velocity of the PSO and designing a new motion method for the particles, we carry out the search for minimal hitting sets without other assistant operations. Because the PSO algorithm has the advantages of simple, flat-out and quick, it can be used to compute the large-scale minimal hitting sets problem. From the test of the instances, it can be seen that the larger the scale of the problem, the smaller the ratio of the particle number that is searched for and the particle total amount of the solution space. It expresses that this method is more suitable for computing large-scale minimal hitting sets problem.

关键词： Minimal hitting set Particle swarm optimization Model-bascd diagnosis

作者: NAN ZHANG JIGUI SUN XIANGFU ZHAO DANTONG OUYANG NA REN

作者单位: Department of Information Technology, Shenyang Institute of Engineering Shenyang, 110136, Liaoning P.R.China

会议类型: 国际会议

会议名称: The Second International Conference on Information & Systems Sciences(ICISS2008)(第二届信息与系统科学国际会议)

会议地点: 大连

会议语种:英文

页码: 389-398

在线出版日期: 2008-12-18（万方平台首次上网日期，不代表论文的发表时间）