| 输电网络优化规划的两步算法 |
| |
| 引用本文： | 黄眉,王仲鸿,韩英铎,童陆园,周贵安. 输电网络优化规划的两步算法[J]. 清华大学学报(自然科学版), 1987, 0(1) |
| |
| 作者姓名： | 黄眉 王仲鸿 韩英铎 童陆园 周贵安 |
| |
| 作者单位： | 电机工程系(黄眉，王仲鸿，韩英铎，童陆园)，电机工程系(周贵安) |
| |
| 摘 要： | 输电规划是要选译一组待建线路，消除输电网络中某些线路的潮流过载现象，同时使所需总投资和运行费用最小。这是一个变量数目很大的非线性整数规划问题。本文提出两种新模型，组成一个实用的两步求解算法。第一步不考虑变量的整数约束，用修正单纯形法求解，由此可确定一部分线路是否需要建设。第二步在缩小的可选线路范围内进行整数规划计算，从而快速形成电网发展方案。文中通过算例说明了方法的功能和算题过程。
|
| 关 键 词： | 电力系统计算 输电规划 最优化技术 |
Two-step Algorithm for Optimized Planning of Power Transmission Network |
| |
| Huang Mei,Wang Zhonghong,Han Yingduo,Tong Luyuan,Zhou Guian. Two-step Algorithm for Optimized Planning of Power Transmission Network[J]. Journal of Tsinghua University(Science and Technology), 1987, 0(1) |
| |
| Authors: | Huang Mei Wang Zhonghong Han Yingduo Tong Luyuan Zhou Guian |
| |
| Affiliation: | Department of Electrical Engineering |
| |
| Abstract: | The task of transmission planning is to choose a set of network reinforcements to relieve line overloads in a transmission network at lowest cost. This is a large nonlinear integer programming problem. This paper proposes a practical two-step algorithm to solve it. The revised simplex method is used at first to calculate the optimal line extensions without integer constraints of the variables so that it can be determined which lines should be constructed. Then, the integer programming is done only for a few of line candidations. So the plans of network extension can be developed rapidly. Two case studies presented in the paper demonstrate the effectiveness of this algorithm. |
| |
| Keywords: | power system computation transmission planning optimization techniques. |
| 本文献已被 CNKI 等数据库收录！ |
