Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization algorithms”

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 1,009 records · Page 56

T3CO (Transportation Technology Total Cost of Ownership) Open Source [SWR-21-54]

T3CO (Transportation Technology Total Cost of Ownership), is open source software for modeling total cost of ownership for commercial vehicles with advanced powertrains. T3CO is a modeling framework for determining geospatially and temporally optimized total cost of ownership (TCO) for vehicle powertrain technologies. T3CO runs NREL's FASTSim™ software for a representative set of operating conditions to minimize TCO based on vehicle parameters that affect purchase and operating costs (e.g., fuel/electricity consumption, asset depreciation, opportunity costs associated with charging time) while simultaneously ensuring that firm performance constraints (e.g. zero-to-sixty time, gradeability) are satisfied. T3CO will enable the user to control which powertrain parameters are used in optimizing TCO, and these parameters will be modified by a multi-objective optimization (MOO) algorithm to identify a Pareto-optimal solution set. The optimization algorithm will be modular so that users can choose from many different MOO options or insert their own user-defined optimization tool. NREL T3CO Homepage: https://www.nrel.gov/transportation/t3co.html PyPI package: https://pypi.org/project/t3co/

Lustbader, Jason↗

Final Technical Report: Sparse Grid Scenario Generation and Interior Algorithms for Stochastic Optimization in a Parallel Computing Environment

The support from this grant resulted in seven published papers and a technical report. Two papers are published in SIAM J. on Optimization [87, 88]; two papers are published in IEEE Transactions on Power Systems [77, 78]; one paper is published in Smart Grid [79]; one paper is published in Computational Optimization and Applications [44] and one in INFORMS J. on Computing [67]). The works in [44, 67, 87, 88] were funded primarily by this DOE grant. The applied papers in [77, 78, 79] were also supported through a subcontract from the Argonne National Lab. We start by presenting our main research results on the scenario generation problem in Sections 1–2. We present our algorithmic results on interior point methods for convex optimization problems in Section 3. We describe a new ‘central’ cutting surface algorithm developed for solving large scale convex programming problems (as is the case with our proposed research) with semi-infinite number of constraints in Section 4. In Sections 5–6 we present our work on two application problems of interest to DOE.

97 MATHEMATICS AND COMPUTING↗

Complete Performance Comparison Between the Optimized Image Construction Algorithm (U-MBIR) and the Existing Reconstruction Algorithm for Detecting Defects and Damage in Concrete

Reinforced concrete (RC) is a composite material subjected to mechanical, thermal, and chemical loads throughout its service life. Because of these external stressors and the susceptibility of RC structural members to shrinkage and microcracking, the material degrades throughout its life cycle. This deterioration can lead to a decrease in member capacity and, ultimately, poses a threat to the structural integrity. Thus, it is crucial that the damage caused by aging and degradation be monitored and assessed at regular intervals throughout the material’s service life. Since coring of the material is typically not feasible for in-service structural systems, non-destructive evaluation (NDE) methodologies are used to assess remaining structural capacity. NDE methods enable surface and subsurface examination without damaging or degrading the medium. Moreover, RC is a critical component of nuclear power plants; thus, its safety and reliability must be thoroughly examined throughout the life cycle of the structural system. Ultrasonic measurements have been an industry standard for both surface and subsurface inspections. To this end, Oak Ridge National Laboratory (ORNL) has researched and developed advanced image reconstruction algorithms to capture internal damage. The results and discussion presented herein summarize the current state of the ultrasonic model–based iterative reconstruction (U-MBIR) algorithm developed at ORNL. More specifically, this report presents a comparison between reconstruction images produced via a widely employed ultrasonic NDE technique—the synthetic aperture focusing technique (SAFT)—and the ORNL-developed U-MBIR algorithm. These NDE methodologies are demonstrated using ultrasonic data collected from four concrete specimens. Overall, the U-MBIR algorithm eliminates artifacts and noise that are typically present within the SAFT reconstructions, and it shows defects and anomalies more clearly than the SAFT images. In conclusion, this algorithm is suitable for identifying concrete defects, although more improvements and optimization could be done to better define internal defects.

36 MATERIALS SCIENCE↗

Interlocked optimization and fast gradient algorithm for a seismic inverse problem

