A convex model for optimal day-ahead dispatch considering wind generators and network reconfiguration

IECON 2017 - 43rd Annual Conference of the IEEE Industrial Electronics Society(2017)

引用 0|浏览6
暂无评分
摘要
This paper proposes a mixed-integer quadratic programming (MIQP) model for optimal day-ahead distribution networks dispatch considering Wind Generators (WGs) and topology reconfiguration. Firstly, linearized current injection model is introduced for generators by a series of approximations. Then the day-ahead Switching Operations (SOs) of reconfiguration could be calculated in a linear form based on the fixed characteristic of network topology. Finally, the costs of power loss and SOs are minimized by our model while the linear constraints, e.g. nodal voltage (NV) constraints and branch current constraints, are considered. The simulation results on IEEE-33 system demonstrate that the proposed model is feasible and effective.
更多
查看译文
关键词
convex,distribution networks,day-ahead dispatch,Wind Generators,network reconfigurations
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要