检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:凌志勇[1,2] 张翼 李圣清[1,3] 龙霞飞 LING Zhiyong;ZHANG Yi;LI Shengqing;LONG Xiafei(School of Electrical and Infbnnation Engineering,Hunan University of Technology,Zhuzhou 412007,China;State Grid Zhuzhou Power Supply Company,Zhuzhou 412000,China;Hunan Engineering Research Center for Intelligent Control Technology of Photovoltaic Microgrid,Zhuzhou 412007,China)
机构地区:[1]湖南工业大学电气与信息工程学院,湖南株洲412007 [2]国网湖南省电力有限公司株洲供电分公司,湖南株洲412000 [3]光伏微电网智能控制技术湖南省工程研究中心,湖南株洲412007
出 处:《湖南电力》2021年第4期34-37,共4页Hunan Electric Power
基 金:国家自然科学基金(51977072)。
摘 要:为实现变电站建设工程二次电缆敷设长度的准确预测,避免工程建设资源浪费的问题,建立基于迪杰斯特拉(Dijkstra)算法的二次电缆路径优化模型。首先,对变电站的路径环境进行建模,建立栅格地图;其次,通过对传统Dijkstra算法、改进后的Dijkstra算法和蚁群算法分别在栅格地图上进行路径规划,并进行实验仿真与对比;最后,仿真验证了改进后算法规划路径长度比传统Dijkstra算法减少24.32%和28.66%,比蚁群算法减少了12.34%。这为未来变电站二次电缆敷设提供了一些有益的理论参考。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.
关 键 词:DIJKSTRA算法 变电站 二次电缆
分 类 号:TM757[电气工程—电力系统及自动化]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.30