Search NASA⌕ Search

SEARCH · Search NASA

Results for “Scheduler”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 217 records · Page 12
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Optimal scheduling for profit maximization of energy storage merchants considering market impact based on dynamic programming

This paper analyzes how electricity merchants' market impact affects merchants' profit. Energy storage has long been studied for its role in maximizing profit, and merchant decisions are assumed to have no impact on market prices. However, the trading decisions of large-scale energy storage merchants (e.g., pumped storage hydro) will affect the market prices. This paper employs dynamic programming theory to investigate merchants' optimal economic dispatch considering the market impact and physical characteristics of storage systems. Our findings show that the State-of-Charge (SOC) based analytical solution significantly facilitates energy storage merchants' decision-making. The SOC range is segmented into three regions by two optimal SOC reference points, which depend on the available energy in storage, given prices, and market impact. By comparing the current storage SOC with the reference points, the merchant can get the corresponding optimal actions. We analytically show that if the merchant neglects the market impact on the power market, she will exaggerate her expected profit when the price-taker and price-maker merchants have the same generating and pumping upper limits offered to Independent System Operators (ISOs). Furthermore, the profit-maximizing merchant must, therefore, assay to balance the trade-off correctly between the intensity of market impact and the dispatched power. Our findings are verified by numerical simulation, and results demonstrate the ramifications for electricity merchants in energy arbitrage decisions.

25 ENERGY STORAGE↗
DOE OSTI2025

A bilevel multistage stochastic self-scheduling model with indivisibilities for trading in the continuous intraday electricity market

In this paper, we study the profit maximization problem of a virtual power plant trading in the continuous intraday electricity market. Our virtual power plant model is compatible with renewable, and thermal assets, covering a range of virtual power plants currently participating in energy markets. We model the trading problem as a bilevel multistage stochastic program. The upper level of the problem accounts for the profit maximization of the virtual power plant with explicit modeling of the technical constraints of the operational status of the thermal power plant including minimum start-up and shut-down times, ramp-up and ramp-down rates, and minimum generation level. The upper level also decides which continuous and indivisible (fill-or-kill) orders are submitted to the market. The lower-level problem accounts for the clearing of the continuous intraday market, i.e., matching of buy and sell orders. Because of the presence of fill-or-kill orders, the lower-level problem is mixed-integer, which prevents its direct conversion to a single-level problem using duality. In order to solve this challenging problem, we develop a convex-hull extended formulation for the lower-level problem, apply duality theory to obtain a single-level stochastic equivalent formulation, and employ McCormick envelopes to turn the problem into a multistage stochastic mixed-integer linear problem, which we solve using the stochastic dual dynamic integer programming algorithm. We conduct numerical experiments and analyze the optimal trading behavior of a virtual power plant trading in an ideal continuous market without arbitrage.

Bilevel multistage stochastic programming problem↗
DOE OSTI2024

Co-optimization of nuclear reactor flexible power operation and maintenance scheduling

As flexible power operation of nuclear power plants becomes more attractive due to the reduction in fossil-fueled dispatchable generation on energy grids, finding optimal power production strategies that balance revenue generation with operational concerns becomes more complex. This article presents a general framework to aid operators in designing economically optimal long term dispatch strategies for nuclear power plants. The principal novelty is the linking of estimated system remaining useable life (RUL) to strategic operational decisions. It is shown that, depending on the relationship between the fixed costs from maintenance and the associated lost revenue from an outage, it can be economically optimal in the long term to delay a maintenance outage and not perform this alongside refueling. For a given relationship between power ramping and degradation, optimal strategies were found that discouraged load following in some situations while minimizing unnecessary maintenance. It is shown that heavy load following can cause maintenance and refueling outages to diverge due to their inverse relationships with respect to load following, potentially leading to a significant loss in capacity factor. As a result, this general framework can be applied to specific reactor dispatch allowing operators to adapt operational strategies as future grid conditions change.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2021

