SEARCH · Search NASA

Results for “optimization algorithm”

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.

SourceResearch connectionFrom yearThrough year

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

At least 361 records · Page 20

All sources NASA NTRS DOE OSTI

DOE OSTI2012

Comparison of external beam treatment techniques for T1-2, N0, M0 glottic cancers

The purpose of this study was to compare 4 different external beam radiation therapy treatment techniques for the treatment of T1-2, N0, M0 glottic cancers: traditional lateral beams with wedges (3D), 5-field intensity-modulated radiation therapy (IMRT), volumetric modulated arc therapy (VMAT), and proton therapy. Treatment plans in each technique were created for 10 patients using consistent planning parameters. The photon treatment plans were optimized using Philips Pinnacle{sub 3} v.9 and the IMRT and VMAT plans used the Direct Machine Parameter Optimization algorithm. The proton treatment plans were optimized using Varian Eclipse Proton v.8.9. The prescription used for each plan was 63 Gy in 28 fractions. The contours for spinal cord, right carotid artery, left carotid artery, and normal tissue were created with respect to the patient's bony anatomy so that proper comparisons of doses could be made with respect to volume. An example of the different isodose distributions will be shown. The data collection for comparison purposes includes: clinical treatment volume coverage, dose to spinal cord, dose to carotid arteries, and dose to normal tissue. Data comparisons will be displayed graphically showing the maximum, mean, median, and ranges of doses.

61 RADIATION PROTECTION AND DOSIMETRY↗

DOE OSTI2012

Multi-core and many-core shared-memory parallel raycasting volume rendering optimization and tuning

Given the computing industry trend of increasing processing capacity by adding more cores to a chip, the focus of this work is tuning the performance of a staple visualization algorithm, raycasting volume rendering, for shared-memory parallelism on multi-core CPUs and many-core GPUs. Our approach is to vary tunable algorithmic settings, along with known algorithmic optimizations and two different memory layouts, and measure performance in terms of absolute runtime and L2 memory cache misses. Our results indicate there is a wide variation in runtime performance on all platforms, as much as 254% for the tunable parameters we test on multi-core CPUs and 265% on many-core GPUs, and the optimal configurations vary across platforms, often in a non-obvious way. For example, our results indicate the optimal configurations on the GPU occur at a crossover point between those that maintain good cache utilization and those that saturate computational throughput. This result is likely to be extremely difficult to predict with an empirical performance model for this particular algorithm because it has an unstructured memory access pattern that varies locally for individual rays and globally for the selected viewpoint. Our results also show that optimal parameters on modern architectures are markedly different from those in previous studies run on older architectures. In addition, given the dramatic performance variation across platforms for both optimal algorithm settings and performance results, there is a clear benefit for production visualization and analysis codes to adopt a strategy for performance optimization through auto-tuning. These benefits will likely become more pronounced in the future as the number of cores per chip and the cost of moving data through the memory hierarchy both increase.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2012

Multi-core and Many-core Shared-memory Parallel Raycasting Volume Rendering Optimization and Tuning

Given the computing industry trend of increasing processing capacity by adding more cores to a chip, the focus of this work is tuning the performance of a staple visualization algorithm, raycasting volume rendering, for shared-memory parallelism on multi-core CPUs and many-core GPUs. Our approach is to vary tunable algorithmic settings, along with known algorithmic optimizations and two different memory layouts, and measure performance in terms of absolute runtime and L2 memory cache misses. Our results indicate there is a wide variation in runtime performance on all platforms, as much as 254% for the tunable parameters we test on multi-core CPUs and 265% on many-core GPUs, and the optimal configurations vary across platforms, often in a non-obvious way. For example, our results indicate the optimal configurations on the GPU occur at a crossover point between those that maintain good cache utilization and those that saturate computational throughput. This result is likely to be extremely difficult to predict with an empirical performance model for this particular algorithm because it has an unstructured memory access pattern that varies locally for individual rays and globally for the selected viewpoint. Our results also show that optimal parameters on modern architectures are markedly different from those in previous studies run on older architectures. And, given the dramatic performance variation across platforms for both optimal algorithm settings and performance results, there is a clear benefit for production visualization and analysis codes to adopt a strategy for performance optimization through auto-tuning. These benefits will likely become more pronounced in the future as the number of cores per chip and the cost of moving data through the memory hierarchy both increase.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2013

