Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithmic 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,369 records · Page 76
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Developing a Drilling Optimization System for Improved Overall Rate of Penetration in Geothermal Wells

Geothermal energy is renewable, reliable and environmentally friendly source of energy. The major cost in the development of geothermal wells is the actual drilling of the wells. The main objective of this paper is to introduce a new real-time drilling optimization system designed for granite formation to reduce the overall drilling cost. In this study, a drilling optimization system is verified using drilling data from Utah-Forge well 58-32. The drilling optimization system used the Utah-Forge well 58-32 data to achieve real-time unconfined compressive strength (UCS). Based on the UCS value from the previous feet, the system simulates the ROP for the next drilling feet. The drilling optimization system utilizes the Differential Evolution Algorithm (DEA), which is a metaheuristic method to search the space of solution, to find the best operating parameters (i.e. WOB and RPM) for the next drilling foot. The optimization algorithm takes a maximum cutter temperature into account as a constraint and avoids the accelerated wear. The developed drilling optimization system improves ROP responses and reduces the drilling cost of geothermal wells. The simulated ROP results from the system show a good agreement with the ROP from Utah-Forge well 58-32 drilling data. The drilling time before and after optimization for both intervals were presented.

15 GEOTHERMAL ENERGY↗
DOE OSTI2017

Analytic Characterization of the Wake Behind In-Stream Hydrokinetic Turbines

Analytical algorithms developed and optimized for quantifying the wake behind in-stream hydrokinetic turbines are presented. These algorithms are based on wake expressions originally developed for wind turbines. Unlike previous related studies, the optimization of empirical coefficients contained in these algorithms is conducted using centerline velocity data from multiple published experimental studies of the wake velocities behind in-stream hydrokinetic turbine models or porous disks and not using computational fluid dynamics. Empirical coefficients are first individually optimized based on each set of experimental data, and then empirically based coefficient expressions are created using all of the data sets collectively, such that they are functions of ambient turbulence intensity. This expands the applicability of the created algorithms to cover the expected range of operating conditions for in-stream hydrokinetic turbines. Wind turbine wake model expressions are also modified to characterize the dependence of wake velocities on radial location from the centerline of in-stream hydrokinetic turbines. Thus, expressions with empirically optimized coefficients for calculating wake velocities behind in-stream hydrokinetic turbines are described in terms of both centerline and radial positions. Wake predictions made using the Larsen model for radial dependence are shown to diverge from experimental measurements near the wake radius defined by the Jensen model, suggesting that this is a good indication of the cutoff point beyond which numerical estimations no longer apply. Results suggest that using a combined Larsen/Ainslie approach or combined Jensen/Ainslie approach for characterizing wake have similar mean errors to using only a Larsen approach.

16 TIDAL AND WAVE POWER↗
DOE OSTI2014

SU-E-T-21: A Novel Sampling Algorithm to Reduce Intensity-Modulated Radiation Therapy (IMRT) Optimization Time

Purpose: The IMRT optimization problem requires substantial computer time to find optimal dose distributions because of the large number of variables and constraints. Voxel sampling reduces the number of constraints and accelerates the optimization process, but usually deteriorates the quality of the dose distributions to the organs. We propose a novel sampling algorithm that accelerates the IMRT optimization process without significantly deteriorating the quality of the dose distribution. Methods: We included all boundary voxels, as well as a sampled fraction of interior voxels of organs in the optimization. We selected a fraction of interior voxels using a clustering algorithm, that creates clusters of voxels that have similar influence matrix signatures. A few voxels are selected from each cluster based on the pre-set sampling rate. Results: We ran sampling and no-sampling IMRT plans for de-identified head and neck treatment plans. Testing with the different sampling rates, we found that including 10% of inner voxels produced the good dose distributions. For this optimal sampling rate, the algorithm accelerated IMRT optimization by a factor of 2–3 times with a negligible loss of accuracy that was, on average, 0.3% for common dosimetric planning criteria. Conclusion: We demonstrated that a sampling could be developed that reduces optimization time by more than a factor of 2, without significantly degrading the dose quality.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2017

Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