Post-extreme-event restoration using linear topological constraints and DER scheduling to enhance distribution system resilience

In this paper, a post-extreme-event restoration (PEER) algorithm is proposed to improve distribution system resilience. Linear topological constraints are proposed to ensure radial topology after N-k contingencies, possibly in multiple islands. The approach is made comprehensive by considering dispatchable distributed energy resources (DERs), non-dispatchable DERs, and demand responses, as well as on-load tap changers (OLTCs) and shunt capacitors. The goal is to minimize the accumulative expense caused by load reduction payment or penalty, as well as DER operation cost. As a result, the overall system will survive longer with higher resilience during an extreme event. To verify the effectiveness of the PEER algorithm, we proposed a resilience evaluation algorithm using Monte Carlo simulation (MCS) with reduced scenarios. This is based on a probabilistic model for generating random scenarios which consider the uncertainty of line faults and solar irradiance. Combined with the proposed PEER algorithm, this reduced-scenario MCS can evaluate the expected energy not served (EENS) which is an essential index for distribution system resilience. Case studies of the IEEE 33-bus and 123-bus test systems validate the proposed algorithm in reducing EENS.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Tri-level hybrid interval-stochastic optimal scheduling for flexible residential loads under GAN-assisted multiple uncertainties

Various building loads, such as heating, ventilation, and air conditioners (HVACs), electric water heaters (EWHs), and electric vehicles (EVs), can introduce opportunities for improving the flexibility of electricity consumption while satisfying the needs of building owners as well as benefiting the resilience of distribution system. To utilize such flexibility, a tri-level distribution market framework is established, including residential consumers, load aggregators (LAs), and the distribution system operator (DSO). In this work, the uncertainties from all three levels are considered. The random consumption behavior at the consumer level is modeled as a Gaussian noise that is also aggregated and transmitted to the LA level. The weather temperature in the LA level is forecasted as an interval, and the photovoltaic (PV) power in the market-clearing level is modeled by a set of power scenarios generated by Generative Adversarial Networks (GANs). Then, a hybrid interval-stochastic programming is proposed to transform the uncertain problems in the first two levels into deterministic ones. For real-time implementations, a rolling horizon optimization (RHO) scheme is employed to continuously optimize the power consumption based on the latest operating information. Finally, case studies on a modified IEEE 69-bus system validate the effectiveness of the proposed uncertainty modeling strategies and the RHO scheme.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2021

How Many Trip Requests Could We Support? An Activity-Travel Based Vehicle Scheduling Approach

In a world of ever-changing travel behavior and ever-increasing modal options, is vital to have integrated models that could capture the interactions between supply and demand layers of travel. Addressing this need, we propose three different versions of network representation and mathematical models for the activity-based vehicle routing problem to connect activity-travel graphs of passengers (demand layer) to spatio-temporal networks of vehicles (supply layer). Versions I and II are arc-based, while version III is path-based. In version I, we introduce the concept of activity-travel graphs for passengers. For vehicles, we construct space–time networks and add a new dimension, called “under-service state”, to track the execution status of trip requests at any location and time. In version II, we reduce the complexity of the network structure by eliminating the state dimension and some other modifications in the structure of the passengers’ and vehicles’ network. Although both versions can capture various behavioral constraints of the activity-based vehicle routing problem (e.g., mandatory and optimal activities, duration of activities, chain of activities, preferred starting and ending times of activities), due to the high level of complexity of the network structure, both versions can only solve small-sized problems. To tackle the computational complexity, we propose a path-based network representation in version III, and to make a balance between the disutility of passengers and vehicles, we present a tolled user equilibrium problem. Mathematical models are coded in C and GAMS and implemented on real-world Phoenix regional transportation network with more than 39 million trip requests, which demonstrate the effectiveness of the proposed solution for the original and restricted master problems.

33 ADVANCED PROPULSION SYSTEMS↗