期刊文献+

基于模拟退火算法的风电场消纳线路负载拓扑结构研究

Load Topology Structure of Wind Farm Dissipation Line based on Simulated Annealing Algorithm
下载PDF
导出
摘要 基于当前线路负载率具有较高的突发性、较高的实时性等特点,将对线路资源利用率和电流控制问题所采用的模拟退火算法进行风电场拓扑结构模型优化。利用模拟退火算法对线路负载均衡问题进行搜索,随后在全局最优区域附近进行局部拓扑结构优化,就可以找到线路负载均衡问题最优解。仿真研究表明,此方法不但完善了局部搜索速度,还提高了线路消纳的利用率,明显改善了线路拓扑负载不均衡的情形,进而可以为大型风电场建设中的功率设备线路拓扑优化提供有效的参考。 Based on characteristics of the current line load rate,such as high abruptness and high real-time performance,the simulated annealing algorithm employed in line resource utilization and current control issues will be used to optimize the wind farm topology structure model.By using the simulated annealing algorithm to search the line load balancing problem,and then performing local topology optimization near the global optimal area,the optimal solution of the line load balancing problem can be found.Simulation results indicate that this method can improve not only the local search speed,but also the utilization rate of line consumption,and significantly betters the situation of unbalanced load on the line topology,which can provide an effective reference for power equipment line topology optimization in large-scale wind farm construction.
作者 杨跃 YANG Yue(School of Computing,Xi'an Shiyou University,Xi'an Shaanxi 710065,China)
出处 《通信技术》 2020年第3期684-688,共5页 Communications Technology
关键词 模拟退火算法 线路负载 拓扑优化 消纳 simulated annealing algorithm line load topology optimization consumption
  • 相关文献

参考文献2

二级参考文献26

  • 1KARGER D, KAASHOEK E STOICA I. Chord: a scalable peer-to-peer lookup service for Interact applications [A]. Proceedings ofACM SIGCOMM[C]. San Diego, 2001. 149-160.
  • 2RATNASAMY S, FRANCES P, HANDLEY M. A scalable content-addressable network [A]. Proceedings of ACM SIGCOMM[C]. San Diego, 2001. 161-172.
  • 3ZHAO B Y, HUANG L, STRIBLING J. Tapestry: a resilient global-scale overlay for service deployment [J]. IEEE Jottrnal on Selected Areas in Communications, 2004, 22(1): 41-53.
  • 4ROWSTRO A, DRUSCHEL P. Pastry: scalable, decentralized object location and routing for large-scale peer-to-peer systems [A]. Proceedings of ACM/IFIP/USENIX Middleware 2001[C]. Heidelberg, Germany, 2001. 329-350.
  • 5LI D, LU X, WU J. FISSIONE: a scalable constant degree and low congestion DHT scheme based on Kautz graphs [A]. Proceedings of IEEE INFOCOM [C]. Miami, 2005. 1677-1688.
  • 6FRANS K, KARGER D. Koorde: a simple degree-optimal distributed hash table [A]. Proceedings of IPTPS 2003 [C]. Berkeley, 2003. 98-107.
  • 7LOGUINOV D, KUMAR A, RAI V. Graph theoretic analysis of structured peer-to-peer systems: routing distances and fault resilience[A]. Proceedings of SIGCOMM[C]. Karlsruhe, 2003.395-406.
  • 8XU J, KUMMAR A, YU X. On the fundamental tradeoffs between routing table size and network diameter in peer-to-peer networks [J]. IEEE Journal on Selected Areas in Communications (JSAC), 2004, 22(1): 151-163.
  • 9CASTRO M, DRUSCHEL P, HU Y. Proximity Neighbor Selection in Tree-Based Structured Peer-to-Peer Overlays [R]. MSR-TR-2003-52, Microsoft Research, 2003.
  • 10GUMMADI K, GUMMADI R, GRIBBLE S. The impact of DHT routing geometry on resilience and proximity [A]. Proceedings of ACM SIGCOMM [C]. Karlruhe, Germany, 2003.381-394.

共引文献13

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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