Highlights: {yields} A 2D extension of the 1D nonlinear inversion of well-seismic data is given. {yields} Appropriate regularization yields a well-determined large scale inverse problem. {yields} An interlocked optimization loop acts as an efficient preconditioner. {yields} The adjoint state method is used to compute the misfit function gradient. {yields} Domain decomposition method yields an efficient parallel implementation. - Abstract: We give a nonlinear inverse method for seismic data recorded in a well from sources at several offsets from the borehole in a 2D acoustic framework. Given the velocity field, approximate values of the impedance are recovered. This is a 2D extension of the 1D inversion of vertical seismic profiles . The inverse problem generates a large scale undetermined ill-conditioned problem. Appropriate regularization terms render the problem well-determined. An interlocked optimization algorithm yields an efficient preconditioning. A gradient algorithm based on the adjoint state method and domain decomposition gives a fast parallel numerical method. For a realistic test case, convergence is attained in an acceptable time with 128 processors.

97 MATHEMATICS AND COMPUTING↗

A Novel Noise-Aware Classical Optimizer for Variational Quantum Algorithms

A key component of variational quantum algorithms (VQAs) is the choice of classical optimizer employed to update the parameterization of an ansatz. It is well recognized that quantum algorithms will, for the foreseeable future, necessarily be run on noisy devices with limited fidelities. Thus, the evaluation of an objective function (e.g., the guiding function in the quantum approximate optimization algorithm (QAOA) or the expectation of the electronic Hamiltonian in variational quantum eigensolver (VQE)) required by a classical optimizer is subject not only to stochastic error from estimating an expected value but also to error resulting from intermittent hardware noise. Model-based derivative-free optimization methods have emerged as popular choices of a classical optimizer in the noisy VQA setting, based on empirical studies. However, these optimization methods were not explicitly designed with the consideration of noise. In this work we adapt recent developments from the “noise-aware numerical optimization” literature to these commonly used derivative-free model-based methods. We introduce the key defining characteristics of these novel noise-aware derivative-free model-based methods that separate them from standard model-based methods. In conclusion, we study an implementation of such noise-aware derivative-free model-based methods and compare its performance on demonstrative VQA simulations to classical solvers packaged in scikit-quant.

classical optimizers↗

A Hybrid Optimization and Deep Learning Algorithm for Cyber-Resilient DER Control

With the proliferation of distributed energy resources (DERs) in the distribution grid, it is a challenge to effectively control a large number of DERs resilient to the communication and security disruptions, as well as to provide the online grid services, such as voltage regulation and virtual power plant (VPP) dispatch. To this end, a hybrid feedback-based optimization algorithm along with deep learning forecasting technique is proposed to specifically address the cyber-related issues. The online decentralized feedback-based DER optimization control requires timely, accurate voltage measurement from the grid. However, in practice such information may not be received by the control center or even be corrupted. Therefore, the long short-term memory (LSTM) deep learning algorithm is employed to forecast delayed/missed/attacked messages with high accuracy. The IEEE 37-node feeder with high penetration of PV systems is used to validate the efficiency of the proposed hybrid algorithm. The results show that 1) the LSTM-forecasted lost voltage can effectively improve the performance of the DER control algorithm in the practical cyber-physical architecture; and 2) the LSTM forecasting strategy outperforms other strategies of using previous message and skipping dual parameter update.

cyber-resilient algorithm↗

Single-Axis Tracker Control Optimization Potential for the Contiguous United States

Conventional tracker control algorithms maximize collection of direct irradiance with no regard for collection of diffuse irradiance. Therefore, a tracker control algorithm that optimizes for maximal total irradiance, not just direct, might realize improved insolation collection. Using weather data gridded at 0.25° by 0.25° latitude/longitude spacing covering the contiguous United States, we evaluate the insolation gain of two alternative control algorithms optimized for improved total irradiance collection in monofacial arrays and present annual and monthly geographic heatmaps showing the gains across the contiguous United States. Certain locations show potential annual insolation gains approaching 1.0%, but most locations with recently-built tracker systems show annual gains between 0.1% and 0.4%. We also demonstrate a relationship between a climate's annualized diffuse insolation fraction and its potential tracker optimization insolation gain.

diffuse↗

Nonlinear dynamics optimization with particle swarm and genetic algorithms for SPEAR3 emittance upgrade

Nonlinear dynamics optimization is carried out for a low emittance upgrade lattice of SPEAR3 in order to improve its dynamic aperture and Touschek lifetime. Two multi-objective optimization algorithms, a genetic algorithm and a particle swarm algorithm, are used for this study. The performance of the two algorithms are compared. The result shows that the particle swarm algorithm converges significantly faster to similar or better solutions than the genetic algorithm and it does not require seeding of good solutions in the initial population. These advantages of the particle swarm algorithm may make it more suitable for many accelerator optimization applications.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Single-Axis Tracker Control Optimization Potential for the Contiguous United States: Preprint

