SearcharxivSearch

arXiv · 2401.07425

Net-Zero Energy House-oriented Linear Programming for the Sizing Problem of Photovoltaic Panels and Batteries

Abstract

The global drive towards carbon neutrality has led to a significant increase in the number of power plants based on renewable energy sources (RES). Concurrently, numerous households are adopting RES to generate their own energy, aiming to decrease both electricity costs and carbon footprints. To support these users, many papers have been devoted to developing optimal investment strategies for residential energy systems. However, there is still a significant gap as these studies often neglect important aspects like carbon neutrality. For this reason, in this paper, we explore the concept of net-zero energy houses (ZEHs) -- houses designed to have an annual net energy consumption around zero -- by presenting a constrained optimization problem to find the optimal number of photovoltaic panels and the optimal size of the battery system for home integration. Solving this constrained optimization problem is difficult due to its nonconvex constraints. Nevertheless, by applying a series of transformations, we reveal that it is possible to find an equivalent linear programming (LP) problem which is computationally tractable. The attainment of ZEH can be tackled by introducing a single constraint in the optimization problem. Additionally, we propose a sharing economy approach to the investment problem, offering a strategy that could potentially reduce investment costs and facilitate the attainment of ZEH more efficiently. Finally, we apply the proposed frameworks to a neighborhood in Japan as a case study, demonstrating the potential for long-term ZEH attainment. The results show that, under the right incentive, users can achieve ZEH, reduce their electricity costs and have a minimal impact on the main grid.

Explore related subjects

Keep this discovery

BibTeXRIS

A. Daniel Carnerero, Taichi Tanaka, Mengmou Li, Takeshi Hatanaka, Yasuaki Wasa, Kenji Hirata, Yoshiaki Ushifusa, Takanori Ida. 2024-01-15. Net-Zero Energy House-oriented Linear Programming for the Sizing Problem of Photovoltaic Panels and Batteries. https://doi.org/10.1109/access.2024.3410369

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