Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 1,495 records · Page 83

A Multilevel Approach For SolvingLarge-Scale QUBO Problems With Noisy Hybrid Quantum Approximate Optimization

Quantum approximate optimization is one ofthe promising candidates for useful quantum computation,particularly in the context of finding approximate solutionsto Quadratic Unconstrained Binary Optimization (QUBO)problems. However, the existing quantum processing units(QPUs) are of relatively small size, and canonical mappingsof QUBO via the Ising model require one qubit per vari-able, rendering direct large-scale optimization infeasible.In classical optimization, a general strategy for addressingmany large-scale problems is via multilevel/multigrid meth-ods, where the large target problem is iteratively coarsenedand the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentallytest how existing QPUs perform when used as a sub-solverwithin such a multilevel strategy. To this aim, we com-bine and extend (via additional classical processing steps)the recently proposed Noise-Directed Adaptive Remapping(NDAR) and Quantum Relax&Round (QRR) algorithms.We first demonstrate the effectiveness of our heuristicextensions on Rigetti’s superconducting transmon deviceAnkaa-2. We find approximate solutions to10instances offully connected82-qubit Sherrington-Kirkpatrick graphswith random integer-valued coefficients obtaining normal-ized approximation ratios (ARs) in the range∼0.98−1.0,and the same class with real-valued coefficients (ARs∼0.94−1.0). Then, we implement the extended NDAR andQRR algorithms as subsolvers in the multilevel algorithmfor6large-scale graphs with at most∼27,000variables.In practice, the QPU (with classical post-processing steps)is used to find approximate solutions to dozens of at most82-qubit problems, which are iteratively used to constructthe global solution. We observe that quantum optimizationresults are competitive in terms of the quality of solutionswhen compared to classical heuristics used as subsolverswithin the multilevel approach.Reproducibility: source code and data are available at[TBA upon acceptance]

quantum computing↗

Piezoelectric impedance-based high-accuracy damage identification using sparsity conscious multi-objective optimization inverse analysis

Two elements are essential in structural health monitoring utilizing dynamic responses: response measurement with high-frequency contents, i.e., small characteristic wavelengths, that can adequately reflect damage features, and effective inverse identification analysis that is however oftentimes under-determined. The advancement of smart structure integration has led to active interrogation through frequency-sweeping piezoelectric impedance measurement at high frequency range. In this research we develop a multi-objective optimization formulation for the identification of damage location and severity utilizing piezoelectric impedance. While one optimization objective is to match the response measurement with finite element model prediction in the damage parametric space, the other is the number of locations of damage, i.e., the sparsity of damage index as the solution vector, since damage usually occurs within a small number of locations. This multi-objective formulation fits well the under-determined nature of damage identification, as it naturally provides multiple solutions as basis for further elucidation. The challenge remaining is how to find a small solution set that can include the actual damage scenario. Here we develop a novel inverse identification framework utilizing the intelligent swarm optimizer which possesses flexibility for enhancement. We first embed a sparsity enforcement process into the population generation of the optimizer, which yields a solution repository intrinsically possessing sparsity. We then apply reinforcement learning so the agents can adaptively opt for local strategies with the aim of enriching the searching patterns to diversify the solutions. Through the incorporation of a Q-table, searching toward more promising directions will be rewarded. Our case analyses employing experimental data indicate that this sparsity-conscious multi-objective particle swarm optimization technique can lead to a small solution set which generally encompasses the true damage scenario. This effectively solves the structural damage identification problem with piezoelectric impedance measurement.

Yang Zhang↗

Parameter Co-optimization for Hybrid Electric Vehicles Powertrain System Leveraging V2V/V2I Information

A parameter tuning based co-optimization scheme for the hybrid electric vehicles (HEV) powertrain system is designed to maximize the fuel efficiency. The optimization controlled input parameters are chosen based on sensitivity study of powertrain control parameters. The vehicle to vehicle (V2V) and vehicle to infrastructure information is another optimization input, to have the driving conditions taking in to considerations for maximizing fuel efficiency. The catalyst temperature is considered as an additional constraint as the speed to reach lightoff temperature should not decrease during optimized operation. Neural network is used to develop a simplified yet equivalent model for the optimization problem model. We have achieved an average of 9.22% fuel savings for a random driving cycle on a Toyota Prius test model.

Hong, Wanshi↗

Optimization of Workload Distribution of Data Centers Based on a Self-Learning In Situ Adaptive Tabulation Model