We present two efficient iterative algorithms for solving the linear response eigen- value problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into a product eigenvalue problem that is self-adjoint with respect to a K-inner product. This product eigenvalue problem can be solved efficiently by a modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-inner product. The solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. However, the other component of the eigenvector can be easily recovered in a postprocessing procedure. Therefore, the algorithms we present here are more efficient than existing algorithms that try to approximate both components of the eigenvectors simultaneously. The efficiency of the new algorithms is demonstrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Optimizing Discharge Capacity of Li-O 2 Batteries by Design of Air-Electrode Porous Structure: Multifidelity Modeling and Optimization

We develop a new mathematical framework to study the optimal design of air electrode microstructures for lithium-oxygen (Li-O2) batteries. It can eectively reduce the number of expensive experiments for testing dierent air-electrodes, thereby minimizing the cost in the design of Li-O2 batteries. The design parameters to characterize an air-electrode microstructure include the porosity, surface-to-volume ratio, and parameters associated with the pore-size distribution. A surrogate model (also known as response surface) for discharge capacity is rst constructed as a function of these design parameters. The surrogate model is accurate and easy to evaluate such that an optimization can be performed based on it. In particular, a Gaussian process regression method, co-kriging, is employed due to its accuracy and eciency in predicting high-dimensional responses from a combination of multidelity data. Specically, a small amount of data from high-delity simulations are combined with a large number of data obtained from computationally ecient low-delity simulations. The high-delity simulation is based on a multiscale modeling approach that couples the microscale (pore-scale) and macroscale (device-scale) models. Whereas, the low-delity simulation is based on an empirical macroscale model. The constructed response surface provides quantitative understanding and prediction about how air electrode microstructures aect the discharge performance of Li-O2 batteries. The succeeding sensitivity analysis via Sobol indices and optimization via genetic algorithm ultimately oer a reliable guidance on the optimal design of air electrode microstructures. The proposed mathematical framework can be generalized to investigate other new energy storage techniques and materials.

25 ENERGY STORAGE↗
DOE OSTI2026

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.]↗
DOE OSTI2016

A multi-objective optimization approach to optimal sensor location problem in $\mathrm{IGCC}$ power plants

Integrated Gasification Combined Cycle (IGCC) power plants provide a cleaner and more efficient way to obtain energy from coal. In order to operate an IGCC power plant in a safe and stable manner, several input and output process parameters need to be monitored. However, due to economic and operational constraints, it is infeasible to place sensors at every input and output process parameter location. Hence, it becomes important to select the most effective sensor locations which lead to maximum information gain about the plant conditions. Practical issues present in an IGCC power plant, such as harsh physical conditions and variability in process parameters, make the optimal sensor location problem an especially complicated one. Further, sensors can have multiple objectives and they can produce uncertainties due to measurement errors. Here this work considers hybrid hardware and virtual sensing for advanced power systems with multiple objectives. In order to solve this real world large scale problem, we use a novel algorithm called Better Optimization of Nonlinear Uncertain Systems (BONUS). BONUS works in probability distribution space and avoids sampling for each optimization and derivative calculations iterations. A new algorithm for multi-objective optimization is also developed specifically for problem. The result of this nonlinear stochastic multi-objective problem is the non-dominated, or Pareto set, which provides trade-offs between various objectives like observability, cost, and thermal efficiency. This is the first attempt at solving the problem of optimal sensor deployment in advanced power plants, with consideration of hybrid hardware and virtual sensing and incorporation of uncertainty with multiple objectives.

01 COAL, LIGNITE, AND PEAT↗
DOE OSTI2022

A combined experimental and numerical approach that eliminates the non-uniqueness associated with the Johnson-Cook parameters obtained using inverse methods

Abstract Johnson-Cook constitutive model is a commonly used material model for machining simulations. The model includes five parameters that capture the initial yield stress, strain-hardening, strain-rate hardening, and thermal softening behavior of the material. These parameters are difficult to determine using experiments since the conditions observed during machining (such as high strain-rates of the order of $$10^5$$ 10 5 /sec - $$10^6$$ 10 6 /sec) are challenging to recreate in the laboratory. To address this problem, several researchers have recently proposed inverse approaches where a combination of experiments and analytical models are used to predict the Johnson-Cook parameters. The errors between the measured cutting forces, chip thicknesses and temperatures and those predicted by analytical models are minimized and the parameters are determined. In this work, it is shown that only two of the five Johnson-Cook parameters can be determined uniquely using inverse approaches. Two different algorithms, namely, Adaptive Memory Programming for Global Optimization (AMPGO) and Particle Swarm Optimization (PSO), are used for this purpose. The extended Oxley’s model is used as the analytical tool for optimization. For determining a parameter’s value, a large range for each parameter is provided as an input to the algorithms. The algorithms converge to several different sets of values for the five Johnson-Cook parameters when all the five parameters are considered as unknown in the optimization algorithm. All of these sets, however, yield the same chip shape and cutting forces in FEM simulations. Further analyses show that only the strain-rate and thermal softening parameters can be determined uniquely and the three parameters present in the strain-hardening term of the Johnson-Cook model cannot be determined uniquely using the inverse method. A combined experimental and numerical approach is proposed to eliminate this determine all parameters uniquely.

