| AUTOMATIC CONTINGENCY SELECTION AND RANKING BY NETWORK PROGRAMMING APPROACH |
| |
| 作者姓名： | Xu Guoyu Zhu Jizhong |
| |
| 作者单位： | Xu Guoyu Zhu Jizhong |
| |
| 摘 要： | This paper presents a new approach ,to the automatic contingency selection and ranking by the network flow programming (NFP). A complex cost optimisation model based on economy and security, and several simplified models are proposed in the paper. The performance index is the total load curtailment or its weighted value. All the solution algorithms are OKA. The model and its algorithm is tested on IEEE 30-Bus System and the encouraging results are obtained.
|
| 关 键 词： | network flows security dispatching economic dispatching. |
AUTOMATIC CONTINGENCY SELECTION AND RANKING BY NETWORK PROGRAMMING APPROACH |
| |
| Xu Guoyu Zhu Jizhong.AUTOMATIC CONTINGENCY SELECTION AND RANKING BY NETWORK PROGRAMMING APPROACH[J].Storage & Process,1988(3). |
| |
| Authors: | Xu Guoyu Zhu Jizhong |
| |
| Institution: | Xu Guoyu Zhu Jizhong |
| |
| Abstract: | This paper presents a new approach ,to the automatic contingency selection and ranking by the network flow programming (NFP). A complex cost optimisation model based on economy and security, and several simplified models are proposed in the paper. The performance index is the total load curtailment or its weighted value. All the solution algorithms are OKA. The model and its algorithm is tested on IEEE 30-Bus System and the encouraging results are obtained. |
| |
| Keywords: | network flows security dispatching economic dispatching |
|
| 点击此处可从《保鲜与加工》浏览原始摘要信息 |
| 点击此处可从《保鲜与加工》下载免费的PDF全文 |