Conventional tracker control algorithms maximize collection of direct irradiance with no regard for collection of diffuse irradiance. Therefore, a tracker control algorithm that optimizes for maximal total irradiance, not just direct, might realize improved insolation collection. Using weather data gridded at 0.25° by 0.25° latitude/longitude spacing covering the contiguous United States, we evaluate the insolation gain of two alternative control algorithms optimized for improved total irradiance collection in monofacial arrays and present annual and monthly geographic heatmaps showing the gains across the contiguous United States. Certain locations show potential annual insolation gains approaching 1.0%, but most locations with recently-built tracker systems show annual gains between 0.1% and 0.4%. We also demonstrate a relationship between a climate's annualized diffuse insolation fraction and its potential tracker optimization insolation gain.

diffuse↗

GRAVITATIONAL LENS MODELING WITH GENETIC ALGORITHMS AND PARTICLE SWARM OPTIMIZERS

Strong gravitational lensing of an extended object is described by a mapping from source to image coordinates that is nonlinear and cannot generally be inverted analytically. Determining the structure of the source intensity distribution also requires a description of the blurring effect due to a point-spread function. This initial study uses an iterative gravitational lens modeling scheme based on the semilinear method to determine the linear parameters (source intensity profile) of a strongly lensed system. Our 'matrix-free' approach avoids construction of the lens and blurring operators while retaining the least-squares formulation of the problem. The parameters of an analytical lens model are found through nonlinear optimization by an advanced genetic algorithm (GA) and particle swarm optimizer (PSO). These global optimization routines are designed to explore the parameter space thoroughly, mapping model degeneracies in detail. We develop a novel method that determines the L-curve for each solution automatically, which represents the trade-off between the image {chi}{sup 2} and regularization effects, and allows an estimate of the optimally regularized solution for each lens parameter set. In the final step of the optimization procedure, the lens model with the lowest {chi}{sup 2} is used while the global optimizer solves for the source intensity distribution directly. This allows us to accurately determine the number of degrees of freedom in the problem to facilitate comparison between lens models and enforce positivity on the source profile. In practice, we find that the GA conducts a more thorough search of the parameter space than the PSO.

79 ASTRONOMY AND ASTROPHYSICS↗

Optimization Model and Algorithm for Capacity Planning and Operation of Reliable and Carbon-neutral Power Systems with High Penetration of Renewable Generation

In this work, we propose a Generalized Disjunctive Programming (GDP) model that optimizes both long-term capacity planning (such as the number and size of dispatchable/renewable generators, batteries, and transmission lines) and hourly operation (such as on/off schedules of dispatchable generators, power output from each generator, and power flow) to maximize power system reliability while minimizing total cost and CO2 emissions.

Cho, Seolhee↗

Parallel Algorithms for Graph Optimization Using Tree Decompositions

Although many $\cal{NP}$-hard graph optimization problems can be solved in polynomial time on graphs of bounded tree-width, the adoption of these techniques into mainstream scientific computation has been limited due to the high memory requirements of the necessary dynamic programming tables and excessive runtimes of sequential implementations. This work addresses both challenges by proposing a set of new parallel algorithms for all steps of a tree decomposition-based approach to solve the maximum weighted independent set problem. A hybrid OpenMP/MPI implementation includes a highly scalable parallel dynamic programming algorithm leveraging the MADNESS task-based runtime, and computational results demonstrate scaling. This work enables a significant expansion of the scale of graphs on which exact solutions to maximum weighted independent set can be obtained, and forms a framework for solving additional graph optimization problems with similar techniques.

99 GENERAL AND MISCELLANEOUS↗

Collaborative Project: Building improved optimized parameter estimation algorithms to improve methane and nitrogen fluxes in a climate model