42 ENGINEERING↗
DOE OSTI2020

Model-Free Primal-Dual Methods for Network Optimization with Application to Real-Time Optimal Power Flow

This paper examines the problem of real-time optimization of networked systems and develops online algorithms that steer the system towards the optimal trajectory without explicit knowledge of the system model. The problem is modeled as a dynamic optimization problem with time-varying performance objectives and engineering constraints. The design of the algorithms leverages the online zero-order primal-dual projected-gradient method. In particular, the primal step that involves the gradient of the objective function (and hence requires a networked systems model) is replaced by its zero-order approximation with two function evaluations using a deterministic perturbation signal. The evaluations are performed using the measurements of the system output, hence giving rise to a feedback interconnection, with the optimization algorithm serving as a feedback controller. The paper provides some insights on the stability and tracking properties of this interconnection. Finally, the paper applies this methodology to a real-time optimal power flow problem in power systems, and shows its efficacy on the IEEE 37-node distribution test feeder for reference power tracking and voltage regulation.

61 RADIATION PROTECTION AND DOSIMETRY↗
DOE OSTI2016

Model-based optimal design of active cool thermal energy storage for maximal life-cycle cost saving from demand management in commercial buildings

This article provides a method in comprehensive evaluation of cost-saving potential of active cool thermal energy storage (CTES) integrated with HVAC system for demand management in non-residential building. The active storage is beneficial by shifting peak demand for peak load management (PLM) as well as providing longer duration and larger capacity of demand response (DR). In this research, a model-based optimal design method using genetic algorithm is developed to optimize the capacity of active CTES aiming for maximizing the life-cycle cost saving concerning capital cost associated with storage capacity as well as incentives from both fast DR and PLM. In the method, the active CTES operates under a fast DR control strategy during DR events while under the storage-priority operation mode to shift peak demand during normal days. The optimal storage capacities, maximum annual net cost saving and corresponding power reduction set-points during DR event are obtained by using the proposed optimal design method. Lastly, this research provides guidance in comprehensive evaluation of cost-saving potential of CTES integrated with HVAC system for building demand management including both fast DR and PLM.

25 ENERGY STORAGE↗
DOE OSTI2017

An Augmented Lagrangian Filter Method for Real-Time Embedded Optimization

We present a filter line-search algorithm for nonconvex continuous optimization that combines an augmented Lagrangian function and a constraint violation metric to accept and reject steps. The approach is motivated by real-time optimization applications that need to be executed on embedded computing platforms with limited memory and processor speeds. The proposed method enables primal–dual regularization of the linear algebra system that in turn permits the use of solution strategies with lower computing overheads. We prove that the proposed algorithm is globally convergent and we demonstrate the developments using a nonconvex real-time optimization application for a building heating, ventilation, and air conditioning system. Our numerical tests are performed on a standard processor and on an embedded platform. Lastly, we demonstrate that the approach reduces solution times by a factor of over 1000.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Parametric Modeling and Economic Analysis of a 2MW th 3-Stream sCO 2 Heat Exchanger

