Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimized”

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 955 records · Page 53
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Solid State Power Substation DC Node Optimization and Controller Hardware-In-The-Loop Demonstration

A solid state power substation (SSPS) node is a microgrid that integrates distributed energy resources and loads and injects/absorbs power to/from the SSPS distribution network. It is an essential building block of a futuristic distribution grid network. This paper presents the development and demonstration of optimization use cases of a SSPS DC node. By adopting multi-layer hierarchical control architecture and developing automatic device identification and dynamic optimization formulation algorithms, the SSPS DC node can perform plug-and-play resource integration and seamless transition of the optimized node operation under on and off grid condition without sophisticated algorithms, control mode changes, and user interactions. Four optimization use cases including economic dispatches with price signal changes, a sudden PV power drop, and a single directional meter and its associated costs with sending power back to the grid, and resiliency under a grid inverter trip condition were demonstrated through the real-time controller hardware-in-the-loop simulation.

Kim, Namwon↗
DOE OSTI2024

SNNVis: Visualizing Graph Embedding of Evolutionary Optimization for Spiking Neural Networks

While Spiking Neural Networks (SNNs) show a lot of promise, it is difficult to optimize them because applying traditional gradient-based optimization techniques is difficult. Even though evolutionary algorithms (EAs) have been shown to promise to optimize SNNs, understanding the relationship between evolving the characteristics of SNNs and their performance to improve the optimization algorithm is challenging because of the complex characteristics and huge population size. We propose visual analytics with novel graph embedding for evolutionary SNNs to address the challenges. While existing graph embedding techniques have limitations in preserving the specific features of the nodes and edges, our approach maintains them. Also, we develop visual analytics for understanding the relationship between the network performance and the features of nodes and edges and exploring and analyzing the evolving SNNs to build insights into improving the EA.

Chae, Junghoon [ORNL] (ORCID:0000000206016746)↗
DOE OSTI2026

LibraryX: A Framework for Cross-Library-Call Optimization

Scientific applications utilize performance libraries as a software engineering concept: these libraries encapsulate important and well-understood (mathematical) operations, allow for reuse, and are implemented and tuned by experts. Domain scientists then implement complex algorithms based on these domainspecific libraries. While individual library calls are optimized, larger performance gains across sequences of calls—sometimes spanning multiple libraries—are often unrealized, forcing a trade-off between performance and implementation complexity.To overcome this issue, we propose LibraryX, an approach and a system that allows for cross-library-call optimization even when library calls stem from multiple performance libraries. LibraryX annotates library calls with semantic information and optimizes entire directed acyclic graphs (DAGs) of calls dynamically using the SPIRAL code generation system. We demonstrate its effectiveness across a range of memory bound workloads, achieving significant speedups on Nvidia, AMD, and Intel accelerators compared to code using native libraries without cross-call optimization.

