Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1911.07599

Resilient Unit Commitment for Day-ahead Market Considering Probabilistic Impacts of Hurricanes

Tianyang Zhao·Huajun Zhang·Xiaochuan Liu·Shuhan Yao·Peng Wang
View original source ↗Read source document ↗Export metadata ↓

Abstract

In the face of extreme events, e.g., hurricanes, the transmission systems, especially the transmission lines, are affected across time and space. To mitigate these impacts on the day-ahead market from a probabilistic perspective, a resilient unit commitment (UC) problem is formulated as a two-stage robust optimization (RO) problem. In the first stage, the status, energy, and reserves of generators are pre-scheduled to minimize the operational cost, responding to the worst line failure scenario in the operating day. The failure, operation status, and repair of transmission lines are depicted by a novel robust uncertainty set with chance constraint considering the repair of failed lines. This chance constraint is reformulated to its deterministic equivalence. Using both load shedding and generation curtailment, a recourse problem is formulated in the second stage considering the time-varying transmission lines operation status. The formulated RO problem is solved using a column-and-constraint generation scheme. Simulations are conducted on IEEE-24 and two-area IEEE reliability test system-1996 under hurricanes and results verify the effectiveness of the proposed method on the conservation of uncertainty set, worst-case line failure scenario detection and repair preparedness.

Explore related subjects

math.OC

Keep this discovery

BibTeXRIS

Tianyang Zhao, Huajun Zhang, Xiaochuan Liu, Shuhan Yao, Peng Wang. 2019-11-18. Resilient Unit Commitment for Day-ahead Market Considering Probabilistic Impacts of Hurricanes. https://arxiv.org/abs/1911.07599

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

KEEP EXPLORING

Related papers

arXiv2026

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↗
arXiv2026

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↗
arXiv2026

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↗