| 非线性最小费用网络流新算法及其应用 |
| |
| 引用本文： | 夏清,相年德,王世缨,张伯明,黄眉.非线性最小费用网络流新算法及其应用[J].清华大学学报(自然科学版),1987(4). |
| |
| 作者姓名： | 夏清 相年德 王世缨 张伯明 黄眉 |
| |
| 作者单位： | 电机工程系
(夏清，相年德，王世缨，张伯明)，电机工程系(黄眉) |
| |
| 摘 要： | 本文提出了新的非线性最小费用网络流的最优性定理和相应的算法，建立了适用于梯级水电站群短期经济调度的计算网络模型，给出了适于求解这个模型的最小费用增广路径和最大费用减广路径的算法。应用本文提出的理论和算法进行梯级水电站群短期经济调度计算，计算速度有明显提高，优化结果也更为精确。
|
| 关 键 词： | 网络规划 最优化方法 电力系统 经济调度 |
A New Algorithm of Nonlinear Minimum Cost Network Flow and its Application |
| |
| Xia Qing,Xiang Niande,Wang Shiying,Zhang Boming,Huang Mei.A New Algorithm of Nonlinear Minimum Cost Network Flow and its Application[J].Journal of Tsinghua University(Science and Technology),1987(4). |
| |
| Authors: | Xia Qing Xiang Niande Wang Shiying Zhang Boming Huang Mei |
| |
| Institution: | Department of Electrical Engineering |
| |
| Abstract: | This paper, an extension of the previous paper written by one of the authors, presents a new optimality condition theorem and an algorithm of nonlinear minimum cost network flow. The network model of optimal daily scheduling of cascaded plants is revised by introducing a computational network model. Making full use of its acyclic and cascaded properties, an algorithm for searching minimum cost flow-augmenting path and maximum cost flow-reducing path is proposed. Calculations for four groups of cascaded plants and for the example show that the computational speed is increased and the accuracy of the results is improved. |
| |
| Keywords: | network planning optimization method power system economic scheduling |
| 本文献已被 CNKI 等数据库收录！ |
