SearcharxivSearch

arXiv · 2007.10105

Enforcing Annual Emission Constraints in Short-Term Operation of Local Energy Systems

Abstract

This paper presents new methods for ensuring that the energy system of a neighborhood that is designed with the objective of being zero emission is actually operated in a way that allows it to reach net zero emissions in its lifetime. This paper highlights the necessity of taking into account realistic operation strategies when designing the energy system of such neighborhoods. It also suggests methods that can be used in the operation of ZENs to ensure carbon neutrality. An optimization model for designing the energy system of a Zero Emission Neighborhood (ZEN) is first presented and used to produce two designs for a campus in the South of Norway in the case where the amount of PV is limited (PVlim) and when it is not (Base). Several operation approaches are then introduced to compare their operation cost and the CO2 emissions and compensations. These approaches are perfect foresight used as a reference (Ref.),a purely economic model predictive control (E-MPC), an MPC with penalization if deviating from emission targets (EmE-MPC)and a receding horizon MPC where we have a net zero emission constraint over the year (RH-MPC). The resulting energy systems are, in the Base case, PV, heat pumps, a gas boiler and heat storage and, in the PVlim case, a smaller amount of PV, a CHP plant, and heat storage. In the Base case all operation strategies manage to reach net zero emissions, largely due to the passive compensations obtained from the PV. RH-MPC offers the lowest cost. In the PVlim case, the passive effect of the PV is not sufficient to reach net zero emissions and an operation approach specifically taking into account the emissions is necessary. EmE-MPC achieves the lowest emissions but it comes at a much higher cost. We conclude that the best overall strategy is RH-MPC which maintains both the cost and the emission-compensation balance close to the reference case with perfect foresight.

Explore related subjects

Keep this discovery

BibTeXRIS

Dimitri Pinel, Magnus Korpås. 2020-07-20. Enforcing Annual Emission Constraints in Short-Term Operation of Local Energy Systems. https://arxiv.org/abs/2007.10105

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Deterministic and Random Bipartite Matching on General Networks: Convex Flow Reformulation, Asymptotic Properties, and Fast Algorithms

Minimum-distance bipartite matching on general networks has numerous applications various fields. This paper first focuses on deterministic problems and presents an exact edgewise-separable convex-flow reformulation. By introducing a smooth monotone rearrangement approximation of the edge-wise imbalance profiles, the convex-flow reformulation's can be solved efficiently. If we further conduct a first-order resistance-based approximation of the convex program, a one-step Laplacian-based estimator can be analytically derived in closed forms. The paper also studies random problems where supply and demand points are randomly distributed. We show that the expected optimal matching distance scales with the square root of the number of points if the supply/demand point distributions are identical, or linearly otherwise. In the former case, the optimal flow is proven to be centered, symmetric, and sub-Gaussian. In the latter case, the limiting resistance network characterizes how supply-demand imbalance is redistributed and motivates a fast algorithm that approximate the optimal flow based on the limiting resistance. Numerical experiments show that the proposed estimators closely approximate the exact matching cost while substantially reducing computation time. The proven theoretical properties of the random matching solution are numerically verified by large-scale Monte Carlo simulations.

math.OC

Conformal-DRO: Distributionally Robust Optimization with Conformalized Ambiguity Set

Data-driven distributionally robust optimization (DRO) typically treats the conditional outcome law as fixed and uses ambiguity sets to capture estimation error. This paper studies latent distributional heterogeneity, where each instance has an unobserved law but contributes only one observation, so uncertainty persists even if the mixture law is known. We propose Conformal-DRO, which uses nested conformal regions to construct an ambiguity set for the future latent law. Under exchangeability, the set covers this law with probability at least $1-\alpha$ in finite samples, without estimating underlying latent laws or their mixing mechanism. The conformal path induces a data-driven transport geometry, while $\alpha$ determines the radius. The worst-case problem reduces to a finite linear program over conformal shells and admits sparse adversarial solutions. The resulting robust value provides a finite-sample certificate for the selected decision's expected cost.

math.OC

The best approximation tuple: an extension of the Cheney-Goldstein algorithm and results to the multiple sets case

In this paper we extend the algorithm and several results published in the celebrated 1959 paper of Cheney and Goldstein about the best approximation pair (BAP) problem in two separate directions. One is the consideration of more than two sets. The other is the ability to handle each set as an intersections of a finite family of sets. We call the resulting problem the "Best Approximation Tuple (BAT) problem". The fundamental observation that leads to this generalizations is to recognize and handle one set (the "pivot set") as different from the remaining sets (the "satellite sets") instead of seeking cycles as the minimizers of a target functional. This enable us to overcome a certain theoretical obstacle related to cycles and minimizers of general functionals. We prove the convergence of the algorithm to the unique solution of the problem in the Euclidean case with strictly convex and compact satellite sets. Because of the lack of Fej\'er monotonicity, our convergence analysis is not standard, and is based on almost unknown properties of orthogonal projections regarding equality and inequality in the definition of nonexpansiveness.

math.OC