Data center cooling typically involves non-uniform airflow and temperature distributions, which are affected by the IT workload distribution. It is helpful to simulate the airflow and temperature to optimize the workload distribution. Traditional computational fluid dynamics (CFD) simulation is usually time-consuming while conventional reduced order models (ROMs), though computationally fast, may generate inaccurate results even after being fully trained. In Situ Adaptive Tabulation (ISAT), contracting to conventional ROM, can make prediction with error lower than a user-specified tolerance. To demonstrate using of ISAT for optimal workload distribution in data center, this paper presents a preliminary study of an ISAT-based genetic algorithm optimization platform. The ISAT is trained offline by using the results from CFD simulations using a hypothetical simple data center. The optimal workload distribution determined by the platform leads to approximately 6.8% of energy savings when compared to the benchmark with a uniform workload distribution. We note that the time cost for the entire optimization process, including the training of ISAT is about 4 hours, which is acceptable in the design phase.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Modeling and Optimization of Trip Level Energy Consumption and Charging Management for Connected Automated Electric Vehicles

This will be a presentation for a tutorial session in 2019 ITEC based on reviewing the publicly existing work in the literature. Trip aware energy consumption and charging management for electric vehicles is a key component to ensure sustainability of electrified transportation. The upcoming vehicle communication and autonomous driving technologies will provide opportunities to achieve more intelligent management strategies. This tutorial will introduce the state-to-art technologies that are being designed for optimizing the trip level energy cost and recharging operations of connected automated electric vehicles (CAEVs). The information needs, modeling, control and optimization techniques for optimal trip level energy management will be introduced. Opportunities and benefits from vehicle communication and automation will be discussed. In general, three main sub-topics will be presented in detail: first, advanced EV energy consumption modeling and prediction technologies; second, energy efficient driving technologies, e.g. eco-driving and eco-routing, etc.; third, optimally automatic charging decision making for CAEVs. Following these details, the research challenges, opportunities for co-optimization between the energy consumption and energy recharging of CAEVs will be illustrated in this tutorial.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Classical Optimizers for Noisy Intermediate-Scale Quantum Devices

We present a collection of optimizers tuned for usage on Noisy Inter-mediate-Scale Quantum (NISQ) devices. Optimizers have a range of applications in quantum computing, including the Variational Quantum Eigensolver (VQE) and Quantum Approximate Optimization (QAOA) algorithms. They have further uses in calibration, hyperparameter tuning, machine learning, etc. We employ the VQE algorithm as a case study. VQE is a hybrid algorithm, with a classical minimizer step driving the next evaluation on the quantum processor. While most results to date concentrated on tuning the quantum VQE circuit, our study indicates that in the presence of quantum noise the classical minimizer step is a weak link and a careful choice combined with tuning is required for correct results. We explore state-of-the-art gradient-free optimizers capable of handling noisy, black-box, cost functions and stress-test them using a quantum circuit simulation environment with noise injection capabilities on individual gates. Our results indicate that specifically tuned optimizers are crucial to obtaining valid science results on NISQ hardware, as well as projecting forward on fault tolerant circuits.

Lavrijsen, Wim↗

Development and Application of a Risk Analysis Toolkit for Plant Resources Optimization

This report summarizes the R&D activities of the Risk Informed Asset Management (RIAM) project during fiscal year 2020 (FY20). This project focuses on the development of methods designed to optimize plant operations (e.g., maintenance/replacement schedule, optimal maintenance posture) provided system/component health/cost data. This project development lives in cooperation with the Plant Health Management (PHM) project which focuses on the development of methods that integrate component health data and propagate such information at the system level to evaluate most relevant sources of risk. This year’s activities for the RIAM project focused on the continuation of schedule optimization algorithms developed in FY19. While in FY19 we focused on both deterministic and stochastic capital budgeting methods, in FY20 we moved forward by implementing two versions of schedule optimization methods. The first one reformulates the capital budgeting problem in a distributionally robust form which allows the user to rely on data directly rather than proposing a distribution from the data itself. The second version reformulates the capital budgeting explicitly using risk measures as variables to maximize/minimize. Lastly, we focused on the development of methods designed to identify the optimal maintenance posture based on the Pareto Frontier analysis. Rather than performing a tradeoff analysis (i.e., identify the absolute best posture), the Pareto Frontier analysis performs a trade space exploration approach (i.e., identify value and costs of several postures and have the analyst perform the task of imposing desired value and cost constraints). This is performed by identifying maintenance postures that maximize value (e.g., system availability) and minimize operational costs, i.e., the Pareto frontier in a value-cost trade space.