Rao, Sanil [Carnegie Mellon University,Department ↗
DOE OSTI2020

In-Depth Optimization with the OpenACC-to-FPGA Framework on an Arria 10 FPGA

The reconfigurable computing paradigm that uses field programmable gate arrays (FPGAs) has received renewed interest in the high-performance computing field due to FPGAs' unique combination of performance and energy efficiency. However, difficulties in programming and optimizing FPGAs have prevented them from being widely accepted as general-purpose computing devices. In accelerator-based heterogeneous computing, portability across diverse heterogeneous devices is also an important issue, but the unique architectural features in FPGAs make this difficult to achieve. To address these issues, a directive-based, high-level FPGA programming and optimization framework was previously developed. In this work, developed optimizations were combined holistically using the directive-based approach to show that each individual benchmark requires a unique set of optimizations to maximize performance. The relationships between FPGA resource usages and runtime performance were also explored.

Lambert, Jacob↗
DOE OSTI2020

Optimal Sizing of PV and Energy Storage in an Electric Vehicle Extreme Fast Charging Station

This paper proposes an optimization model for the optimal sizing of photovoltaic (PV) and energy storage in an electric vehicle extreme fast charging station considering the coordinated charging strategy of the electric vehicles. The proposed model minimizes the annualized cost of the extreme fast charging station, including investment and maintenance cost of PV and energy storage, cost of purchasing energy from utility and demand charge. The decision variables are capacity of invested PV and the power and energy ratings of invested energy storage. To further reduce the annualized cost of the extreme fast charging station, the charging strategy of electric vehicles are integrated into the optimization model and coordinated with the power output of PV and charging/discharging of energy storage. Results of numerical simulations indicate that investment of PV and energy storage could help reduce the annualized cost of the extreme fast charging station significantly. Meanwhile, the impacts of various parameters on the optimal solution are investigated by sensitivity analysis.

Liu, Guodong↗
DOE OSTI2022

Model-Based Framework to Optimize Charger Station Deployment for Battery Electric Vehicles

The development of battery electric vehicles (BEVs) is accelerating due to their environmental advantages over gasoline and diesel-powered vehicles, including a decrease in air pollution and an increase in energy efficiency. The deployment of charging infrastructure will need to increase to keep pace with demand, especially for large commercial vehicles for which few public chargers currently exist. In this paper, a new flexible framework is proposed for optimizing the placement of charging stations for BEVs, within which different physical models and optimization techniques may be used. Furthermore, a set of metrics is suggested to help enforce complex constraints and facilitate direct comparison between different optimization techniques. Unlike many existing charger placement techniques, the proposed method directly considers the historical driving patterns on a vehicle-by-vehicle basis, using transparent models to assess impacts of candidate charger placements, thus improving the explainability of the results. In the developed framework, modeled BEVs are first generated along the road network to mimic historical traffic data and are simulated traveling along a given route according to a simplified vehicle model. During the simulation, the charger placement problem is initially relaxed to allow vehicles to charge at any node along the road network, and vehicle states are tracked to assess areas of high charging demand. Charging stations are then placed based on the results of the relaxed simulation, and suggested placements are evaluated via road network simulation with fixed charger locations. This proposed framework is applied to a sample problem of placing charging stations along five major highway corridors for Class 8 over-the-road electric trucks. A novel mixed integer programming (MIP) formulation is proposed to optimize charger placements based upon the expected charging demand. Constraints were imposed on the final placement results to limit expected wait times at each station and ensure a minimum threshold of trucking routes are viable for BEVs. The results demonstrate the flexibility and potential effectiveness of the developed model-based framework for scalable charger station deployment.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
DOE OSTI2024

Paired Hydro-Battery Hybrid System Operations Using MIQP Based Multi-Objective Optimization

Hybridizing a hydropower plant with a battery energy storage system is often a very expensive decision. So to make the case for feasibility of hybridization the cost benefit analysis must be comprehensive. Most literature found on this subject only uses one out of many different available value streams to carry out a feasibility analysis. To that end, in this study we propose a multi-objective optimization formulation and a mixed-integer quadratic programming optimization engine that considers multiple different value streams and optimizes hydro-battery hybrid system paired operations to maximize revenue generated from energy arbitrage while simultaneously minimizing the total hydro turbine mileage thus reducing turbine starts and stops and improving turbines life all while following all environmental constraints and not violating any limitations either regulatory or preferential (i.e., to support recreational activities like white water rafting, etc.). In this study we also implemented the developed optimization methodology to a real-world case study of Bagnell dam hydropower facility (8 units totaling 240 MW rated power capacity) which is owned and operated by our industry partner Ameren Energy Inc. The case study outcomes shows that by hybridizing the Bagnell dam hydropower facility with a 60 MW x 2-hr battery energy storage system, the annual benefits can be increased over \$6 million while reducing the annual mileage averaged per turbine and number of start/stops by over 98\% and 85\% respectively.

Chalishazar, Vishvas H.↗
DOE OSTI2025

Economic Storage Size Optimization for Electric Vehicle Extreme-Fast Charging Stations

En-route charging infrastructure for electric vehicles is critical to support transportation needs. These charging stations are likely to have high loads and especially sharp peak loads given fast charging capabilities needed to meet transportation schedules. In order to reduce both strain on distribution grid infrastructure and charging station operational costs, many stations are likely to employ behind the meter storage. This paper demonstrates a behind the meter storage sizing optimization that employs an open-source agent-based vehicle behavior model (BEAM) to determine the best sizing across many scenarios. This optimization and analysis is novel in that it examines how storage size impacts not only charging station cost and peak load, but also vehicle queue times. The optimization is also applied across a wide analysis region with sufficient diversity and numbers to provide novel statistical analysis of optimal sizes.

Aka, Julius↗
DOE OSTI2020

Extending XACC for Quantum Optimal Control

Quantum computing vendors are beginning to open up application programming interfaces for direct pulse-level quantum control. With this, programmers can begin to describe quantum kernels of execution via sequences of arbitrary pulse shapes. This opens new avenues of research and development with regards to smart quantum compilation routines that enable direct translation of higher-level digital assembly representations to these native pulse instructions. In this work, we present an extension to the XACC system-level quantum-classical software framework that directly enables this compilation lowering phase via user-specified quantum optimal control techniques. This extension enables the translation of digital quantum circuit representations to equivalent pulse sequences that are optimal with respect to the backend system dynamics. Our work is modular and extensible, enabling third party optimal control techniques and strategies in both C++ and Python. We demonstrate this extension with familiar gradient-based methods like gradient ascent pulse engineering (GRAPE), gradient optimization of analytic controls (GOAT), and Krotov's method. Our work serves as a foundational component of future quantum-classical compiler designs that lower high-level programmatic representations to low-level machine instructions.

Nguyen, Thien↗
DOE OSTI2024

Benchmarking Optimizers for Qumode State Preparation with Variational Quantum Algorithms

Quantum state preparation involves preparing a target state from an initial system, a process integral to applications such as quantum machine learning and solving systems of linear equations. Recently, there has been a growing interest in qumodes due to advancements in the field and their potential applications. However there is a notable gap in the literature specifically addressing this area. This paper aims to bridge this gap by providing performance benchmarks of various optimizers used in state preparation with Variational Quantum Algorithms. We conducted extensive testing across multiple scenarios, including different target states, both ideal and sampling simulations, and varying numbers of basis gate layers. Our evaluations offer insights into the complexity of learning each type of target state and demonstrate that some optimizers perform better than others in this context. Notably, the Powell optimizer was found to be exceptionally robust against sampling errors, making it a preferred choice in scenarios prone to such inaccuracies. Additionally, the Simultaneous Perturbation Stochastic Approximation optimizer was distinguished for its efficiency and ability to handle increased parameter dimensionality effectively.

Kan, Shuwen [Fordham University]↗
DOE OSTI2025

Simulations of Quantum Approximate Optimization Algorithm on HPC-QC Integrated Systems

The Quantum Approximate Optimization Algorithm (QAOA) has emerged as a promising tool for accelerating optimization processes in the Noisy Intermediate-Scale Quantum (NISQ) era. Compared to classical methods, QAOA efficiently solves optimization problems, often formulated as Quadratic Unconstrained Binary Optimization (QUBO) problems. Classical quantum simulators are crucial for evaluating quantum algorithms due to limited quantum resources. However, QAOA's performance can vary with different simulation methods. This study analyzes QAOA's performance using various quantum simulators (e.g., density _matrix, statevector, and matrix_product_state) and demonstrates the benefits of HPC-QC integrated systems in solving QUBO problems on an active learning workflow. By simulating QAOA on dense, large-matrix QUBO problems, we evaluate accuracy and problem-solving time. We also assess QAOA's performance on local computers and HPC-QC inte-grated systems, using Oak Ridge Leadership Computing Facility (OLCF)'s Frontier supercomputer with local Qiskit Aer and remote IBM Quantum simulators.

Kim, Seongmin [ORNL] (ORCID:0000000159063004)↗
DOE OSTI2020

Optimization of an Interaction Region Quadrupole Magnet for a Future Electron-Ion Collider at JLab

The Jefferson Lab Electron Ion Collider (JLEIC) is a proposed new machine for nuclear physics research. It uses the existing CEBAF accelerator as a full energy injector to deliver 3 to 11 GeV electrons into a new electron collider ring. An all new ion accelerator and collider complex will deliver up to 200 GeV protons. The machine has luminosity goals of 10 34 cm -2 sec -1 . The whole detector region including forward detection covers about 80 meters of the JLEIC complex. The lattice file for the machine has changed to accommodate the higher energy; this change requires all the magnets in the interaction region to change. This paper will describe the requirements for both the ion and electron beam superconducting magnets around the interaction point. All the Final Focusing Quadrupole (FFQ) magnets now have preliminary designs. This paper will describe the optimization process for one of these FFQs. The optimization is performed using the optimization module of SIMULIA Opera FEA and compared with ROXIE. An analytical design tool has also been developed to estimate the peak field in the coils. The quadrupole has been optimized for peak field in the coils, and magnetic length.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2021

Optimal Power Flow in DC Networks with Robust Feasibility and Stability Guarantees

With high penetrations of renewable generation and variable loads, there is significant uncertainty associated with power flows in DC networks such that stability and operational constraint satisfaction are of concern. Most existing DC network optimal power flow (DN-OPF) formulations assume exact knowledge of loading conditions and do not provide stability guarantees. Here, in contrast, this paper studies a DN-OPF formulation which considers both stability and operational constraint satisfaction under uncertainty. The need to account for a range of uncertainty realizations in this paper's robust optimization formulation results in a challenging semi-infinite program (SIP). The proposed solution algorithm reformulates this SIP into a computationally tractable problem by constructing a tight convex inner approximation of the stability set using sufficient conditions for the existence of a feasible and stable power flow solution. Optimal generator set-points are obtained by optimizing over the proposed convex stability set. The validity and effectiveness of the propose algorithm is demonstrated through various DC networks adapted from IEEE test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

Accelerating Bilevel Optimization With Hierarchical Many-Threaded Parallel Differential Evolution

Bilevel optimization is encountered in many relevant real-world applications. The main feature of this type of problem is that an upper-level optimization problem is constrained by a nested lower-level optimization problem. Because of this nested structure, bilevel problems (BLPs) are usually computationally expensive to solve. Differential evolution (DE) has demonstrated promising results in solving BLPs of relatively small scales. As the problem scale increases, the decision space becomes intrinsically larger, requiring a growing number of function evaluations for the method to work properly. In this context, heavy parallelization and high-performance computing techniques are indispensable to enable the resolution of more complex and challenging optimization problems. Hence, we propose a hierarchical many-threaded parallel DE approach for BLPs, where both levels are parallelized. The computational experiments demonstrate that the parallel implementation achieved runtime speeds ranging from 44 to 2559 times faster than the sequential version on a well-known scalable SMD benchmark test problem when executed on an NVIDIA A100 GPU. The findings indicate that the algorithm’s convergence is strongly influenced by the number of both upper- and lower-level generations. Moreover, the success of experiments with large-scale problems is closely linked to the choice of small population sizes.

Dufek, Amanda S↗
DOE OSTI2026

Data-Driven Performance Optimization of Gamma Spectrometers With Many Channels

In gamma spectrometers with variable spectroscopic performance across many channels (e.g., many pixels or voxels), a tradeoff exists between including data from successively worse-performing readout channels and increasing efficiency. Brute-force calculation of the optimal set of included channels is exponentially infeasible as the number of channels grows, and approximate methods are required. In this work, we present a data-driven framework for attempting to find near-optimal sets of included detector channels. The framework leverages non-negative matrix factorization (NMF) to learn the behavior of gamma spectra across the detector and clusters similarly-performing detector channels together. Performance comparisons are then made between spectra with channel clusters removed, which is more feasible than brute force. The framework is general and can be applied to arbitrary, user-defined performance metrics depending on the application. We apply this framework to optimizing gamma spectra measured by H3D M400 CdZnTe (CZT) spectrometers, which exhibit variable performance across their crystal volumes. In particular, we show several examples optimizing various performance metrics for uranium and plutonium gamma spectra in non-destructive assay (NDA) for nuclear safeguards, and explore trends in performance versus parameters such as clustering algorithm type. We also compare the NMF + clustering pipeline to several non-machine-learning (ML) algorithms, including several greedy algorithms. Although, we find that the NMF + clustering pipeline tends to find the best-performing set of detector voxels, significantly improving over the unoptimized spectra, but that a greedy accumulation of spectra segmented by detector depth can, in some cases, give similar performance improvements in much less computation time.

Energy resolution↗
DOE OSTI2020

Multi-objective Optimization Paradigm for Toroidal Inductors with Spatially Tuned Permeability

Spatially tuning core permeability of an electromagnetic device enables superior performance. A permeability profile can be heuristically selected to improve the flux distribution in a device with a given geometry, but in order to fully leverage the capacity of spatial dependent permeability engineering, the geometry and the permeability should be optimized simultaneously. The work herein presented sets forth a multi-physics design optimization paradigm that includes the permeability profile tuning in the context of an inductor design. This approach enables the determination of Pareto optimal fronts consisting of a set of optimal solutions against competing objectives (e.g. mass and loss) under imposed constraints. To this end, analytical solutions of the heat transfer and electromagnetic formulations are derived for toroidal inductors. The software implemented in Matlab 2018b is available online as an attachment to this paper.

42 ENGINEERING↗
DOE OSTI2021

Convex Optimization of Integrated Power-Gas Energy Flow Model With Applications to Probabilistic Energy Flow

Energy flow calculation is a fundamental problem of the integrated power and gas system (IPGS) operation and planning. However, the nonlinear gas flow model introduces major challenges to the energy flow calculation. In this paper, we propose a tractably convex optimization model to solve the energy flow problem in IPGSs. It is demonstrated that the proposed optimization model has the same optimal solution as the original nonlinear steady energy flow model. Also, piecewise linearization is adopted to tightly linearize the nonlinear objective function of the model, which transforms the formulated convex optimization into a linear program one. Thus, the computation complexity of the proposed energy flow model is significantly reduced as compared with the existing methods. In addition, the proposed model can be extended to probabilistic energy flow estimation. Extensive case studies are conducted to validate the effectiveness of the proposed energy flow model using three IPGSs.

42 ENGINEERING↗
DOE OSTI2020

Distribution Feeder-Scale Fast Frequency Response via Optimal Coordination of Net-load Resources Part I: Solution Design

This work is the first of a two-part series that develops and experimentally demonstrates a first-of-its-kind hierarchical control solution for optimally dispatching thousands of deferrable loads and distributed energy resources (DERs) across a distribution feeder to provide fast frequency response (FFR) within 500 ms to the bulk power system. This approach rapidly coordinates resources online after a frequency event occurs, allowing fast-changing, behind-the-meter (BTM) resources to be incorporated and aggregate FFR power set points to be achieved more quickly and accurately than existing approaches. We also present a solution for determining the optimal amount of headroom to operate solar inverters with to minimize opportunity cost while ensuring the FFR response viability of a building with the inverter and deferrable loads. In Part I, we develop practical algorithms for fast, cost-based optimal dispatch at multiple aggregation scales (single building, multiple buildings, and full distribution feeder), establish their optimality, and demonstrate via simulation that they are faster than state-of-the-art, coordinated frequency response approaches. In Part II, the entire platform is implemented and experimentally verified using a unique power hardware-in-the-loop demonstration, including more than 100 powered loads and DERs connected to a real-world distribution network model and over 10,000 net-load resources dispatched.

24 POWER TRANSMISSION AND DISTRIBUTION↗