SearcharxivSearch

arXiv subjects

Neng Fan

Publications and source records attributed to Neng Fan.

8 recordsLinked to original sources

DRL-Based Medium-Term Planning of Renewable-Integrated Self-Scheduling Cascaded Hydropower to Guide Wholesale Market Participation

For self-scheduling cascaded hydropower (S-CHP) facilities, medium-term planning is a critical step that coordinates water availability over the medium-term horizon, providing water usage guidance for their short-term operations in wholesale market participation. Typically, medium-term planning strategies (e.g., reservoir storage targets at the end of each short-term period) are determined by either optimization methods or rules of thumb. However, with the integration of variable renewable energy sources (VRESs), optimization-based methods suffer from deviations between the anticipated and actual reservoir storage, while rules of thumb could be financially conservative, thereby compromising short-term operating profitability in wholesale market participation. This paper presents a deep reinforcement learning (DRL)-based framework to derive medium-term planning policies for VRES-integrated S-CHPs (VS-CHPs), which can leverage contextual information underneath individual short-term periods and train planning policies by their induced short-term operating profits in wholesale market participation. The proposed DRL-based framework offers two practical merits. First, its planning strategies consider both seasonal requirements of reservoir storage and needs for short-term operating profits. Second, it adopts a multi-parametric programming-based strategy to accelerate the expensive training process associated with multi-step short-term operations. Finally, the DRL-based framework is evaluated on a real-world VS-CHP, demonstrating its advantages over current practice.

eess.SY

Chance-Constrained Set Multicover Problem

We consider a variant of the set covering problem with uncertain parameters, which we refer to as the chance-constrained set multicover problem (CC-SMCP). In this problem, we assume that there is uncertainty regarding whether a selected set can cover an item, and the objective is to determine a minimum-cost combination of sets that covers each item $i$ at least $k_i$ times with a prescribed probability. To tackle CC-SMCP, we employ techniques of enumerative combinatorics, discrete probability distributions, and combinatorial optimization to derive exact equivalent deterministic reformulations that feature a hierarchy of bounds, and develop the corresponding outer-approximation (OA) algorithm. Additionally, we consider reducing the number of chance constraints via vector dominance relations and reformulate two special cases of CC-SMCP using the ``log-transformation" method and binomial distribution properties. Theoretical results on sampling-based methods, i.e., the sample average approximation (SAA) method and the importance sampling (IS) method, are also studied to approximate the true optimal value of CC-SMCP under a finite discrete probability space. Our numerical experiments demonstrate the effectiveness of the proposed OA method, particularly in scenarios with sparse probability matrices, outperforming sampling-based approaches in most cases and validating the practical applicability of our solution approaches.

math.OC

A Carryover Storage Valuation Framework for Medium-Term Cascaded Hydropower Planning: A Portland General Electric System Study

Medium-term planning of cascaded hydropower (CHP) determines appropriate carryover storage levels in reservoirs to optimize the usage of available water resources. This optimization seeks to maximize the hydropower generated in the current period (i.e., immediate benefit) plus the potential hydropower generation in the future period (i.e., future value). Thus, in the medium-term CHP planning, properly quantifying the future value deposited in carryover storage is essential to achieve a balanced trade-off between immediate benefit and future value. To this end, this paper presents a framework to quantify the future value of carryover storage, which consists of three major steps: i) constructing a model to calculate the maximum possible hydropower generation that a given level of carryover storage can deliver in the future period; ii) extracting the implicit locational marginal water value (LMWV) of carryover storage for each reservoir by applying a partition-then-extract algorithm to the constructed model; and iii) developing a set of analytical rules based on the extracted LMWV to effectively calculate the future value. These rules can be seamlessly integrated into medium-term CHP planning models as tractable mixed-integer linear constraints to quantify the future value properly, and can be easily visualized to offer valuable insights for CHP operators. Finally, numerical results on a CHP system of Portland General Electric demonstrate the effectiveness of the presented framework in determining proper carryover storage values to facilitate medium-term CHP planning.

eess.SY

Integer Linear Programming Formulations for Double Roman Domination Problem

