Title :
Optimal daily scheduling of cascaded plants using a new algorithm of nonlinear minimum cost network flow
Author :
Qing, Xia ; Niande, Xiang ; Shiying, Wang ; Boming, Zhang ; Mei, Huang
Author_Institution :
Dept. of Electr. Eng., Tsinghua Univ., Beijing, China
fDate :
8/1/1988 12:00:00 AM
Abstract :
An optimality condition theorem and an algorithm for nonlinear minimum-cost network flow are proposed. A computational network model for optimal daily scheduling of cascaded plants (ODSCP) is established, and an algorithm for searching the minimum-cost flow-augmenting path and the maximum-cost flow-reducing path in the computational network model of ODSCP is described. Digital computations are carried out and the results show that the proposed method is very fast compared to existing methods
Keywords :
economics; load flow; optimisation; power system analysis computing; scheduling; algorithm; cascaded plants; economics; flow-augmenting path; load scheduling; nonlinear minimum cost network flow; optimal daily scheduling; optimisation; power system analysis computing; Computational modeling; Computer networks; Cost function; Linear programming; Piecewise linear techniques; Power generation; Power system modeling; Processor scheduling; Rivers; Scheduling algorithm;
Journal_Title :
Power Systems, IEEE Transactions on
