Abstract
This paper presents and compares two systematic and effective approaches for the hydroelectric generation scheduling problem (HSP). The objective of the HSP is to determine the best substitution of hydro energy for thermal energy in electric generation so that the fuel cost is minimized while meeting the system load and constraints. In the first approach, HSP is formulated as an optimal control problem, for which multiplier method-based differential dynamic programming algorithm developed by Chen et. al. ([CCF88]) is adopted as the solution algorithm. The second approach exploits the network structure of the water balance relation and takes linear approximation of the first formulation to formulate HSP as a minimum cost, linear network flow problem. Bertsekas and Tsengs’ RELAX code is applied to solve such a large-scale network optimization problem. Numerical results indicate that both approaches generate results close to TPC’s empirical schedules, are efficient in computation and suggest predictive operation strategies. We address the differences between the two approaches in solution optimality and computational efficiency and provide necessary information for tradeoffs in selecting a suitable approach.
This work was supported in part by the National Science Council of the Republic of China under Grants NSC-77-0404-E002-03 and NSC-78-0404-E002-17.
Preview
Unable to display preview. Download preview PDF.
References
[Ber82] D. P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods, Academic Press, 1982.
[BeT88] D. P. Bertsekas and P. Tseng, “Relaxation methods for minimum cost ordinary and generalized network flow problem.” Operations Research, Vol. 36, No. 1, pp. 93–144, 1988.
[CCF88] C. H. Chen, S. C. Chang, I. K. Fong, “A multiplier method—based differential dynamic programming algorithm,” Proceedings of the 12th National Symposium on Automatic Control, Hsin-Chu, Taiwan, Dec. 1988, pp. 481–491.
[CCF90] S. C. Chang, C. H. Chen, I. K. Fong, P. B. Luh, “Hydroelectric generation scheduling with an effective differential dynamic programming algorithm,” to Appear in IEEE Trans. on Power System Engineering, paper #90 WM 014-1 PWRS.
[LSH81] D. Loucks, J. Stedinger, D. Haith, Water resource systems planning and analysis. Prentice-Hall, Englewood cliffs, NJ, 1981.
[WMM82] F. Wakamori, S. Masui, K. Morita, T. Sugiyama, “Layered network model approach to optimal daily hydro scheduling,” IEEE Trans. on PAS, Vol. PAS-101, No. 9, 1982.
[WoW84] A. J. Wood and B. F. Wollenberg, Power Generation Operation & Control, New York: Wiley, 1984.
[Yak82] S. Yakowitz, “Dynamic programming applications in water resources,” Water Resource Research, Vol. 18, No. 4, pp. 673–696, 1982.
[YaR84] S. Yakowitz and B. Rutherford, “Computational aspects of discrete-time optimal control,” Appl. Math. Comput. Vol. 15, No. 1, pp. 29–45, 1984.
[Yeh85] W. W-G Yeh, “Reservoir management and operations models: state-of-the-art review,” Water Resources Research, Vol. 21, No. 12, pp. 1797–1818, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag
About this paper
Cite this paper
Chang, SC., Yang, WL., Fong, IK., Chen, CH. (1990). Two effective approaches for hydroelectric generation scheduling. In: Bensoussan, A., Lions, J.L. (eds) Analysis and Optimization of Systes. Lecture Notes in Control and Information Sciences, vol 144. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0120036
Download citation
DOI: https://doi.org/10.1007/BFb0120036
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52630-8
Online ISBN: 978-3-540-47085-4
eBook Packages: Springer Book Archive