Provably optimal parallel transport sweeps on regular grids

We have found provably optimal algorithms for full-domain discrete-ordinate transport sweeps on regular grids in 3D Cartesian geometry. We describe these algorithms and sketch a 'proof that they always execute the full eight-octant sweep in the minimum possible number of stages for a given P{sub x} x P{sub y} x P{sub z} partitioning. Computational results demonstrate that our optimal scheduling algorithms execute sweeps in the minimum possible stage count. Observed parallel efficiencies agree well with our performance model. An older version of our PDT transport code achieves almost 80% parallel efficiency on 131,072 cores, on a weak-scaling problem with only one energy group, 80 directions, and 4096 cells/core. A newer version is less efficient at present-we are still improving its implementation - but achieves almost 60% parallel efficiency on 393,216 cores. These results conclusively demonstrate that sweeps can perform with high efficiency on core counts approaching 10{sup 6}. (authors)

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Explainable Neural Architecture Search (XNAS)

Code for the paper Learning Interpretable Models Through Multi-Objective Neural Architecture Search by Zachariah Carmichael, Tim Moon, and Sam Ade Jacobs. Monumental advances in deep learning have led to unprecedented achievements across a multitude of domains. While the performance of deep neural networks is indubitable, the architectural design and interpretability of such models are nontrivial. Research has been introduced to automate the design of neural network architectures through neural architecture search (NAS). Recent progress has made these methods more pragmatic by exploiting distributed computation and novel optimization algorithms. However, there is little work in optimizing architectures for interpretability. To this end, we propose a multiobjective distributed NAS framework that optimizes for both task performance and introspection. We leverage the non-dominated sorting genetic algorithm (NSGA-II) and explainable AI (XAI) techniques to reward architectures that can be better comprehended by humans. The framework is evaluated on several image classification datasets. We demonstrate that jointly optimizing for introspection ability and task error leads to more disentangled architectures that perform within tolerable error.

Carmichael, ZachariahJ↗

DOE OSTI2023

Enhancing flexibility for climate change using seasonal energy storage (aquifer thermal energy storage) in distributed energy systems

Long-term energy storage is expected to play a vital role in the deep decarbonization of building energy sectors, while enhancing the flexibility of buildings to withstand future climate variations. However, it is challenging to design distributed multi-energy systems (DMES) while taking into account the uncertainties introduced by climate change, since stochastic optimization of such systems is difficult. The present study introduces a stochastic optimization model to address this bottleneck, taking into account DMES including aquifer thermal energy storage (ATES) as the long-term thermal storage. For the first time, a novel optimization algorithm links ATES with the DMES optimization model with the support of a simplified geotechnical model. Subsequently, a case study was conducted, focusing on a residential district in Chicago where the impact of future climate condition, energy demand, and solar and wind energy potentials were evaluated using Weather Research and Forecasting (WRF) data (up to 2080) and the EnergyPlus model. The study revealed that ATES is an attractive way to improve the renewable energy penetration level and minimize the dependence on fossil fuels with reasonable support from the grid to assist the fluctuations in both demand and generation. Furthermore, ATES notably reduces fuel consumption and dependence while greatly enhancing the flexibility of the energy system to withstand fluctuations in demand and renewable energy generation brought by future climate variations. These qualities will make ATES an important part of distributed energy systems, even though it is not currently the lowest cost alternative due to lack of technology maturity. Furthermore, the design platform introduced in the present study can be used to design DMES enhancing flexibility to accommodate future climate variations.

25 ENERGY STORAGE↗

DOE OSTI2011

Optimizing entangling quantum gates for physical systems

Optimal control theory is a versatile tool that presents a route to significantly improving figures of merit for quantum information tasks. We combine it here with the geometric theory for local equivalence classes of two-qubit operations to derive an optimization algorithm that determines the best entangling two-qubit gate for a given physical setting. We demonstrate the power of this approach for trapped polar molecules and neutral atoms.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2024

Feedback Optimization of Incentives for Distribution Grid Services

Energy prices and net power injection limitations regulate the operations in distribution grids and typically ensure that operational constraints are met. Nevertheless, unexpected or prolonged abnormal events could undermine the grid's functioning. During contingencies, customers could contribute effectively to sustaining the network by providing services. Herein this paper proposes an incentive mechanism that promotes users' active participation by essentially altering the energy pricing rule. The incentives are modeled via a linear function whose parameters can be computed by the system operator (SO) by solving an optimization problem. Feedback-based optimization algorithms are then proposed to seek optimal incentives by leveraging measurements from the grid, even in the case when the SO does not have a full grid and customer information. Numerical simulations on a standard testbed validate the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2014