97 MATHEMATICS AND COMPUTING↗

Optimal Decision Making in High-Throughput Virtual Screening Pipelines

ABSTRACT Effective selection of the potential candidates that meet certain conditions in a tremendously large search space has been one of the major concerns in many real-world applications. In addition to the nearly infinitely large search space, rigorous evaluation of a sample based on the reliable experimental or computational platform is often prohibitively expensive, making the screening problem more challenging. In such a case, constructing a high-throughput screening (HTS) pipeline that pre-sifts the samples expected to be potential candidates through the efficient earlier stages, results in a significant amount of savings in resources. However, to the best of our knowledge, despite many successful applications, no one has studied optimal pipeline design or optimal pipeline operations. In this study, we propose two optimization frameworks, applying to most (if not all) screening campaigns involving experimental or/and computational evaluations, for optimally determining the screening thresholds of an HTS pipeline. We validate the proposed frameworks on both analytic and practical scenarios. In particular, we consider the optimal computational campaign for the long non-coding RNA (lncRNA) classification as a practical example. To accomplish this, we built the high-throughput virtual screening (HTVS) pipeline for classifying the lncRNA. The simulation results demonstrate that the proposed frameworks significantly reduce the effective selection cost per potential candidate and make the HTS pipelines less sensitive to their structural variations. In addition to the validation, we provide insights on constructing a better HTS pipeline based on the simulation results.

97 MATHEMATICS AND COMPUTING↗

THE DESIGN OF LAYER TIME OPTIMIZATION IN LARGE SCALE ADDITIVE MANUFACTURING WITH FIBER REINFORCED POLYMER COMPOSITES

In this study, we have developed a method to optimize a layer deposition time (a.k.a. layer time) for large-scale additive manufacturing (AM) via physics-based simulations. A long layer time leads to an over-cooled surface on which a new layer is deposited, and therefore, it may result in a weak bonding or debonding between layers, cracking, or warping. A short layer time leads to a high temperature of the structure due to insufficient cooling, and therefore, the structure may not be stiff enough and may collapse during manufacturing. Therefore, it is important to estimate the optimal layer time in additive manufacturing for a high-quality product. The temperature of a top layer right before deposition is recommended to be slightly higher than the glass temperature of the material. A temperature cooling was approximated to an exponential function of time, and the optimized layer time was obtained based on a target temperature while maintaining a minimal printing time. The material used is carbon fiber-reinforced polycarbonate (CF/PC), and the large-scale deposition system used is LSAM TM from Thermwood Corporation. Three different layer time cases were used for experiments, and a series of thermal images were obtained via an infra-red (IR) camera during the entire AM processes. AM process simulations were performed using a finite element method and the temperature profiles from the simulation were in good agreement with those from experiments. The layer time optimization was performed based on the temperature profiles from the simulations. A layer temperature with the optimal layer time was confirmed as the target temperature through simulation.

Jo, Eonyeon↗

Evaluation and Optimization of Well Completion Options for the Utah FORGE Site

Orientation and completion for well pairs that have been subjected to multi-zonal stimulation play a critical role in the long-term performance of an Enhanced Geothermal Reservoir. Enhanced geothermal systems often rely on preferential flow along fractures between well injection and production locations. Modeling this preferential flow using discrete fracture networks (DNF) relies on stochastic realizations of the DFN based on geological sampling. Here we present the development of a stochastic optimization methodology to determine well completion options in a discrete fracture network based on using parallel subset simulation. Stochastic optimization will provide insight into regions where placements of the injection and production wells are optimal. An example optimization of well-pair location optimization based on a deterministic-stochastic DFN model representing FORGE follows a discussion of the theory.

15 GEOTHERMAL ENERGY↗

Optimizing Rate of Penetration and Tripping Decision-Making using Real-Time Bit Wear Monitoring While Drilling Geothermal Wells

