Overview Statistic: PDF-Downloads (blue) and Frontdoor-Views (gray)

Day and time aggregations for optimal design of energy supply systems with storage units by a hierarchical MILP method

  • Mixed-integer linear programming (MILP) methods have been applied widely to optimal design of energy supply systems. A hierarchical MILP method has been proposed to solve such optimal design problems efficiently. In addition, some strategies have been proposed to enhance the computation efficiency furthermore. As one of the strategies, a method of reducing model by time aggregation has been proposed to search design candidates efficiently in the relaxed optimal design problem at the upper level. In this paper, the hierarchical MILP method with the strategies is extendedly applied to the optimal design of energy supply systems with storage units. Especially, the method of reducing model is extended by aggregating both representative days and sampling times separately in consideration of the characteristics of energy storage units. A case study is conducted on the optimal design of a cogeneration system with a thermal storage tank. Through the study, it turns out the hierarchical MILP method is effective to derive the optimal solutions in short computation times. It also turns out that the model reduction with day and time aggregations is effec- tive to shorten the computation times furthermore when the number of candidates for equipment capacities is relatively small.

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Author:Ryohei Yokoyama, Yuji Shinano, Tetsuya Wakui
Document Type:Article
Parent Title (English):The 35th International Conference on Efficiency, Cost, Optimization, Simulation and Environmental Impact of Energy Systems (ECOS 2022)
First Page:1891
Last Page:1902
Year of first publication:2022
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.