计算机科学
聚类分析
粒子群优化
蒙特卡罗方法
数学优化
算法
分拆(数论)
光谱聚类
数学
人工智能
统计
组合数学
作者
Pan Li,Zhang Han,Shenghui Zhao,Feng Wang
标识
DOI:10.1016/j.engappai.2023.106497
摘要
Distribution network nodes are numerous and monitoring devices are widely distributed. All monitoring data are uploaded to the cloud master for centralized processing may cause serious problems, such as network congestion, information delay and high computational complexity. The edge computing can provide a good solution, which requires reasonable distribution network partition. This paper proposes a Monte Carlo optimized spectral clustering (MCOSC) distribution network partition method for edge server configuration. Firstly, the objective function of distribution network partition number is constructed with economic and real-time communication indexes, which are more suitable for edge computing than electrical distance and voltage sensitivity indexes. Then the optimal number of partitions is obtained by particle swarm optimization (PSO) with the constraints of communication reliability. Secondly, to solve the problem that the traditional spectral clustering is easy to fall into the local optimal solution, a Monte Carlo optimized spectral clustering method is proposed to make the distribution network partition results more reasonable. Finally, the performance of the proposed method is evaluated by IEEE 33 bus and 69 bus systems distribution network models. The results indicate that the Monte Carlo optimization partition method has better accurate, robustness and convergence speed than traditional spectral clustering method.
科研通智能强力驱动
Strongly Powered by AbleSci AI