WE-E-17A-07: Patient-Specific Mathematical Neuro-Oncology: Biologically-Informed Radiation Therapy and Imaging Physics

Purpose: To demonstrate a method of generating patient-specific, biologically-guided radiation therapy (RT) plans and to quantify and predict response to RT in glioblastoma. We investigate the biological correlates and imaging physics driving T2-MRI based response to radiation therapy using an MRI simulator. Methods: We have integrated a patient-specific biomathematical model of glioblastoma proliferation, invasion and radiotherapy with a multiobjective evolutionary algorithm for intensity-modulated RT optimization to construct individualized, biologically-guided plans. Patient-individualized simulations of the standard-of-care and optimized plans are compared in terms of several biological metrics quantified on MRI. An extension of the PI model is used to investigate the role of angiogenesis and its correlates in glioma response to therapy with the Proliferation-Invasion-Hypoxia- Necrosis-Angiogenesis model (PIHNA). The PIHNA model is used with a brain tissue phantom to predict tumor-induced vasogenic edema, tumor and tissue density that is used in a multi-compartmental MRI signal equation for generation of simulated T2- weighted MRIs. Results: Applying a novel metric of treatment response (Days Gained) to the patient-individualized simulation results predicted that the optimized RT plans would have a significant impact on delaying tumor progression, with Days Gained increases from 21% to 105%. For the T2- MRI simulations, initial validation tests compared average simulated T2 values for white matter, tumor, and peripheral edema to values cited in the literature. Simulated results closely match the characteristic T2 value for each tissue. Conclusion: Patient-individualized simulations using the combination of a biomathematical model with an optimization algorithm for RT generated biologically-guided doses that decreased normal tissue dose and increased therapeutic ratio with the potential to improve survival outcomes for treatment of glioblastoma. Simulated T2-MRI is shown to be consistent with known physics of MRI and can be used to further investigate biological drivers of imaging-based response to RT.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2018

PyBioNetFit

Systems biology models written in the BioNetGen language often contain parameters that must be fit based on experimental data. PyBioNetFit is a software tool designed to fit parameters of BioNetGen models. The user is expected to provide a BioNetGen model that contains unknown parameters, along with one or more text files containing experimental data. PyBioNetFit will perform a series of calls to the BioNetGen simulator using different parameter sets, to identify the parameter set that best fits the data. The parameter search is dictated by the user's choice of one of several metaheuristic optimization algorithms, including differential evolution, particle swarm optimization, scatter search, and simulated annealing. The software supports parallelized computing on multi-core computers and on computing clusters. We expect this software to be a useful tool for researchers designing BioNetGen models in collaboration with experimentalists.

Mitra, Eshan↗

DOE OSTI2022

Harmonized Automatic Relay Mitigation of Nefarious Intentional Events (HARMONIE) - Special Protection Scheme (SPS)

The harmonized automatic relay mitigation of nefarious intentional events (HARMONIE) special protection scheme (SPS) was developed to provide adaptive, cyber-physical response to unpredictable disturbances in the electric grid. The HARMONIE-SPS methodology includes a machine learning classification framework that analyzes real time cyber-physical data and determines if the system is in normal conditions, cyber disturbance, physical disturbance, or cyber-physical disturbance. This classification then informs response, if needed and/or suitable, and included cyber-physical corrective actions. Beyond standard power system mitigations, a few novel approaches were developed that included a consensus algorithm-based relay voting scheme, an automated power system triggering condition and corrective action pairing algorithm, and a cyber traffic routing optimization algorithm. Both the classification and response techniques were tested within a newly integrated emulation environment composed of a real-time digital simulator (RTDS) and SCEPTRE™. This report details the HARMONIE-SPS methodology, highlighting both the classification and response techniques, and the subsequent testing results from the emulation environment.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2022

Optimized Test Section for Helium Flow Loop Experiment