Soils in natural and managed ecosystems and wetlands are well known sources of methane, nitrous oxides, and reactive nitrogen gases, but the magnitudes of gas flux to the atmosphere are still poorly constrained. Thus, the reasons for the large increases in atmospheric concentrations of methane and nitrous oxide since the preindustrial time period are not well understood. The low atmospheric concentrations of methane and nitrous oxide, despite being more potent greenhouse gases than carbon dioxide, complicate empirical studies to provide explanations. In addition to climate concerns, the emissions of reactive nitrogen gases from soils are important to the changing nitrogen balance in the earth system, subject to human management, and may change substantially in the future. Thus improved modeling of the emission fluxes of these species from the land surface is important. Currently, there are emission modules for methane and some nitrogen species in the Community Earth System Model’s Community Land Model (CLM-ME/N); however, there are large uncertainties and problems in the simulations, resulting in coarse estimates. In this proposal, we seek to improve these emission modules by combining state-of-the-art process modules for emissions, available data, and new optimization methods. In earth science problems, we often have substantial data and knowledge of processes in disparate systems, and thus we need to combine data and a general process level understanding into a model for projections of future climate that are as accurate as possible. The best methodologies for optimization of parameters in earth system models are still being developed. In this proposal we will develop and apply surrogate algorithms that a) were especially developed for computationally expensive simulations like CLM-ME/N models; b) were (in the earlier surrogate optimization Stochastic RBF) demonstrated to perform very well on computationally expensive complex partial differential equations in earth science with limited numbers of simulations; and, c) will be (as part of the proposed research) significantly improved both by adding asynchronous parallelism, early truncation of unsuccessful simulations, and the improvement of both serial and parallel performance by the use of derivative and sensitivity information from global and local surrogate approximations S(x) . The algorithm development and testing will be focused on the CLM-ME/N model application, but the methods are general and are expected to also perform well on optimization for parameter estimation of other climate models and other classes of continuous multimodal optimization problems arising from complex simulation models. In addition, this proposal will compile available datasets of emissions of methane, nitrous oxides and reactive nitrogen species and develop protocols for site level comparisons with the CLM-ME/N. Once the model parameters are optimized against site level data, the model will be simulated at the global level and compared to atmospheric concentration measurements for the current climate, and future emissions will be estimated using climate change as simulated by the CESM. This proposal combines experts in earth system modeling, optimization, computer science, and process level understanding of soil gas emissions in an interdisciplinary team in order to improve the modeling of methane and nitrogen gas emissions. This proposal thus meets the requirements of the SciDAC RFP, by integrating state-of-the-art computer science and earth system to build an improved earth system model.

54 ENVIRONMENTAL SCIENCES↗

AlignOT: An Optimal Transport Based Algorithm for Fast 3D Alignment With Applications to Cryogenic Electron Microscopy Density Maps

Aligning electron density maps from Cryogenic electron microscopy (cryo-EM) is a first key step for studying multiple conformations of a biomolecule. As this step remains costly and challenging, with standard alignment tools being potentially stuck in local minima, we propose here a new procedure, called AlignOT, which relies on the use of computational optimal transport (OT) to align EM maps in 3D space. By embedding a fast estimation of OT maps within a stochastic gradient descent algorithm, our method searches for a rotation that minimizes the Wasserstein distance between two maps, represented as point clouds. Here, we quantify the impact of various parameters on the precision and accuracy of the alignment, and show that AlignOT can outperform the standard local alignment methods, with an increased range of rotation angles leading to proper alignment. We further benchmark AlignOT on various pairs of experimental maps, which account for different types of conformational heterogeneities and geometric properties. As our experiments show good performance, we anticipate that our method can be broadly applied to align 3D EM maps.

3D alignment↗

Binary particle swarm optimisation‐based optimal substation coverage algorithm for phasor measurement unit installations in practical systems

Phasor measurement units (PMUs) play an important role in the wide‐area monitoring and protection of modern power systems. Historically, their deployment was limited by the prohibitive cost of the device itself. Therefore, the objective of the conventional optimal PMU placement problem was to find minimum number of devices, which when carefully placed throughout the network, maximised observability subject to different constraints. Due to improvements in relay technology, digital relays can now serve as both relays and PMUs. Under such circumstances, the substation installations consume the largest portion of the deployment cost, and not the devices themselves. Thus, for minimising cost of synchrophasor deployment, number of substation installations must be minimised. This study uses binary particle swarm optimisation to minimise number of substations in which installations must be performed for making all voltage levels observable, while being subject to various practical constraints. Standard IEEE systems have been used to explain the technique. Finally, a large‐scale network of Dominion Virginia Power is used as the test bed for implementation.

Mishra, Chetan↗

Application of an Evolutionary Algorithm for Parameter Optimization in a Gully Erosion Model

Herein we demonstrate how to use model optimization to determine a set of best-fit parameters for a landform model simulating gully incision and headcut retreat. To achieve this result we employed the Covariance Matrix Adaptation Evolution Strategy (CMA-ES), an iterative process in which samples are created based on a distribution of parameter values that evolve over time to better fit an objective function. CMA-ES efficiently finds optimal parameters, even with high-dimensional objective functions that are non-convex, multimodal, and non-separable. We ran model instances in parallel on a high-performance cluster, and from hundreds of model runs we obtained the best parameter choices. This method is far superior to brute-force search algorithms, and has great potential for many applications in earth science modeling. We found that parameters representing boundary conditions tended to converge toward an optimal single value, whereas parameters controlling geomorphic processes are defined by a range of optimal values.

97 MATHEMATICS AND COMPUTING↗