IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v15y2022i12p4503-d843496.html
   My bibliography  Save this article

A Simplified Solution Method for End-of-Term Storage Energy Maximization Model of Cascaded Reservoirs

Author

Listed:
  • Xinyu Wu

    (Insititute of Hydropower System & Hydroinformatics, Dalian University of Technology, Dalian 116024, China)

  • Ruixiang Cheng

    (Insititute of Hydropower System & Hydroinformatics, Dalian University of Technology, Dalian 116024, China)

  • Chuntian Cheng

    (Insititute of Hydropower System & Hydroinformatics, Dalian University of Technology, Dalian 116024, China)

Abstract

In medium-term scheduling, the end-of-term storage energy maximization model is proposed to create conditions for the safety, stability and economic operation of the hydropower system after control term, which satisfies the system load demand undertaken by the cascaded system in a given scheduling period. This paper presents a simplified solution method based on the Lagrangian relaxation method (LR) to solve the end-of-term storage energy maximization model. The original Lagrange dual problem with multiple Lagrange multipliers is converted to that with only one Lagrange multiplier by an entropy-based aggregate function method, which relaxes the complex cascaded hydropower system load balance constraints. The subgradient method and successive approximation of dynamic programming (DPSA) are adopted to update the Lagrange multiplier iteratively and solve the subproblem of the Lagrange dual problem, respectively. The Wujiang cascaded hydropower system is studied, and the result shows that the simplified solution method for the end-of-term storage energy maximization model both improves solving efficiency and ensures solving accuracy to a great extent.