Understanding bit wear while drilling is critical to minimizing non-productive time (NPT) and optimizing rate of penetration (ROP). Lengthening drilling runs with damaged bits does not only lower the ROP, but also elevates the risk of inducing severe bit damage, which could potentially lead to time-consuming fishing operations. When drillers believe the bit has worn off substantially, the bit is tripped out to be replaced. On geothermal wells, tripping can take up to 20% of the overall well construction time, and this is generally acknowledged as an opportunity for improvement. Ideally, a bit run should be terminated before the bit is damaged beyond repair. At the same time, premature bit pulls are to be avoided as well. This study aims to leverage bit and tooth wear metrics that can be obtained in real time to characterize bit condition in order to optimize ROP and determine the optimal time to pull the bit. Two metrics were explored in this study: a bit wear metric that incorporated depth-of-cut, and a tooth wear metric developed by Bourgoyne & Young characterizing the state of bit teeth dull. Both metrics were computed using recorded data from 12¼ inches roller cone insert bit runs in five geothermal wells targeting a granodiorite formation in the western United States. Together with the actual dull grades, determined after the bits were pulled to surface, the metric trends were interpreted to characterize the downhole bit condition and identify the point at which the bit should have optimally been tripped out. The insights from studying the actual dull grades and how they relate to the two metrics were used to establish a reliable bit pull criterion. The bit wear metric trend correctly showed a noticeable departure from baseline for bits experiencing major dulling behavior. Additionally, the tooth wear model predicted the cutter dull within two dull grades for most runs, with better performance in predicting the inner teeth dull. Moreover, the combination of the bit wear and tooth wear metrics was effective in revealing the cause of the bit performance impairment. Proactive tracking of these two metrics in real-time can facilitate geothermal drilling ROP optimization and better-informed tripping decision-making, thereby avoiding wasted time and cost.

Ashari, Rahmat↗

Optimization of a Residential Air Source Heat Pump using Refrigerants with GWP <150 for Improved Performance and Reduced Emission

Using low-GWP refrigerants can reduce the Green House Gas (GHG) emission of heat pump systems. Heat exchangers and compressors are the key components and have a prominent impact on system performance, significant research is devoted to reducing the cost of the heat exchangers while achieving the same or better system performance with refrigerant charge reduction.To better understand the environmental impacts of optimized systems with low-GWP refrigerants, Life Cycle Climate Performance (LCCP) evaluation method was used to evaluate the direct and indirect emissions of the system over the course of its lifetime from manufacturing to disposal. The DOE/ORNL Heat Pump Design Model (HPDM) is used to evaluate the performance of heat pumps. Multi-objective optimizations using Particle Swarm Optimization (PSO) algorithm are performed on a 3-ton R410A residential air source heat pump on market. Seven R410A alternatives, i.e., R32, R454B, R454C, R455A, R457A, R1234yf and R1234ze(E) are investigated. The last five fluids have GWP lower than 150.As a result, 5.5%-12.8% seasonal energy efficiency ratio 2 (SEER2) improvement is achieved, and the optimized systems reduce life cycle CO2 emission by 8.5%-28.6% with GWP lower than 150 refrigerants. The optimal heat exchangers can fit into the original R410A fan-coil units; therefore, the proposed design method establishes a production and installation path to produce cost-effective low-GWP heat pumps easily accepted by end users.

Li, Zhenning↗

Personalized learning via task load optimization

A method for providing task load-optimized computer-generated training experiences to a user of a training system that includes: a display, a training simulator, a prediction program (ML1), and a training optimization program (ML2). In response to receiving a predicted optimal task load, ML2 provides a first training experience recommendation related to the training content and/or training conditions that, if utilized in providing a training experience to the user, is predicted to result in the predicted actual task load of the user equaling the predicted optimal task load. In response to receiving biometric information or performance metric information, ML1 determines the predicted actual task load. If the predicted actual task load does not match the predicted optimal task load, ML2 provides a second training experience recommendation and a second training experience is provided where at least one of the training content or the training conditions is changed.

Bertolli, Michael G.↗

Active Learning for Metamaterial Optimization on HPC and QC Integrated Systems

Active learning algorithms, integrating machine learning, quantum computing and optics simulation in an iterative loop, offer a promising approach to optimizing metamaterials. However, these algorithms can face difficulties in optimizing highly complex structures due to computational limitations. High-performance computing (HPC) and quantum computing (QC) integrated systems can address these issues by enabling parallel computing. In this study, we develop an active learning algorithm working on HPC-QC integrated systems. We evaluate the performance of optimization processes within active learning (i.e., training a machine learning model, problem-solving with quantum computing, and evaluating optical properties through wave-optics simulation) for highly complex metamaterial cases. Our results showcase that utilizing multiple cores on the integrated system can significantly reduce computational time, thereby enhancing the efficiency of optimization processes. Therefore, we expect that leveraging HPC-QC integrated systems helps effectively tackle large-scale optimization challenges in general.

