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

Search for K-best solutions in optimal design of energy supply systems by an extended MILP hierarchical branch and bound method

  • For the purpose of making a decision in the optimal design of an energy supply system, it is important to investigate not only the optimal solution but also suboptimal ones which follow the optimal one without any omissions, what are called K-best solutions. In this paper, a mixed-integer linear programming method utilizing the hierarchical relationship between design and operation variables proposed previ- ously is extended to search the K-best solutions very efficiently. In addition, methods for updating the incumbents are incorporated into the extended method for three options for the criterion set newly in deriving the K-best solutions. This extended method is implemented into open and commercial MILP solvers, and is applied to illustrative and practical case studies, respectively, on the optimal design of cogeneration systems. Through the studies, it turns out that the proposed method is much superior in terms of solution optimality and computation efficiency to a conventional method, and that the computation efficiency to derive one of the K-best solutions by the proposed method increases with the number of K-best solutions. In addition, features of the K-best solutions in the value of objective function are clarified.

Export metadata

Additional Services

Share in Twitter Search Google Scholar Statistics - number of accesses to the document
Metadaten
Author:Ryohei Yokoyama, Yuji Shinano, Syusuke Taniguchi, Tetsuya Wakui
Document Type:Article
Parent Title (English):Energy
Volume:184
First Page:45
Last Page:57
Year of first publication:2019
DOI:https://doi.org/https://doi.org/10.1016/j.energy.2018.02.077
Accept ✔
Diese Webseite verwendet technisch erforderliche Session-Cookies. Durch die weitere Nutzung der Webseite stimmen Sie diesem zu. Unsere Datenschutzerklärung finden Sie hier.