Suggested Citation

  • Xinyu Wu & Ruixiang Cheng & Chuntian Cheng, 2022. "A Simplified Solution Method for End-of-Term Storage Energy Maximization Model of Cascaded Reservoirs," Energies, MDPI, vol. 15(12), pages 1-18, June.
    • Handle: RePEc:gam:jeners:v:15:y:2022:i:12:p:4503-:d:843496
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/15/12/4503/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/15/12/4503/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Pan Liu & Shenglian Guo & Xiaowei Xu & Jionghong Chen, 2011. "Derivation of Aggregation-Based Joint Operating Rule Curves for Cascade Hydropower Reservoirs," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 25(13), pages 3177-3200, October.
    2. D. Kumar & M. Reddy, 2006. "Ant Colony Optimization for Multi-Purpose Reservoir Operation," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 20(6), pages 879-898, December.
    3. Shang, Yizi & Lu, Shibao & Ye, Yuntao & Liu, Ronghua & Shang, Ling & Liu, Chunna & Meng, Xianyong & Li, Xiaofei & Fan, Qixiang, 2018. "China’ energy-water nexus: Hydropower generation potential of joint operation of the Three Gorges and Qingjiang cascade reservoirs," Energy, Elsevier, vol. 142(C), pages 14-32.
    4. Marshall L. Fisher, 1981. "The Lagrangian Relaxation Method for Solving Integer Programming Problems," Management Science, INFORMS, vol. 27(1), pages 1-18, January.
    5. Liao, Shengli & Liu, Huan & Liu, Zhanwei & Liu, Benxi & Li, Gang & Li, Shushan, 2021. "Medium-term peak shaving operation of cascade hydropower plants considering water delay time," Renewable Energy, Elsevier, vol. 179(C), pages 406-417.
    6. He, Zhongzheng & Wang, Chao & Wang, Yongqiang & Wei, Bowen & Zhou, Jianzhong & Zhang, Hairong & Qin, Hui, 2021. "Dynamic programming with successive approximation and relaxation strategy for long-term joint power generation scheduling of large-scale hydropower station group," Energy, Elsevier, vol. 222(C).
    7. Marshall L. Fisher, 1985. "An Applications Oriented Guide to Lagrangian Relaxation," Interfaces, INFORMS, vol. 15(2), pages 10-21, April.
    8. Liu, Benxi & Cheng, Chuntian & Wang, Sen & Liao, Shengli & Chau, Kwok-Wing & Wu, Xinyu & Li, Weidong, 2018. "Parallel chance-constrained dynamic programming for cascade hydropower system operation," Energy, Elsevier, vol. 165(PA), pages 752-767.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
    2. Mazzola, Joseph B. & Neebe, Alan W., 1999. "Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type," European Journal of Operational Research, Elsevier, vol. 115(2), pages 285-299, June.
    3. Huisman, D. & Jans, R.F. & Peeters, M. & Wagelmans, A.P.M., 2003. "Combining Column Generation and Lagrangian Relaxation," ERIM Report Series Research in Management ERS-2003-092-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    4. J. E. Beasley, 1990. "A lagrangian heuristic for set‐covering problems," Naval Research Logistics (NRL), John Wiley & Sons, vol. 37(1), pages 151-164, February.
    5. Lawrence V. Snyder & Mark S. Daskin, 2005. "Reliability Models for Facility Location: The Expected Failure Cost Case," Transportation Science, INFORMS, vol. 39(3), pages 400-416, August.
    6. X-Y Li & Y P Aneja & F Baki, 2010. "An ant colony optimization metaheuristic for single-path multicommodity network flow problems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(9), pages 1340-1355, September.
    7. Ahmadi, Reza H. & Kouvelis, Panagiotis, 1999. "Design of electronic assembly lines: An analytical framework and its application," European Journal of Operational Research, Elsevier, vol. 115(1), pages 113-137, May.
    8. Beasley, J. E. & Cao, B., 1996. "A tree search algorithm for the crew scheduling problem," European Journal of Operational Research, Elsevier, vol. 94(3), pages 517-526, November.
    9. Ojeong Kwon & Donghan Kang & Kyungsik Lee & Sungsoo Park, 1999. "Lagrangian relaxation approach to the targeting problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 46(6), pages 640-653, September.
    10. Ali Diabat & Jean-Philippe Richard & Craig Codrington, 2013. "A Lagrangian relaxation approach to simultaneous strategic and tactical planning in supply chain design," Annals of Operations Research, Springer, vol. 203(1), pages 55-80, March.
    11. Foad Iravani & Sriram Dasu & Reza Ahmadi, 2012. "A Hierarchical Framework for Organizing a Software Development Process," Operations Research, INFORMS, vol. 60(6), pages 1310-1322, December.
    12. Leyla Ozsen & Mark S. Daskin & Collette R. Coullard, 2009. "Facility Location Modeling and Inventory Management with Multisourcing," Transportation Science, INFORMS, vol. 43(4), pages 455-472, November.
    13. Marshall L. Fisher, 2004. "Comments on ÜThe Lagrangian Relaxation Method for Solving Integer Programming ProblemsÝ," Management Science, INFORMS, vol. 50(12_supple), pages 1872-1874, December.
    14. Mark S. Daskin, 2008. "What you should know about location modeling," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(4), pages 283-294, June.
    15. Kaiyue Zheng & Laura A. Albert, 2019. "Interdiction models for delaying adversarial attacks against critical information technology infrastructure," Naval Research Logistics (NRL), John Wiley & Sons, vol. 66(5), pages 411-429, August.
    16. Snyder, Lawrence V. & Daskin, Mark S. & Teo, Chung-Piaw, 2007. "The stochastic location model with risk pooling," European Journal of Operational Research, Elsevier, vol. 179(3), pages 1221-1238, June.
    17. Cattrysse, D. G. & van Wassenhove, L. N., 1990. "A Survey Of Algorithms For The Generalized Assignment Problem," Econometric Institute Archives 272389, Erasmus University Rotterdam.
    18. Fang, Zhou & Liao, Shengli & Cheng, Chuntian & Zhao, Hongye & Liu, Benxi & Su, Huaying, 2023. "Parallel improved DPSA algorithm for medium-term optimal scheduling of large-scale cascade hydropower plants," Renewable Energy, Elsevier, vol. 210(C), pages 134-147.
    19. S Bilgin & M Azizoǧlu, 2006. "Capacity and tool allocation problem in flexible manufacturing systems," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 57(6), pages 670-681, June.
    20. Peter Francis & Karen Smilowitz & Michal Tzur, 2006. "The Period Vehicle Routing Problem with Service Choice," Transportation Science, INFORMS, vol. 40(4), pages 439-454, November.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jeners:v:15:y:2022:i:12:p:4503-:d:843496. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.