For a graph $G= (V,E)$, a double Roman dominating function (DRDF) is a function $f : V \to \{0,1,2,3\}$ having the property that if $f (v) = 0$, then vertex $v$ must have at least two neighbors assigned $2$ under $f$ or {at least} one neighbor $u$ with $f (u) = 3$, and if $f (v) = 1$, then vertex $v$ must have at least one neighbor $u$ with $f (u) \ge 2$. In this paper, we consider the double Roman domination problem, which is an optimization problem of finding the DRDF $f$ such that $\sum_{v\in V} f (v)$ is minimum. We propose {five integer linear programming (ILP) formulations and one mixed integer linear programming formulation with polynomial number of constraints for this problem. Some additional valid inequalities and bounds are also proposed for some of these formulations.} Further, we prove that {the first four models indeed solve the double Roman domination problem, and the last two models} are equivalent to the others regardless of the variable relaxation or usage of a smaller number of constraints and variables. Additionally, we use one ILP formulation to give an $H(2(\Delta+1))$-approximation algorithm. All proposed formulations and approximation algorithm are evaluated on randomly generated graphs to compare the performance.

math.CO

Contingency-Constrained Unit Commitment With Intervening Time for System Adjustments

The N-1-1 contingency criterion considers the con- secutive loss of two components in a power system, with intervening time for system adjustments. In this paper, we consider the problem of optimizing generation unit commitment (UC) while ensuring N-1-1 security. Due to the coupling of time periods associated with consecutive component losses, the resulting problem is a very large-scale mixed-integer linear optimization model. For efficient solution, we introduce a novel branch-and-cut algorithm using a temporally decomposed bilevel separation oracle. The model and algorithm are assessed using multiple IEEE test systems, and a comprehensive analysis is performed to compare system performances across different contingency criteria. Computational results demonstrate the value of considering intervening time for system adjustments in terms of total cost and system robustness.

math.OC

Contingency-Constrained Unit Commitment with Post-Contingency Corrective Recourse

We consider the problem of minimizing costs in the generation unit commitment problem, a cornerstone in electric power system operations, while enforcing an N-k-e reliability criterion. This reliability criterion is a generalization of the well-known $N$-$k$ criterion, and dictates that at least $(1-e_ j)$ fraction of the total system demand must be met following the failures of $k$ or fewer system components. We refer to this problem as the Contingency-Constrained Unit Commitment problem, or CCUC. We present a mixed-integer programming formulation of the CCUC that accounts for both transmission and generation element failures. We propose novel cutting plane algorithms that avoid the need to explicitly consider an exponential number of contingencies. Computational studies are performed on several IEEE test systems and a simplified model of the Western US interconnection network, which demonstrate the effectiveness of our proposed methods relative to current state-of-the-art.

math.OC

Contingency-Risk Informed Power System Design

We consider the problem of designing (or augmenting) an electric power system at a minimum cost such that it satisfies the N-k-e survivability criterion. This survivability criterion is a generalization of the well-known N-k criterion, and it requires that at least (1- e_j) fraction of the total demand to be met after failures of up to j components, for j=1,...,k. The network design problem adds another level of complexity to the notoriously hard contingency analysis problem, since the contingency analysis is only one of the requirements for the design optimization problem. We present a mixed-integer programming formulation of this problem that takes into account both transmission and generation expansion. We propose an algorithm that can avoid combinatorial explosion in the number of contingencies, by seeking vulnerabilities in intermediary solutions and constraining the design space accordingly. Our approach is built on our ability to identify such system vulnerabilities quickly. Our empirical studies on modified instances from the IEEE 30-bus and IEEE 57-bus systems show the effectiveness of our methods. We were able to solve the transmission and generation expansion problems for k=4 under 2 minutes, while other approaches failed to provide a solution at the end of 2 hours.

math.OC

N-k-e Survivable Power System Design

We consider the problem of designing (or augmenting) an electric power system such that it satisfies the N-k-e survivability criterion while minimizing total cost. The survivability criterion requires that at least (1-e) fraction of the total demand can still be met even if any k (or fewer) of the system components fail. We formulate this problem, taking into account both transmission and generation expansion planning, as a mixed-integer program. Two algorithms are designed and tested on modified instances from the IEEE-30-Bus and IEEE- 57-Bus systems.

math.OC