Here, this paper presents the design and cost optimization of a novel 2MW th 3-stream sCO2 plate-fin heat exchanger. This heat exchanger design is unique in that it uses reduced metal oxide particle-to-sCO2 heat exchanger for cost-effective energy storage applications. The design uses low velocity, laminar air as the re-oxidizing reactant to transfer the heat of the re-oxidizing reaction to a sCO2 power loop. The design of the heat exchanger is based on a 2-D, 3-fluid plate/fin heat transfer model. The model parameterizes the size, shape, and number of passages of the heat exchanger to calculate the temperature profile, pressure drop, and fluid velocities of all three fluids. Global heat exchanger parameters such as the effectiveness and total heat transferred to the sCO2 are then calculated for overall performance. Due to the value and increased use of sCO2 heat exchangers in power cycles, a cost model of the system based on the unique high temperature/high pressure operating conditions was created using quotes from reference projects and market analysis. These quoted air-to-sCO2 heat exchangers are then processed using multiple weighting factors pertinent to heat exchanger design, including heat exchanger type, maximum temperature, differential pressures, fluids, duty, and more. These factors are then used in an exponential function in order to generate a parameterized cost curve. The design and cost of the heat exchanger are then optimized using the SMPSO genetic algorithm in Python. The optimization objectives for the system are to maximize the overall system effectiveness, including an air recuperator for preheating, and to minimize unit costs. Additional constraints are added to the system for the sCO2 and air pressure drops, air velocity to reduce particle entrainment, and the length and volume of the heat exchanger.

Cost Model↗
DOE OSTI2015

TAOI B- Computational Microstructural Optimization Design Tool for High Temperature Structural Materials

The objectives of this research were two-fold: (a) develop a methodology for microstructural optimization of alloys - genetic algorithm approach for alloy microstructural optimization using theoretical models based on fundamental micro-mechanisms, and (b) develop a new computationally designed Ni-Cr alloy for coal-fired power plant applications. The broader outcome of these objectives is expected to be creation of an integrated approach for ‘structural materials by microstructural design’. Three alloy systems were considered for computational optimization and validation, (i) Ni-20Cr (wt.%) base alloy using only solid solution strengthening, (ii) nano-Y 2 O 3 containing Ni-20Cr-1.2Y 2 O 3 (wt.%) alloy for dispersion strengthening and (iii) a sub-micron Al 2 O 3 for composite strengthening, Ni-20Cr-1.2Y 2 O 3 -5.0Al 2 O 3 (wt.%). The specimens were synthesized by mechanical alloying and consolidated using spark plasma sintering. Detailed microstructural characterization was done along with initial mechanical properties to validate the computational prediction. A key target property is to have creep rate of 1x10 -9 s -1 at 100 MPa and 800°C. The initial results were quite promising and require additional quantification of strengthening contributions from dislocation-particle attractive interaction and load transfer. The observed creep rate was in order of 10 -9 s -1 for longer time creep test of Ni-20Cr -1.2Y 2 O 3 -5Al 2 O 3 , lending support to the overall approach pursued in this project.

36 MATERIALS SCIENCE↗
DOE OSTI2016

Holistic Portfolio Optimization using Directed Mutations

Genetic algorithms provide attractive options for performing nonlinear multi-objective combinatorial design optimization, and they have proven very useful for optimizing individual systems. However, conventional genetic algorithms fall short when performing holistic portfolio optimizations in which the decision variables also include the integer counts of multiple system types over multiple time periods. When objective functions are formulated as analytic functions, we can formally differentiate with respect to system counts and use the resulting gradient information to generate favorable mutations in the count variables. We apply several variations on this basic idea to an idealized hanging chain example to obtain >> 1000x speedups over conventional genetic algorithms in both single - and multi-objective cases. We develop a more complex example of a notional military portfolio that includes combinatorial design variables and dependency constraints between the design choices. In this case, our initial results are mixed, but many variations are still open to further research.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Performance Evaluations of Noisy Approximate Quantum Fourier Arithmetic

The Quantum Fourier Transform (QFT) grants competitive advantages, especially in resource usage and circuit approximation, for performing arithmetic operations on quantum computers, and offers a potential route towards a numerical quantum-computational paradigm. In this paper, we utilize efficient techniques to implement QFT-based integer addition and multiplications. These operations are fundamental to various quantum applications including Shor’s algorithm, weighted sum optimization problems in data processing and machine learning and quantum algorithms requiring inner products. We carry out performance evaluations of these implementations based on IBM’s superconducting qubit architecture using different compatible noise models. We isolate the sensitivity of the component quantum circuits on both one-/two-qubit gate error rates, and the number of the arithmetic operands’ superposed integer states. We analyze performance, and identify the most effective approximation depths for quantum add and quantum multiply within the given context. We observe significant dependency of the optimal approximation depth on the degree of machine noise and the number of superposed states in certain performance regimes. Finally, we elaborate on the algorithmic challenges - relevant to signed, unsigned, modular and non-modular versions - that could also be applied to current implementations of QFT-based subtraction, division, exponentiation, and their potential tensor extensions. Here, we analyze performance trends in our results and speculate on possible future development within this computational paradigm.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Active Learning Guided Computational Discovery of Plant-Based Redoxmers for Organic Nonaqueous Redox Flow Batteries

