凌志勇, 张翼, 李圣清, 龙霞飞. 基于改进迪杰斯特拉算法的变电站二次电缆路径优化设计[J]. 湖南电力, 2021, 41(4): 34-37.
引用本文: 凌志勇, 张翼, 李圣清, 龙霞飞. 基于改进迪杰斯特拉算法的变电站二次电缆路径优化设计[J]. 湖南电力, 2021, 41(4): 34-37.
LING Zhi-yong, ZHANG Yi, LI Sheng-qing, LONG Xia-fei. Optimization Design of Substation Secondary Cable Path Based on Improved Dijkstra Algorithm[J]. Hunan Electric Power, 2021, 41(4): 34-37.
Citation: LING Zhi-yong, ZHANG Yi, LI Sheng-qing, LONG Xia-fei. Optimization Design of Substation Secondary Cable Path Based on Improved Dijkstra Algorithm[J]. Hunan Electric Power, 2021, 41(4): 34-37.

基于改进迪杰斯特拉算法的变电站二次电缆路径优化设计

Optimization Design of Substation Secondary Cable Path Based on Improved Dijkstra Algorithm

  • 摘要: 为实现变电站建设工程二次电缆敷设长度的准确预测,避免工程建设资源浪费的问题,建立基于迪杰斯特拉(Dijkstra)算法的二次电缆路径优化模型。首先,对变电站的路径环境进行建模,建立栅格地图;其次,通过对传统Dijkstra算法、改进后的Dijkstra算法和蚁群算法分别在栅格地图上进行路径规划,并进行实验仿真与对比;最后,仿真验证了改进后算法规划路径长度比传统Dijkstra算法减少24.32%和28.66%,比蚁群算法减少了12.34%。这为未来变电站二次电缆敷设提供了一些有益的理论参考。

     

    Abstract: In order to accurately predict the length of secondary cable laying in substation construction project and avoid the problem of resource waste in engineering construction, a secondary cable path optimization model based on Dijkstra algorithm is established. Firstly, the path environment of the substation is modeled and a raster map is established.Secondly, the traditional Dijkstra, the improved Dijkstra and ant colony algorithm are used to carry out path planning on raster map respectively, and the experimental simulation and comparison are carried out.Finally, the simulation results show that the path length of the improved algorithm is 24.32% and 28.66% less than that of the traditional Dijkstra.It is 12.34% less than that of the ant colony algorithm, which provides some useful theoretical references for the secondary cable laying in the future substations.

     

/

返回文章
返回