基于禁忌搜索与扰动策略的探针部署算法

PROBE DEPLOYMENT ALGORITHM BASED ON TABOO SEARCH AND DISTURBANCE STRATEGY

在采用改进蚁群算法对智能电网探针部署无向图最小点覆盖集求解过程中,由于对相邻顶点的重复计算,导致计算时间增加,使计算结果陷入局部区域求解。基于此,提出一种基于禁忌搜索与扰动策略的探针部署算法。通过结合快速邻域切换以及建立禁忌表增强局部寻优能力并减少计算时间,结合扰动策略扩展集合求解范围,使所求解最小点覆盖结果达全局最优。实验结果表明,相比改进蚁群算法,该算法计算时间更少,寻优能力更强,寻优范围更广。

In the process of using the improved ant colony algorithm to deploy the undirected graph minimum point cover set solution for smart grid probes, the computing time increases due to repeated calculation of adjacent vertices, which makes the calculation results caught in the local area solution. Therefore, we propose a probe deployment algorithm based on taboo search and perturbation strategy. By combining fast neighborhood switching and establishing taboo list, the local optimization ability was enhanced and the computing time was reduced. The perturbation strategy was used to expand the set solution range, so that the minimum point coverage of the solution reached the global optimal. The experimental results show that compared with the improved ant colony algorithm, the proposed algorithm has less computing time, stronger ability to find optimization, and a wider range of optimization.