Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Program Optimization”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Optimal Renewable Resource Allocation and Load Scheduling of Resilient Communities

This paper presents a methodology for enhancing community resilience through optimal renewable resource allocation and load scheduling in order to minimize unserved load and thermal discomfort. The proposed control architecture distributes the computational effort and is easier to be scaled up than traditional centralized control. The decentralized control architecture consists of two layers: The community operator layer (COL) allocates the limited amount of renewable energy resource according to the power flexibility of each building. The building agent layer (BAL) addresses the optimal load scheduling problem for each building with the allowable load determined by the COL. Both layers are formulated as a model predictive control (MPC) based optimization. Simulation scenarios are designed to compare different combinations of building weighting methods and objective functions to provide guidance for real-world deployment by community and microgrid operators. The results indicate that the impact of power flexibility is more prominent than the weighting factor to the resource allocation process. Allocation based purely on occupancy status could lead to an increase of PV curtailment. Further, it is necessary for the building agent to have multi-objective optimization to minimize unserved load ratio and maximize comfort simultaneously.

model predictive control↗
DOE OSTI2020

Environmental and economic optima of solar home systems design: A combined LCA and LCC approach

Here, we compare the economic and environmental optimal design of Solar Home Systems (SHSs) and explore the role of economic incentives (such as tariffs and technology costs) in approximating the two optima. To achieve that, we present a methodology for the environmental and economic evaluation of grid-connected SHSs: user-scale electric systems involving a photovoltaic (PV) power system and a battery energy storage system. The proposed methodology is based on a mixed integer linear programming (MILP) optimization, life cycle assessment and life cycle costing. This methodological framework is applied to a case study involving a typical SHS installation in Italy. The results of the environmental optimal design brought to the evaluation of a 3.25 kW PV assisted by 8.66 kWh of nickel cobalt manganese batteries, whereas the costs of the SHS are minimized by a small PV system (less than 1 kW). Results underline that the environmental optimal configurations rely on battery technologies, which entails a significant cost compared to the grid connection. In contrast, the economic optimal design solutions is less impactful than the grid mix both from an environmental and economic points of view. Thanks to a reduction of batteries and PV costs, the environmental impact of the economic optimal design is expected to decrease in the future.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2014

Optimizing Data Locality for Fork/Join Programs Using Constrained Work Stealing

We present an approach to improving data locality across different phases of fork/join programs scheduled using work stealing. The approach consists of: (1) user-specified and automated approaches to constructing a steal tree, the schedule of steal operations and (2) constrained work stealing algorithms that constrain the actions of the scheduler to mirror a given steal tree. These are combined to construct work stealing schedules that maximize data locality across computation phases while ensuring load balance within each phase. These algorithms are also used to demonstrate dynamic coarsening, an optimization to improve spatial locality and sequential overheads by combining many finer-grained tasks into coarser tasks while ensuring sufficient concurrency for locality-optimized load balance. Implementation and evaluation in Cilk demonstrate performance improvements of up to 2.5x on 80 cores. We also demonstrate that dynamic coarsening can combine the performance benefits of coarse task specification with the adaptability of finer tasks.

cilk↗
DOE OSTI2018

Optimal distribution system restoration using PHEVs

Power outages cost billions of dollars every year and jeopardise the lives of hospital patients. Traditionally, power distribution system takes a long time to recover after a major blackout, due to its top-down operation strategy. New technologies in modern distribution systems bring opportunities and challenges to distribution system restoration. As fast response energy resources, plug-in hybrid electric vehicles (PHEVs) can accelerate the load pickup by compensating the imbalance between available generation and distribution system load. This study provides a bottom-up restoration strategy to use PHEVs for reliable load pickup and faster restoration process. The optimisation problem of finding load pickup sequence to maximise restored energy is formulated as a mixed integer linear programming (MILP) problem. Moreover, the coordination between transmission and distribution restoration is developed to efficiently restore the entire system back to normal operating conditions. Simulation results on one 100-feeder test system demonstrate the efficiency of MILP-based restoration strategy and the benefit from PHEVs to restore more energy in given restoration time. The proposed restoration strategy has great potential to facilitate system operators to achieve efficient system restoration plans. It also provides incentives to deploy a large amount of PHEVs to improve system resiliency.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2018

Bi-Level Dynamic Optimization with Feedback

This paper considers a bi-level real-time algorithmic framework for networked systems, consisting of several local controllers and a central controller. The central controller issues setpoints to the local controllers to optimize their operational objectives while satisfying system-wide constraints. In this context, the paper develops an online algorithm for tracking the optimal solution of the underlying dynamic optimization problem. The design of the algorithm is based on a projected-gradient method, suitably modified to accommodate appropriate measurements (i.e., feedback). Optimality claims are established in terms of the dynamic regret of the algorithm; the latter is a natural performance criterion in nonstationary environments associated with real-time control problems. Finally, the application of the algorithm to real-time control of power setpoints in an electrical grid is illustrated.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2016

