Energy hub model is a powerful concept allowing the interactions of many energy conversion and storage systems to be optimized. Solving the optimal configuration and operating strategy of an energy hub combining multiple energy sources for a whole year can become computationally demanding. Indeed the effort to solve a mixed-integer linear programming (MILP) problem grows dramatically with the number of integer variables. This paper presents a rolling horizon approach applied to the optimisation of the operating strategy of an energy hub. The focus is on the computational time saving realized by applying a rolling horizon methodology to solve problems over many time-periods. The choice of rolling horizon parameters is addressed, and the approach is applied to a model consisting of a multiple energy hubs. This work highlights the potential to reduce the computational burden for the simulation of detailed optimal operating strategies without using typical-periods representations. Results demonstrate the possibility to improve by 15 to 100 times the computational time required to solve energy optimisation problems without affecting the quality of the results.
The benefits of decentralized energy systems can be realised through the optimal siting of distributed energy systems and the design of highly interlinked district heating networks within existing electrical and gas networks. The problem is often formulated as a Mixed Integer Linear Programming (MILP) problem. MILP formulations are efficient and reliable, however the computational burden increases drastically with the number of integer variables, making detailed optimisation infeasible at large urban scales. To tackle complex problems at large scale the development of an efficient and robust simplification method is required. This paper presents an aggregation schema to facilitate the optimisation of urban energy systems at city scale.Currently, spatial and/or temporal aggregation are commonly employed when modelling energy systems at spatiotemporal resolutions from plant scheduling up to national scenarios. This paper argues for solving different scales separately using a bottom-up approach, while keeping track of the error made by reducing the resolution when moving from building to urban scale. Novel modelling formulations and optimisation techniques are presented. They enable drastic reduction of the computational time (by up to a factor of 100) required to find an optimal solution in reasonable time without sacrificing the quality of the results (no more than 1% loss in accuracy).A density-based clustering algorithm enables intelligent division of a large city-scale problem into sub-optimisation problems by creating clusters of different density. In each cluster, the trade-off between centralized and decentralized energy systems and the associated district heating network design is evaluated. A solution is selected based on a local optimisation of the network costs. Demand profiles of each building are assigned appropriately, then at an upper level the energy optimisation problem is solved considering the network losses at lower levels. This method enables large-scale modelling of urban energy systems while taking into account building-scale levels of detail. The clustering method enables assessment of the potential of district heating networks on city scale based on building characteristics and available urban energy systems.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.