Phase 3 of this project uses the knowledge and techniques gained from Phase 1 and Phase 2. The first outcome of Phase 3 is a new test section which can be manufactured and tested in the Helium Flow Loop Experiment to verify the results of the optimization study. The second outcome of Phase 3 is analyzing the features of this design and determining its performance under simulated TBM conditions: heat flux, pressure, mass flow rate, one-sided and volumetric heating. This will be accomplished by first using the results from the Phase 1 analyses and then applying the optimization strategy from Phase This phase uses the STAR-CCM+ Design Manager tool to apply the optimization strategy to the Helium Flow Loop Experiment (HFLE). The optimization algorithm used by the Design Manager tool is Simultaneous Hybrid Exploration that is Robust, Progressive, and Adaptive (SHERPA search algorithm). In addition to demonstrating the optimization features, a simple parameter sweep is also included in this phase. This report details the applied single objective optimization.

42 ENGINEERING↗

DOE OSTI2026

Three-Dimensional Grid Visualization for Planning Activities: A Dubai Case Study

National Laboratory of the Rockies (NLR), in collaboration with the Dubai Electricity and Water Authority (DEWA) and Infra-X, has undertaken the Energy Visualization Analysis Project. The aim of this project is to enhance analytical and 3D visualization capabilities for distribution network planning and renewable energy integration. As modern grid continues to evolve with large-scale solar PV deployment and emerging distributed energy resources (DERs), the ability to effectively analyze, visualize, and communicate complex grid behaviors has become increasingly critical. The project focuses on developing empirical use cases based on real distribution feeder data and engineering workflows, ensuring the outcomes are directly aligned with operational environment. Through time-series power flow simulations and nodal hosting capacity analysis, the study quantifies the impacts of high PV penetration on voltage and thermal limits within representative 11 kV feeders. These analyses identify specific nodes and conditions where DER integration challenges arise. Furthermore, a Battery Energy Storage System (BESS) optimization algorithm was applied to determine the optimal size and placement of storage systems that can mitigate network constraints and enhance hosting capacity. The comparative results between base-case and BESS-augmented scenarios clearly demonstrate improvements in network stability and load management efficiency. In parallel, the NLR team developed an immersive 3D visualization framework, enabling interactive exploration of grid simulations using commodity head-mounted display (HMD) systems. This framework transforms conventional 2D simulation data into spatially intuitive visual environments - allowing engineers to analyze feeder conditions, PV hosting potential, and BESS effects in real time. This report represents the first foundational phase in establishing a visualization-driven analytical ecosystem. It provides a methodological foundation for data integration, visualization architecture, and simulation-based decision support, paving the way for large-scale adoption of immersive visualization across DEWA's Smart Grid Initiative, R&D activities, and future network resilience studies.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2010

Vehicle routing for the last mile of power system restoration

This paper studied a novel problem in power system restoration: the Power Restoration Vehicle Routing Problem (PRVRP). The goal of PRVRPs is to decide how coordinate repair crews effectively in order to recover from blackouts as fast as possible after a disaster has occurred. PRVRPs are complex problems that combine vehicle routing and power restoration scheduling problems. The paper proposed a multi-stage optimization algorithm based on the idea of constraint injection that meets the aggressive runtime constraints necessary for disaster recovery. The algorithms were validated on benchmarks produced by the Los Alamos National Laboratory, using the infrastructure of the United States. The disaster scenarios were generated by state-of-the-art hurricane simulation tools similar to those used by the National Hurricane Center. Experimental results show that the constraint-injection algorithms can reduce the blackouts by 50% or more over field practices. Moreover, the results show that the constraint-injection algorithm using large neighborhood search over a blackbox simulator provide competitive quality and scales better than using a MIP solver on the subproblems.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2023

Pseudospectral convex optimization for on-ramp merging control of connected vehicles

It can be a daunting task for human drivers to merge into highways because of the intricate vehicle negotiations and potential risk within limited time and space. Connected vehicle (CV) technologies could be a solution to this problem and offer many benefits to the road safety, traffic mobility, and energy efficiency. However, real-time optimal control of CVs is still an open challenge, due to the nonlinear vehicle dynamics, non-convex fuel consumption model, and highly dynamic uncertain inter-vehicle interactions. To tackle these issues, a novel real-time optimal control approach that balances the computational efficiency and solution optimality is proposed for the purpose of onboard application. To this end, the pseudospectral collocation method is integrated with a sequential convex programming approach to develop two new optimization algorithms, which are implemented within a model predictive control (MPC) framework to allow for real-time generation of optimal merging speed profiles. One algorithm leverages the line search technique to improve convergence, and the other benefits from the trust region method for better computational efficiency. The optimality and convergence process of both proposed algorithms are investigated by comparing their solutions with a popular non-linear solver. Furthermore, simulation results show that the proposed methods outperform the benchmark in terms of computational cost, fuel consumption, and traffic efficiency. In particular, the proposed fuel-economy merging rule can save 57.1% fuel consumption on average on four different traffic volumes. Meanwhile, the proposed optimal control algorithms can reduce 2.2% travel time on average comparing to the “first-in-first-out” merging rule.

