Journal
COMPUTERS & CHEMICAL ENGINEERING
Volume 112, Issue -, Pages 70-81Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.compchemeng.2018.01.023
Keywords
Optimal design; Synthesis; Energy system; Decomposition; Time-series aggregation; Cluster method
Funding
- German Federal Ministry for Economic Affairs and Energy [03ET1259A]
Ask authors/readers for more resources
The synthesis of complex energy systems usually involves large time series such that a direct optimization is computationally prohibitive. In this paper, we propose a decomposition method for synthesis problems using time-series aggregation. To initialize the method, the time series is aggregated to one time step. A lower bound is obtained by relaxing the energy balances and underestimating the energy demands leading to a relaxed synthesis problem, which is efficiently solvable. An upper bound is obtained by restricting the original problem with the full time series to an operation problem with a fixed structure obtained from the lower bound solution. If the bounds do not satisfy the specified optimality gap, the resolution of the time-series aggregation is iteratively increased. The decomposition method is applied to two real-world synthesis problems. The results show the fast convergence of the decomposition method outperforming commercial state-of-the-art optimization software. (c) 2018 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available