期刊文献+

输电网接线图增量自动成图算法 被引量:6

Automatic Drawing Algorithm for Incremental Transmission Grid Wiring Diagram
在线阅读 下载PDF
导出
摘要 输电线网接线图自动成图算法是一个非常复杂的全局优化问题.它涉及到厂站位置的自动布局和输电线路自动规划两个方面.本文给出了解决该问题的一种具体思路和算法,将该问题划分为3个部分:首先,利用力导向算法对厂站位置进行初始布局,采用模拟退火算法进行迭代计算,通过并发技术实现引力、斥力系数进行选择,得到代价最小的初始厂站初始布局.其次,利用A*算法对输电线路进行线路规划,构建了一个线路走向的代价模型,通过代价模型规范线路走向,得到美观的线路布局.最后,对布局结果评价反馈再布局,将常见的几种布局缺陷通过程序的方式进行消缺,减少人工干预.同时,本文还对历史线路和新增线路做了处理,使得算法可以实现在不改变历史厂站线路布局的情况下,对新增厂站线路进行布局规划.通过实验显示,该方法得到的图形结果满足线路规划美观,布局合理,交叉少,拐角少等优点. The automatic mapping algorithm for the transmission line network wiring diagram is a very complex global optimization problem.It involves two aspects:the automatic layout of the plant site and the automatic planning of the transmission line.In this study,a specific idea and algorithm for solving this problem are given.The issue is divided into three parts:the first part uses the force-oriented algorithm to make the initial layout of the plant station position,and uses the simulated annealing algorithm to perform iterative calculation,which is realized by concurrent technology.The gravitational and repulsion coefficients are selected to obtain the initial layout of the initial plant with the least cost.In the second part,the A*algorithm is used to plan the transmission line,and a cost model of the line direction is constructed.The cost model is used to standardize the line and obtain a beautiful line layout.In the third part,the layout results are evaluated and feedbacked,and the common layout defects are eliminated through the program,which reduces manual intervention.At the same time,the study also processed the historical line and the newly added line,so that the algorithm can realize the layout planning of the newly added station line without changing the layout of the historical plant station.The experimental results show that the graphical results obtained by the method satisfy the advantages of beautiful line planning,reasonable layout,less crossover,and less corners.
作者 沈自虎 吴淑玮 葛艺晓 张守田 SHEN Zi-Hu;WU Shu-Wei;GE Yi-Xiao;ZHANG Shou-Tian(NARI Group Corporation Information&Communication Technology Co.Ltd.,NARI Group Corporation(State Grid Electric Power Research Institute),Nanjing 210003,China)
出处 《计算机系统应用》 2020年第5期128-135,共8页 Computer Systems & Applications
关键词 力导向算法 A*算法 模拟退火 增量成图 代价模型 force-oriented algorithm A*algorithm simulated annealing incremental mapping cost model
  • 相关文献

参考文献6

二级参考文献60

  • 1段凡丁.关于最短路径的SPFA快速算法[J].西南交通大学学报,1994,29(2):207-212. 被引量:58
  • 2孙涛,谷士文,费耀平.基于PCA算法的人脸识别方法研究比较[J].现代电子技术,2007,30(1):112-114. 被引量:14
  • 3张伯明,孙宏斌,吴文传.3维协调的新一代电网能量管理系统[J].电力系统自动化,2007,31(13):1-6. 被引量:83
  • 4玄光男 程润伟.遗传算法与工程设计[M].北京:科学出版社,2000..
  • 5T. H. Cormen, C. E. Leiserson, R. L. Rivest, et al. Introduction to Algorithms[ M ]. McGraw - Hill ,2001.
  • 6Steven M. LaVatle Planning Algorithms [ M ]. Cambridge University Press,2006.
  • 7Ismail Chabini,Shan Lan. Adaptations of the A* Algorithm for the Computation of Fastest Paths in Deterministic Discrete- Time Dynamic Networks[ C ]// IEEE Transactions on Intelligent Transportation Systems, 2004.
  • 8Taeg - Keun Whangbo. Efficient Modified Bidirectional A* Algorithm for Optimal Route - Finding [ J ]. lEA/ AIE2007, LNAI 4570, pp. 344 - 353,2007.
  • 9Elbeltagi E, Hegazy T, Hosny AD, et al. Schedule - dependent evolution of site layout planning[ J]. Constr Manage Econ 2003 ; 19:89 97.
  • 10Hart PE, Nilsson NJ, Raphael B. Correction to A formal basis for the heuristic determination of minimum cost paths[ J]. SIGART Newslett. 1972 ;37:28 9.

共引文献104

同被引文献81

引证文献6

二级引证文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部