期刊文献+

Day-ahead Voltage-stability-constrained Network Topology Optimization with Uncertainties

原文传递
导出
摘要 A day-ahead voltage-stability-constrained network topology optimization(DVNTO)problem is proposed to find the day-ahead topology schemes with the minimum number of operations(including line switching and bus-bar splitting)while ensuring the sufficient hourly voltage stability margin and the engineering operation requirement of power systems.The AC continuation power flow and the uncertainty from both renewable energy sources and loads are incorporated into the formulation.The proposed DVNTO problem is a stochastic,largescale,nonlinear integer programming problem.To solve it tractably,a tailored three-stage solution methodology,including a scenario generation and reduction stage,a dynamic period partition stage,and a topology identification stage,is presented.First,to address the challenges posed by uncertainties,a novel problem-specified scenario reduction process is proposed to obtain the representative scenarios.Then,to obtain the minimum number of necessary operations to alter the network topologies for the next 24-hour horizon,a dynamic period partition strategy is presented to partition the hours into several periods according to the hourly voltage information based on the voltage stability problem.Finally,a topology identification stage is performed to identify the final network topology scheme.The effectiveness and robustness of the proposed three-stage solution methodology under different loading conditions and the effectiveness of the proposed partition strategy are evaluated on the IEEE 118-bus and 3120-bus power systems.
出处 《Journal of Modern Power Systems and Clean Energy》 SCIE EI CSCD 2024年第3期730-741,共12页 现代电力系统与清洁能源学报(英文)
基金 supported by the National Natural Science Foundation of China(No.52377109) the Natural Science Foundation of Shandong Province(No.ZR2022ME187) the Taishan Scholar Project of Shandong Province(No.TSQN202306191)。
  • 相关文献

参考文献6

二级参考文献38

  • 1诸克军,苏顺华,黎金玲.模糊C-均值中的最优聚类与最佳聚类数[J].系统工程理论与实践,2005,25(3):52-61. 被引量:69
  • 2刘蔚,韩祯祥.基于时间区间的配电网重构[J].电力系统自动化,2006,30(10):33-38. 被引量:24
  • 3Wang C, Cheng H Z ,. Optimization of network configuration in large distribution systems using plant growth simulation algorithm[J]. IEEE Transactions on Power Systems, 2008, 23(1): 119-126.
  • 4Niknam T, Azadfarsani E, Jabbari M. A new hybrid evolutionary algorithm based on new fuzzy adaptive PSO and NM algorithm for Distribution Feeder Reconfiguration[J]. Energy Conversion and Management, 2012(54): 7-16.
  • 5Tortes J, Guardado J.L, Rivas-Davalos F, et al. A genetic algorithm based on the edge window decoder technique to optimize power distribution systems reconfiguration [J]. Electrical Power and Energy Systems, 2013(45): 28-34.
  • 6Mistry K, Roy R. Enhancement of voltage stability index of distribution system by network reconfiguration including static load model and daily load curve[C]// Innovative Smart Grid Technologies. Kollam. India: IEEE Power Electronics Society, 2011: 17-22.
  • 7Zidan A, El-Saadany E F. Multi-objective network reconfiguration in balanced distribution systems with variable demand[C]//2nd International Conference on Electric Power and Energy Conversion Systems. Sharjah, United Arab Emirates: IEEE, 2011: 1-6.
  • 8Shariatkhah M H, Haghifam M R, Salehi J, et al. Duration based reconfiguration of electric distribution networks using dynamic programming and harmony search algorithm[J]. Electrical Power and Energy Systems, 2012(41): 1-10.
  • 9Milani A E, Haghifam M R. An evolutionary approach for optimal time interval determination in distribution network reconfiguration under variable load [J]. Mathematical and Computer Modelling, 2013(57): 68-77.
  • 10Lam A Y S, Li V 0 K. Chemical-reaction-inspired metaheuristic for optimization[ J]. . IEEE Transactions on Evolutionary Computation, 2010, 14(3): 381-399.

共引文献86

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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