Automated Dynamic Demand Response Implementation on a Micro-grid

In this paper, we describe a system for real-time automated Dynamic and Sustainable Demand Response with sparse data consumption prediction implemented on the University of Southern California campus microgrid. Supply side approaches to resolving energy supply-load imbalance do not work at high levels of renewable energy penetration. Dynamic Demand Response (D 2 R) is a widely used demand-side technique to dynamically adjust electricity consumption during peak load periods. Our D 2 R system consists of accurate machine learning based energy consumption forecasting models that work with sparse data coupled with fast and sustainable load curtailment optimization algorithms that provide the ability to dynamically adapt to changing supply-load imbalances in near real-time. Our Sustainable DR (SDR) algorithms attempt to distribute customer curtailment evenly across sub-intervals during a DR event and avoid expensive demand peaks during a few sub-intervals. It also ensures that each customer is penalized fairly in order to achieve the targeted curtailment. We develop near linear-time constant-factor approximation algorithms along with Polynomial Time Approximation Schemes (PTAS) for SDR curtailment that minimizes the curtailment error defined as the difference between the target and achieved curtailment values. Our SDR curtailment problem is formulated as an Integer Linear Program that optimally matches customers to curtailment strategies during a DR event while also explicitly accounting for customer strategy switching overhead as a constraint. We demonstrate the results of our D 2 R system using real data from experiments performed on the USC smartgrid and show that 1) our prediction algorithms can very accurately predict energy consumption even with noisy or missing data and 2) our curtailment algorithms deliver DR with extremely low curtailment errors in the 0.01-0.05 kWh range.

Kuppannagari, Sanmukh R.↗
DOE OSTI2019

Optimizing Fleet Operations in Automated Mobility Districts: Serving On-Demand Mobility with Automated Electric Shuttles

On-demand transportation services have seen a dramatic rise in the past decade, thanks to technology. Connected and automated vehicle (CAV) technology holds potential for a major transformation in the on-demand mobility services landscape.The timeline for fully automated vehicles (AVs) to reach the critical market share is still uncertain. In the short term, many cities in the United States and abroad are testing low-speed automated electric shuttles (AES) as a shared on-demand mobility service in geo-fenced regions. An automated mobility district (AMD) is a campus-sized implementation of connected/automated vehicle technology to realize the full benefits of a fully electric automated mobility service within a confined region or district. Building on this concept, an AMD toolkit is under development at the National Renewable Energy Laboratory (NREL) to inform a campus-or district-sized implementation in which automated electric shuttles (AES). This research extends the functionality of the AMD toolkit by developing a mathematical program to optimize the operations of an AES fleet in an on-demand service configuration.

25 ENERGY STORAGE↗
DOE OSTI2016

U.S. implementation of Q12{sup TM} zirconium alloy for improved stability of structural components

AREVA NP undertook the Q12{sup TM} research and development program to optimize the contribution to fuel assembly dimensional stability of structural components fabricated from ultra-low tin Zr-1Nb-Sn-Fe quaternary alloys. Because Q12{sup TM} is an evolutionary development of the current M5 alloy metallurgy, it benefits from the extensive industrial experience already gained with the latter. The Q12{sup TM} alloy is processed in the same way as M5, with slight increases in tin (Sn) and iron (Fe) contents. For structural components, these chemistry modifications provide higher irradiation creep strength and improved corrosion performance over Zircaloy-4. Fuel assemblies with quaternary alloy guide tubes are thus expected to increase robustness with respect to fuel assembly bow, improve growth characteristics, and maintain high burnup capability. The basic material properties have been determined through various in-core and out-of-core test programs. Components made from Q12{sup TM} have undergone irradiation in lead assemblies and in batch fuel for 13 Pressurized Water Reactor (PWR) units worldwide. Fuel with Q12{sup TM} guide tubes and grids has achieved a fuel assembly average burnup of 60 GWd/tU. Post irradiation examinations of these components have demonstrated that Q12{sup TM} performs in a stable, predictable manner. AREVA NP has submitted a topical report (TR) for Q12{sup TM} as a structural material to the United States Nuclear Regulatory Commission (US-NRC). This TR outlines the material behavior and performance of Q12{sup TM} for both guide tubes and grids. Once approved, implementation of Q12{sup TM} material throughout US PWR fuel designs will enhance dimensional stability of structural components. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗
DOE OSTI2022

