Multi-area economic dispatch with tie line constraints
暂无分享,去创建一个
This paper presents a new method for solving the multi-area power system economic dispatch (MAED) problem with tie line constraints. This formulation extends the traditional economic dispatch methods used in study applications such as unit commitment to include area demand constraints, area reserve constraints, and tie line capacity constraints between the modeled areas. The MAED is formulated as a capacitated nonlinear network flow problem which is solved using a high-speed network load flow code. The MAED determines the amount of power that can be economically generated in one area and transferred to another area to displace generation in the second area. The network flow model does not compute the actual power transfer between areas. The paper demonstrates that a significant number of the problem constraints may be formulated as network-type, and as a result, the method provides a robust, high-speed solution method for surprisingly large class of electric utility problems including the ability to analyze potential purchases and sales in a multi-area power system environment.
[1] C.-a. Li,et al. Implementation of network flow programming to the hydrothermal coordination in an energy management system , 1993 .
[2] B Stott,et al. Linear Programming for Power-System Network Security Applications , 1979, IEEE Transactions on Power Apparatus and Systems.
[3] F. N. Lee,et al. Short-term thermal unit commitment-a new method , 1988 .