| 用网络规划法进行事故自动选择 |
| |
| 引用本文： | 徐国禹,朱继忠.用网络规划法进行事故自动选择[J].重庆大学学报(自然科学版),1988,11(3). |
| |
| 作者姓名： | 徐国禹 朱继忠 |
| |
| 作者单位： | 重庆大学电气工程系
(徐国禹)，重庆大学电气工程系(朱继忠) |
| |
| 摘 要： | 本文提出了用网络规划法对预想事故进行自动选择和排序,建立了基于经济性和安全性(负荷重要程度切除)的几种数学模型,以总负荷削减量或其加权值为性能指标,解算方法都采用不良状态校正法(OKA)。并以IEEE30节点系统在IBM-PC微机上进行验算,获得了满意的结果。
|
| 关 键 词： | 网络流 安全调度 经济调度 |
AUTOMATIC CONTINGENCY SELECTION AND RANKING BY NETWORK PROGRAMMING APPROACH |
| |
| Xu Guoyu Zhu Jizhong.AUTOMATIC CONTINGENCY SELECTION AND RANKING BY NETWORK PROGRAMMING APPROACH[J].Journal of Chongqing University(Natural Science Edition),1988,11(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 |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《重庆大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆大学学报(自然科学版)》下载免费的PDF全文 |