Recent advances and challenges in optimization models for expansion planning of power systems and reliability optimization

Optimization models for expansion planning of power systems aim to determine capacities, investment timing, and location of power systems to satisfy the power demands while minimizing the total cost. The models have become complex in recent years to reflect both regulations on conventional energy sources and the increasing penetration of renewable energy sources (RES). This paper reviews the basic concepts and optimization models for expansion planning of power systems. We first explain the definition and features of generation expansion planning (GEP), transmission expansion planning (TEP), and generation and transmission expansion planning (GTEP). To address the computational challenges of large-scale expansion planning problems, we review several simplifications including temporal and spatial aggregation, and decomposition methods. This paper also addresses power system reliability defined as the probability of satisfying the load demand while withstanding failures of components. Finally, the goal of this paper is to provide a research overview, discuss trends in expansion planning of power systems, and suggest directions for future research.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Partner with a Third-Party Delivery Service or Not? A Prediction-and-Decision Tool for Restaurants Facing Takeout Demand Surges During a Pandemic

Amidst the COVID-19 pandemic, restaurants become more reliant on no-contact pick-up or delivery ways for serving customers. As a result, they need to make tactical planning decisions such as whether to partner with online platforms, to form their own delivery team, or both. In this paper, we develop an integrated prediction-decision model to analyze the profit of combining the two approaches and to decide the needed number of drivers under stochastic demand. We first use the susceptible-infected-recovered (SIR) model to forecast future infected cases in a given region and then construct an autoregressive-moving-average (ARMA) regression model to predict food-ordering demand. Using predicted demand samples, we formulate a stochastic integer program to optimize food delivery plans. We conduct numerical studies using COVID-19 data and food-ordering demand data collected from local restaurants in Nuevo Leon, Mexico, from April to October 2020, to show results for helping restaurants build contingency plans under rapid market changes. Our method can be used under unexpected demand surges, various infection/vaccination status, and demand patterns. Here, our results show that a restaurant can benefit from partnering with third-party delivery platforms when (i) the subscription fee is low, (ii) customers can flexibly decide whether to order from platforms or from restaurants directly, (iii) customers require more efficient delivery, (iv) average delivery distance is long, or (v) demand variance is high.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Grid Optimization Competition on Synthetic and Industrial Power Systems

This paper summarizes a grid optimization (GO) competition effort in the United States to find the best solution strategies for up to interconnect-scale power system networks with around 32,000 buses. The optimization problem is a mixedinteger, non-convex non-linear problem, (MINLP) and includes discrete variables such as unit commitment and line switching, control settings (transformer taps and phase shifters with impedance correction tables), and bus shunts. The case study includes six actual industry grids as well as 16 realistic synthetic grids created by three different dataset teams. The winners are selected and ranked based on scoring criteria, which consider the solution quality (such as objective functions) within time limits. Nine winner teams are selected from 26 competitor teams. The results achieved by different teams are described and the performance of different algorithms on synthetic grids and actual industry grids are compared and analyzed.

mixed-integer non-linear programming↗
DOE OSTI2026

Discrete versus continuous: Enhancing battery optimization in capacity expansion models

This study compares two battery modeling approaches for capacity expansion models: discrete-duration and continuous-duration formulations. In the discrete approach, battery duration is fixed, and power capacity is optimized. In the continuous approach, both power and energy capacities are decision variables, allowing storage duration to be optimized endogenously. Although both discrete-duration and continuous-duration battery formulations are used in long-term power system planning models, the literature has provided limited direct, systematic comparisons of their implications within a common modeling framework. To address this gap, this study implements both approaches in the Regional Energy Deployment System (ReEDS TM ) capacity expansion model using two resource adequacy methods, across a range of future system conditions, and with varying battery cost projections. Results show continuous-duration and high-resolution discrete approaches produce similar capacity expansion outcomes. The continuous formulation achieves faster runtimes compared to discrete-duration runs with many discrete-duration options. However, the discrete-duration approach allows users to choose to have limited fidelity for storage duration options, which in some cases can outperform the continuous formulation. The continuous formulation has the lowest overall system costs, indicating its ability to fine-tune storage duration to better meet specific system needs. This study's findings provide a side-by-side evaluation of discrete and continuous battery modeling approaches and offer guidance for improving the representation of real-world systems, flexibility, and computational efficiency for representing energy storage in long-term power system planning models.

25 ENERGY STORAGE↗
DOE OSTI2023

Covariant bit threads

