SearcharxivSearch

arXiv · 2408.11269

Real-time Hosting Capacity Assessment for Electric Vehicles: A Sequential Forecast-then-Optimize Method

Abstract

Hosting capacity (HC) assessment for electric vehicles (EVs) is crucial for EV secure integration and reliable power system operation. Existing methods primarily focus on a long-term perspective (e.g., system planning), and consider the EV charging demands as scalar values, which introduces inaccuracies in real-time operations due to the inherently stochastic nature of EVs. In this regard, this paper proposes a real-time HC assessment method for EVs through a three-step process, involving real-time probabilistic forecasting, risk analysis and probabilistic optimization. Specifically, we conduct real-time probabilistic forecasting to capture the stochastic nature of EV charging demands across multiple charging stations by performing deterministic forecasting and fitting the distribution of forecasting errors. The deterministic forecasting is conducted using an adaptive spatio-temporal graph convolutional network (ASTGCN). ASTGCN leverages adaptive spatial feature extraction, attention-based temporal feature extraction, and second-order graph representation to improve the forecasting performance. Subsequently, based on the probabilistic forecasting of EV charging demands, we conduct real-time risk analysis and operational boundary identification by utilizing probabilistic power flow calculations to assess potential violations of secure operation constraints. Furthermore, we present the formulation of real-time HC of EVs considering expected satisfaction of stochastic EV charging demands, and propose an optimization model for real-time HC assessment of EVs. Numerical experiments on a real-world dataset demonstrate that the proposed ASTGCN model outperforms state-of-the-art forecasting models by achieving the lowest root mean square error of 0.0442, and the real-time HC is improved by 64% compared to long-term HC assessment.

Explore related subjects

Keep this discovery

BibTeXRIS

Yingrui Zhuang, Lin Cheng, Ning Qi, Xinyi Wang, Yue Chen. 2024-08-21. Real-time Hosting Capacity Assessment for Electric Vehicles: A Sequential Forecast-then-Optimize Method. https://doi.org/10.1016/j.apenergy.2024.125034

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