An official website of the United States government
The current practice of discrete-time electricity pricing starts to fall short in providing an accurate economic signal reflecting the continuous-time variations of load and generation schedule in power systems. This paper introduces the fundamental mathematical theory of continuous-time marginal electricity pricing. We first formulate the continuous-time unit commitment (UC) problem as a constrained variational problem, and subsequently define the continuous-time economic dispatch (ED) problem where the binary commitment variables are fixed to their optimal values. We then prove that the continuous-time marginal electricity price equals to the Lagrange multiplier of the variational power balance constraint in the continuous-time ED problem. The proposed continuous-time marginal price is not only dependent to the incremental generation cost rate, but also to the incremental ramping cost rate of the units, thus embedding the ramping costs in calculation of the marginal electricity price. The numerical results demonstrate that the continuous-time marginal price manifests the behavior of the constantly varying load and generation schedule in power systems.
more »
« less
Generation Ramping Valuation in Day-Ahead Electricity Markets
In this paper, we first introduce a variational formulation of the Unit Commitment (UC) problem, in which generation and ramping trajectories of the generating units are continuous time signals and the generating units cost depends on the three signals: the binary commitment status of the units as well as their continuous-time generation and ramping trajectories. We assume such bids are piecewise strictly convex time-varying linear functions of these three variables. Based on this problem derive a tractable approximation by constraining the commitment trajectories to switch in a discrete and finite set of points and representing the trajectories in the function space of piece-wise polynomial functions within the intervals, whose discrete coefficients are then the UC problem decision variables. Our judicious choice of the signal space allows us to represent cost and constraints as linear functions of such coefficients, thus, our UC models preserves the MILP formulation of the UC problem. Numerical simulation over real load data from the California ISO demonstrate that the proposed UC model reduces the total dayahead and real-time operation cost, and the number of ramping scarcity events in the real-time operations.
more »
« less
- Award ID(s):
- 1549924
- PAR ID:
- 10019539
- Date Published:
- Journal Name:
- 2016 49th Hawaii International Conference on System Sciences (HICSS)
- Page Range / eLocation ID:
- 2335 to 2344
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
null (Ed.)Sub-hourly Unit Commitment (UC) problems have been suggested as a way to improve power system efficiency. Such problems, however, are much more difficult than hourly UC problems. This is not just because of the increased number of period to consider, but also because of much reduced unit ramping capabilities leading to more complicated convex hulls. As a result, state-of-the-art and practice methods such as branch-and-cut suffer from poor performance. In this paper, our recent Surrogate Absolute-Value Lagrangian Relaxation (SAVLR) method, which overcame major difficulties of standard Lagrangian Relaxation, is enhanced by synergistically incorporating the concept of Ordinal Optimization (OO). By using OO, solving subproblems becomes much faster. Testing of Midcontinent ISO (MISO)’s problem with 15 minutes as the time interval over 36 hours involving about 1,100 units and 15000 virtuals demonstrates that the new method obtains near-optimal solutions efficiently and significantly outperforms branch-and-cut.more » « less
-
Small integration time steps limit molecular dynamics (MD) simulations to millisecond time scales. Markov state models (MSMs) and equation-free approaches learn low-dimensional kinetic models from MD simulation data by performing configurational or dynamical coarse-graining of the state space. The learned kinetic models enable the efficient generation of dynamical trajectories over vastly longer time scales than are accessible by MD, but the discretization of configurational space and/or absence of a means to reconstruct molecular configurations precludes the generation of continuous all-atom molecular trajectories. We propose latent space simulators (LSS) to learn kinetic models for continuous all-atom simulation trajectories by training three deep learning networks to (i) learn the slow collective variables of the molecular system, (ii) propagate the system dynamics within this slow latent space, and (iii) generatively reconstruct molecular configurations. We demonstrate the approach in an application to Trp-cage miniprotein to produce novel ultra-long synthetic folding trajectories that accurately reproduce all-atom molecular structure, thermodynamics, and kinetics at six orders of magnitude lower cost than MD. The dramatically lower cost of trajectory generation enables greatly improved sampling and greatly reduced statistical uncertainties in estimated thermodynamic averages and kinetic rates.more » « less
-
Unit Commitment is usually formulated as a Mixed Binary Linear Programming (MBLP) problem. When considering a large number of units, state-of-the-art methods such as branch-and-cut may experience difficulties. To address this, an important but much overlooked direction is formulation transformation since if the problem constraints can be transformed to directly delineate the convex hull in the data pre-processing stage, then a solution can be obtained by using linear programming methods without combinatorial difficulties. In the literature, a few tightened formulations for single units with constant ramp rates were reported without presenting how they were derived. In this paper, a systematic approach is developed to tighten formulations in the data pre-processing stage. The idea is to derive vertices of the convex hull without binary requirements. From them, vertices of the original convex hull can be innovatively obtained. These vertices are converted to tightened constraints, which are then parameterized based on unit parameters for general use, tremendously reducing online computational requirements. By analyzing short-time horizons, e.g., two or three hours, tightened formulations for single units with constant and generation-dependent ramp rates are obtained, beyond what is in the literature. Results demonstrate computational efficiency and solution quality benefits of formulation tightening.more » « less
-
Spatial optimization problems (SOPs) are characterized by spatial relationships governing the decision variables, objectives, and/or constraint functions. In this article, we focus on a specific type of SOP called spatial partitioning, which is a combinatorial problem due to the presence of discrete spatial units. Exact optimization methods do not scale with the size of the problem, especially within practicable time limits. This motivated us to develop population-based metaheuristics for solving such SOPs. However, the search operators employed by these population-based methods are mostly designed for real-parameter continuous optimization problems. For adapting these methods to SOPs, we apply domain knowledge in designing spatially aware search operators for efficiently searching through the discrete search space while preserving the spatial constraints. To this end, we put forward a simple yet effective algorithm called s warm-based s p atial meme ti c al gorithm (SPATIAL) and test it on the school (re)districting problem. Detailed experimental investigations are performed on real-world datasets to evaluate the performance of SPATIAL. Besides, ablation studies are performed to understand the role of the individual components of SPATIAL. Additionally, we discuss how SPATIAL is helpful in the real-life planning process and its applicability to different scenarios and motivate future research directions.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.1109/HICSS.2016.292