We derive several new reformulations of the Hubeny-Rangamani-Takayanagi covariant holographic entanglement entropy formula. These include: (1) a minimax formula, which involves finding a maximal-area achronal surface on a timelike hypersurface homologous to D(A) (the boundary causal domain of the region A whose entropy we are calculating) and minimizing over the hypersurface; (2) a max V-flow formula, in which we maximize the flux through D(A) of a divergenceless bulk 1-form V subject to an upper bound on its norm that is non-local in time; and (3) a min U-flow formula, in which we minimize the flux over a bulk Cauchy slice of a divergenceless timelike 1-form U subject to a lower bound on its norm that is non-local in space. The two flow formulas define convex programs and are related to each other by Lagrange duality. For each program, the optimal configurations dynamically find the HRT surface and the entanglement wedges of A and its complement. The V-flow formula is the covariant version of the Freedman-Headrick bit thread reformulation of the Ryu-Takayanagi formula. We also introduce a measure-theoretic concept of a “thread distribution”, and explain how Riemannian flows, V-flows, and U-flows can be expressed in terms of thread distributions.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

A proximal trust-region method for nonsmooth optimization with inexact function and gradient evaluations

Many applications require minimizing the sum of smooth and nonsmooth functions. For example, basis pursuit denoising problems in data science require minimizing a measure of data misfit plus an $\ell^1$-regularizer. Similar problems arise in the optimal control of partial differential equations (PDEs) when sparsity of the control is desired. Here, we develop a novel trust-region method to minimize the sum of a smooth nonconvex function and a nonsmooth convex function. Our method is unique in that it permits and systematically controls the use of inexact objective function and derivative evaluations. When using a quadratic Taylor model for the trust-region subproblem, our algorithm is an inexact, matrix-free proximal Newton-type method that permits indefinite Hessians. We prove global convergence of our method in Hilbert space and demonstrate its efficacy on three examples from data science and PDE-constrained optimization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

The solubility and speciation of REE phosphate endmembers (CePO 4 and YPO 4 ) in Cl-rich aqueous fluids from 350 to 450 °C and implications for natural systems

The rare earth elements (REE) are important metals used increasingly in advanced technologies. Within the crust, the elements Ce and Y are commonly more abundant compared to other lanthanides and comprise important end-member constituents of REE-bearing minerals. Specifically, Ce is part of the light (L) REE which have larger ionic radii than the heavy (H) REE, which are grouped together with Y. These differences in ionic radius can lead to important physico-chemical trends within the lanthanide group. Despite a recent increase in experimental and thermodynamic data for the REE at high temperature and pressure, there is still a significant lack of these data at supercritical conditions. In this study we conducted batch-type experiments to measure the solubility of REE phosphates (CePO 4 and YPO 4 ) at varying starting pH (1.5–10), and salinity (0.01–1.4 mol/kg NaCl) at 350 and P sat , and from 400 to 450 °C at 700 bar. Results show that the solubility of Ce (33–0.14 ppb) is generally higher than Y (13–0.13 ppb) and that Ce complexes more strongly with both chloride and hydroxyl ligands compared to Y. The solubilities of both REE phosphates are highly pH-dependent and, to a lesser extent, depend on salinity at the studied conditions. The solubility data from this study were implemented into the GEMSFITS program to optimize the thermodynamic properties of Ce and Y hydroxyl and chloride species. The updated standard partial molal Gibbs energies of formation (Δ f G 0 T,P ) are used within the experimental temperature and pressure range to accurately predict the CePO 4 and YPO 4 solubility and Ce and Y speciation behavior. Based on the updated thermodynamic properties we also provide formation constants (log β n Cl,OH ) for Ce and Y hydroxyl and chloride species. Updated thermodynamic properties are applied to model REE-apatite dissolution and REE mobility based on the Pea Ridge iron oxide apatite deposit in Missouri, USA. The apatite dissolution model replicates natural observations including the replacement of monazite and xenotime after apatite and is an example of the utility of the new thermodynamic constants applied to supercritical crustal fluids. Furthermore, the findings of this study advance the predictive capabilities of geochemical models, our understanding of the behavior of individual REE, and permit modeling the overarching fractionation trends between LREE and HREE in supercritical crustal fluids.

58 GEOSCIENCES↗
DOE OSTI2021

Delivery drone route planning over a battery swapping network

Many enterprises invest on drone delivery research and development to drop off packages at consumers’ doorsteps in a matter of minutes. We study delivery drone route planning over a battery swapping network allowing farther reach by penetrating current battery capacity constraints. A mixed-integer nonlinear programming model is created to plan efficient drone routing over the swapping machines by minimizing the delivery lead time. We develop an exact solution method, evaluate its performance, and compare it with a straightforward nonlinear solver application. A case study highlights the applicability of the model. Data and source code to the solver are publicly shared.

drone battery swapping↗