33 ADVANCED PROPULSION SYSTEMS↗

DOE OSTI2023

Fast Bayesian optimization of Needle-in-a-Haystack problems using zooming memory-based initialization (ZoMBI)

Abstract Needle-in-a-Haystack problems exist across a wide range of applications including rare disease prediction, ecological resource management, fraud detection, and material property optimization. A Needle-in-a-Haystack problem arises when there is an extreme imbalance of optimum conditions relative to the size of the dataset. However, current state-of-the-art optimization algorithms are not designed with the capabilities to find solutions to these challenging multidimensional Needle-in-a-Haystack problems, resulting in slow convergence or pigeonholing into a local minimum. In this paper, we present a Zooming Memory-Based Initialization algorithm, entitled ZoMBI, that builds on conventional Bayesian optimization principles to quickly and efficiently optimize Needle-in-a-Haystack problems in both less time and fewer experiments. The ZoMBI algorithm demonstrates compute time speed-ups of 400× compared to traditional Bayesian optimization as well as efficiently discovering optima in under 100 experiments that are up to 3× more highly optimized than those discovered by similar methods.

36 MATERIALS SCIENCE↗

DOE OSTI2020

Drive-pressure optimization in ramp-wave compression experiments through differential evolution

Ramp-wave dynamic-compression experiments are used to examine quasi-isentropic loading paths in materials. The gradual and continuous increase in pressure created by ramp waves make these types of experiments ideal for studying nonequilibrium material behavior, such as solidification kinetics. In ramp-wave compression experiments, the input drive pressure to the experimental setup may be exerted through one of a number of different mechanisms (e.g., magnetic fields, gas-gun-driven impactors, or high-energy lasers) and is generally required for simulating such experiments. Yet, regardless of the specific mechanism, this drive pressure cannot be measured directly (measurements are generally taken at a location near the back of the experimental setup through a transparent window), leading to an inverse problem where one must determine the drive pressure at the front of the experimental setup (i.e., the input) that corresponds to the particle velocity (the output) measured near the back of the experimental setup. Furthermore, we solve this inverse problem using a heuristic optimization algorithm, known as differential evolution, coupled with a multiphysics, hydrodynamics code that simulates the compression of the experimental setup. By running many rounds of forward simulations of the experimental setup, our optimization process iteratively searches for a drive pressure that is optimized to closely reproduce the experimentally measured particle velocity near the back of the experimental setup. While our optimization methodology requires a significant number of hydrodynamics simulations to be conducted, many of these can be performed in parallel, which greatly reduces the time cost of our methodology. One novel aspect of our method for determining the drive pressure is that it does not require physical modeling of the drive mechanism and can thus be broadly applied to many types of ramp-compression experiments, regardless of the drive mechanism.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

DOE OSTI2023

Not so HOT Triangulations

Here, we propose primal–dual mesh optimization algorithms that overcome shortcomings of the standard algorithm while retaining some of its desirable features. “Hodge-Optimized Triangulations” defines the “HOT energy” as a bound on the discretization error of the diagonalized Delaunay Hodge star operator. HOT energy is a natural choice for an objective function, but unstable for both mathematical and algorithmic reasons: it has minima for collapsed edges, and its extrapolation to non-regular triangulations is inaccurate and has unbounded minima. We propose a different extrapolation with a stronger theoretical foundation, and avoid extrapolation by recalculating the objective just beyond the flip threshold. We propose new objectives, based on normalizations of the HOT energy, with barriers to edge collapses and other undesirable configurations. We propose mesh improvement algorithms coupling these. When HOT optimization nearly collapses an edge, we actually collapse the edge. Otherwise, we use the barrier objective to update positions and weights and remove vertices. By combining discrete connectivity changes with continuous optimization, we more fully explore the space of possible meshes and obtain higher quality solutions.

97 MATHEMATICS AND COMPUTING↗