Kim, Seongmin↗

Automating Sensor Characterization with Bayesian Optimization

The development of novel instrumentation requires an iterative cycle with three stages: design, prototyping, and testing. Recent advancements in simulation and nanofabrication techniques have significantly accelerated the design and prototyping phases. Nonetheless, detector characterization continues to be a major bottleneck in device development. During the testing phase, a significant time investment is required to characterize the device in different operating conditions and find optimal operating parameters. The total effort spent on characterization and parameter optimization can occupy a year or more of an expert's time. In this work, we present a novel technique for automated sensor calibration that aims to accelerate the testing stage of the development cycle. This technique leverages closed-loop Bayesian optimization (BO), using real-time measurements to guide parameter selection and identify optimal operating states. We demonstrate the method with a novel low-noise CCD, showing that the machine learning-driven tool can efficiently characterize and optimize operation of the sensor in a couple of days without supervision of a device expert.

Cuevas-Zepeda, Julian [Chicago U., KICP; Chicago U↗

ZEUS: An Efficient GPU Optimization Method Integrating PSO, BFGS, and Automatic Differentiation

We introduce a novel, efficient computational method, ZEUS, for numerical optimization, and provide an open-source implementation. It has four key ingredients: (1) particle swarm optimization (PSO), (2) the use of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method, (3) automatic differentiation (AD), and (4) GPUs. Our approach addresses the computational challenges inherent in high-dimensional, non-convex optimization problems. In the first phase of the algorithm, we get a potentially good set of starting points using PSO. Thereafter, we run BFGS independently in parallel from these starting points. BFGS is one of the best-performing algorithms for numerical optimization. However, it requires the gradient of the function being optimized. ZEUS integrates automatic differentiation into BFGS thus avoiding the need for the user to calculate derivatives explicitly. The use of GPUs allows ZEUS to speed up the calculations substantially. We carry out systematic studies to explore the trade-offs between the number of PSO iterations taken, starting points, and BFGS iteration depth. We show that a handful of iterations of PSO can improve global convergence when combined with BFGS. We also present performance studies using common test functions. The source code can be found at https://github.com/fnal-numerics/global-optimizer-gpu.

Soos, Dominik [Old Dominion U.]↗

Build optimization of fiber-reinforced additively manufactured components

Additive manufacturing (AM) is enabling the fabrication of artifacts with unprecedented geometric and material complexity. The focus of this paper is on the build the optimization of short fiber reinforced polymers (SFRP) AM components. Specifically, we consider optimization of the build direction, topology, and fiber orientation of SFRP components. All three factors have a significant impact on the functional performance of the printed part. While significant progress has been made on optimizing these independently, the objective of this paper is to consider all three factors simultaneously and explore their interdependency, within the context of thermal applications. Towards this end, the underlying design parameters are identified, appropriate sensitivity equations are derived, and a formal optimization problem is posed as an extension to the popular Solid Isotropic Material with Penalization (SIMP). Results from several numerical experiments are presented, highlighting the impact of build direction, topology, and fiber orientation on the performance of SFRP components.

42 ENGINEERING↗

An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs

We develop an adaptive, multivariate partitioning algorithm for solving nonconvex, Mixed-Integer Nonlinear Programs (MINLPs) with polynomial functions to global optimality. In particular, we present an iterative algorithm that exploits piecewise, convex relaxation approaches via disjunctive formulations to solve MINLPs that is different than conventional spatial branch-and-bound approaches. The algorithm partitions the domains of variables in an adaptive and non-uniform manner at every iteration to focus on productive areas of the search space. Furthermore, domain reduction techniques based on sequential, optimization-based bound-tightening and piecewise relaxation techniques, as a part of a presolve step, are integrated into the main algorithm. Finally, we demonstrate the effectiveness of the algorithm on well-known benchmark problems (including Pooling and Blending instances) from MINLPLib and compare our algorithm with state-of-the-art global optimization solvers. With our novel approach, we solve several large-scale instances, some of which are not solvable by state-of-the-art solvers. We also succeed in reducing the best known optimality gap for a hard, generalized pooling problem instance.

97 MATHEMATICS AND COMPUTING↗