Organic nonaqueous redox flow batteries (ONRFBs) are promising energy storage devices due to their scalability and reliance on sourceable materials. However, finding suitable redox-active organic molecules (redoxmers) for these batteries remains a challenge. Using plant-based compounds as precursors for these redoxmers can decrease their costs and environmental toxicity. In this computational study, flavonoid molecules have been examined as potential redoxmers for ONRFBs. Flavone and isoflavone derivatives were selected as catholyte (positive charge carrier) and anolyte (negative charge carrier) molecules, respectively. To drive their redox potentials to the opposite extremes, in silico derivatization was performed using a novel algorithm to generate a library of > 40000 candidate molecules that penalizes overly complex structures. A multiobjective Bayesian optimization based active learning algorithm was then used to identify best redoxmer candidates in these search spaces. Furthermore, our study provides methodologies for molecular design and optimization of natural scaffolds and highlights the need of incorporating expert chemistry awareness of the natural products and the basic rules of synthetic chemistry in machine learning.

25 ENERGY STORAGE↗
DOE OSTI2015

SU-E-T-793: Validation of COMPASS 3D Dosimetry as Pre Treatment Verification with Commercial TPS Algorithms

Purpose: The purpose of this study was to validate the advent of COMPASS 3D dosimetry as a routine pre treatment verification tool with commercially available CMS Monaco and Oncentra Masterplan planning system. Methods: Twenty esophagus patients were selected for this study. All these patients underwent radical VMAT treatment in Elekta Linac and plans were generated in Monaco v5.0 with MonteCarlo(MC) dose calculation algorithm. COMPASS 3D dosimetry comprises an advanced dose calculation algorithm of collapsed cone convolution(CCC). To validate CCC algorithm in COMPASS, The DICOM RT Plans generated using Monaco MC algorithm were transferred to Oncentra Masterplan v4.3 TPS. Only final dose calculations were performed using CCC algorithm with out optimization in Masterplan planning system. It is proven that MC algorithm is an accurate algorithm and obvious that there will be a difference with MC and CCC algorithms. Hence CCC in COMPASS should be validated with other commercially available CCC algorithm. To use the CCC as pretreatment verification tool with reference to MC generated treatment plans, CCC in OMP and CCC in COMPASS were validated using dose volume based indices such as D98, D95 for target volumes and OAR doses. Results: The point doses for open beams were observed <1% with reference to Monaco MC algorithms. Comparisons of CCC(OMP) Vs CCC(COMPASS) showed a mean difference of 1.82%±1.12SD and 1.65%±0.67SD for D98 and D95 respectively for Target coverage. Maximum point dose of −2.15%±0.60SD difference was observed in target volume. The mean lung dose of −2.68%±1.67SD was noticed between OMP and COMPASS. The maximum point doses for spinal cord were −1.82%±0.287SD. Conclusion: In this study, the accuracy of CCC algorithm in COMPASS 3D dosimetry was validated by compared with CCC algorithm in OMP TPS. Dose calculation in COMPASS is feasible within < 2% in comparison with commercially available TPS algorithms.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2021

Distributed and communication-efficient solutions to linear equations with special sparse structure

In this paper we report two distributed and communication-efficient algorithms based on the multi-agent system are proposed to solve a system of linear equations with the Laplacian sparse system matrix. One algorithm is based on the gradient descent method in optimization. In this algorithm, the agents only share partial information instead of all of their collective state vectors to save significant communication. The other algorithm is obtained by approximating Newton’s method for a faster convergence rate. Although it requires twice as much communication as the first one, it is still communication-efficient given the low dimension of the information shared among agents. The convergence at a linear rate is proved for both algorithms, and a comprehensive comparison of their convergence rate, communication burden, and computation costs is also performed. The proposed algorithms can be applied to various systems to solve those problems that can be modeled as a system of linear equations with a Laplacian sparse system matrix. Simulation results with the electric power system illustrate their effectiveness.

42 ENGINEERING↗