Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

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

At least 181 records · Page 10

Increasing the solar photovoltaic energy capture on sunny and cloudy days

This report analyzes an extensive set of measurements of the solar irradiance made using four identical solar arrays and associated solar sensors (collectively referred to as solar collectors) with different tilt angles relative to the earth's surface, and thus the position of the sun, in order to determine an optimal tracking algorithm for capturing solar radiation. The study included a variety of ambient conditions including different seasons and both cloudy and cloud-free conditions. One set of solar collectors was always approximately pointed directly toward the sun (DTS) for a period around solar noon. These solar collectors thus captured the direct beam component of the solar radiation that predominates on sunny days. We found that on sunny days, solar collectors with a DTS configuration captured more solar energy in accordance with the well-known cosine dependence for the response of a flat-surfaced solar collector to the angle of incidence with direct beam radiation. In particular, a DTS orientation was found to capture up to twice as much solar energy as a horizontal (H) orientation in which the array is tilted toward the zenith. Another set of solar collectors always had an H orientation, and this best captured the diffuse component of the solar radiation that predominates on cloudy days. The dependence of the H/DTS ratio on the solar-collector tilt angle was in approximate agreement with the Isotropic Diffuse Model derived for heavily overcast conditions. During cloudy periods, we found that an H configuration increased the solar energy capture by nearly 40% compared to a DTS configuration during the same period, and we estimate the solar energy increase of an H configuration over a system that tracks the obscured solar disk could reach 50% over a whole heavily-overcast day. On an annual basis the increase is predicted to be much less, typically only about 1%, because the contribution of cloudy days to the total annual solar energy captured by a photovoltaic system is small. These results are consistent with the solar tracking algorithm optimized for cloudy conditions that we proposed in an earlier report and that was based on a much smaller data set. Improving the harvesting of solar energy on cloudy days deserves wider attention due to increasing efforts to utilize renewable solar energy. In particular, increasing the output of distributed solar power systems on cloudy days is important to developing solar-powered home fueling and charging systems for hydrogen-powered fuel-cell electric and battery-powered vehicles, respectively, because it reduces the system size and cost for solar power systems that are designed to have sufficient energy output on the worst (cloudy) days. (author)

14 SOLAR ENERGY↗

Machine learning-aided inverse design for biogas upgrading through biological CO 2 conversion

The biogas upgrading process through bioconversion of CO 2 to CH 4 by hydrogenotrophic methanogens is an attractive strategy for energy decarbonation. Many studies have optimized operational parameters to improve key performance indicators such as CH 4 % and H 2 utilization efficiency. However, inconsistent laboratory conditions make it challenging to compare results. Existing models for analyzing operating conditions can only assess the impact of individual conditions and lack the ability to simultaneously optimize multiple conditions. To address this, two XGBoost models were built with R 2 of 0.779 and 0.903 with data collected from literatures and were embedded into multi-objective partitive swarm optimization algorithm to optimal operating conditions. Predictions were compared with experimental validations under optimized conditions, revealing an 8.50% and 2.95% relative error in CH 4 % and H 2 conversion rate, respectively. This approach streamlines biogas upgrading processes, offering a data-driven solution to enhance efficiency and consistency in the pursuit of sustainable methane production.

Biogas upgrading↗

Techno-Economic Analysis of Recuperated Joule-Brayton Pumped Thermal Energy Storage

This article describes a techno-economic model for pumped thermal energy storage systems based on recuperated Joule-Brayton cycles and two-tank liquid storage. Models have been developed for each component, with particular emphasis on the heat exchangers. Economic metrics such as the power and energy capital costs (i.e., per-kW and per-kWh capacity) and levelized cost of storage are evaluated by gathering numerous cost correlations from the literature, thereby enabling estimates of uncertainty. It is found that the use of heat exchangers with effectivenesses up to 0.95 is economically worthwhile, but higher values lead to rapidly escalating component size and system cost. Several hot storage fluids are considered; those operating at the highest temperatures (chloride salts) improve the round-trip efficiency but the benefit is marginal and may not warrant the additional material costs and risk when compared to lower-temperature nitrate salts. Cost-efficiency trade-offs are explored using a multi-objective optimization algorithm, yielding optimal designs with round-trip efficiencies in the range 59-72% and corresponding levelized storage costs of 0.12 0.03 and 0.38 0.10 $/kWhe. Lifetime costs are competitive with lithium-ion batteries for discharging durations greater than 6 h under current scenarios.

Carnot battery↗

Stochastic solution of population balance equations for reactor networks

This work presents a sequential modular approach to solve a generic network of reactors with a population balance model using a stochastic numerical method. Full-coupling to the gas-phase is achieved through operator-splitting. The convergence of the stochastic particle algorithm in test networks is evaluated as a function of network size, recycle fraction and numerical parameters. These test cases are used to identify methods through which systematic and statistical error may be reduced, including by use of stochastic weighted algorithms. The optimal algorithm was subsequently used to solve a one-dimensional example of silicon nanoparticle synthesis using a multivariate particle model. This example demonstrated the power of stochastic methods in resolving particle structure by investigating the transient and spatial evolution of primary polydispersity, degree of sintering and TEM-style images. Highlights: •An algorithm is presented to solve reactor networks with a population balance model. •A stochastic method is used to solve the population balance equations. •The convergence and efficiency of the reported algorithms are evaluated. •The algorithm is applied to simulate silicon nanoparticle synthesis in a 1D reactor. •Particle structure is reported as a function of reactor length and time.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving global optimization problems on GPU cluster

The paper contains the results of investigation of a parallel global optimization algorithm combined with a dimension reduction scheme. This allows solving multidimensional problems by means of reducing to data-independent subproblems with smaller dimension solved in parallel. The new element implemented in the research consists in using several graphic accelerators at different computing nodes. The paper also includes results of solving problems of well-known multiextremal test class GKLS on Lobachevsky supercomputer using tens of thousands of GPU cores.

97 MATHEMATICS AND COMPUTING↗

Alternative difference analysis scheme combining R -space EXAFS fit with global optimization XANES fit for X-ray transient absorption spectroscopy

Time-resolved X-ray absorption spectroscopy (TR-XAS), based on the laser-pump/X-ray-probe method, is powerful in capturing the change of the geometrical and electronic structure of the absorbing atom upon excitation. TR-XAS data analysis is generally performed on the laser-on minus laser-off difference spectrum. Here, a new analysis scheme is presented for the TR-XAS difference fitting in both the extended X-ray absorption fine-structure (EXAFS) and the X-ray absorption near-edge structure (XANES) regions. R -space EXAFS difference fitting could quickly provide the main quantitative structure change of the first shell. The XANES fitting part introduces a global non-derivative optimization algorithm and optimizes the local structure change in a flexible way where both the core XAS calculation package and the search method in the fitting shell are changeable. The scheme was applied to the TR-XAS difference analysis of Fe(phen) 3 spin crossover complex and yielded reliable distance change and excitation population.

Zhan, Fei↗

Fourier Analysis-Based Evolutionary Multi-Objective Multiphysics Optimization of Liquid-Cooled Heat Sinks

Optimal heat dissipation in power modules can significantly increase their power density. Removing the generated heat is critical for capturing the benefits of advanced semiconductor materials and improving the reliability of the device operation. This article proposes a design optimization method for liquid-cooled heat sinks that use a Fourier analysis-based tool and an evolutionary optimization algorithm to optimize the heat sink geometry for specified objectives. The optimized heat sink geometry is then compared with state-of-the-art solutions in literature based on finite element analysis of different designs. The proposed methodology can develop complex geometries that outperform the conventional heat sink geometries.

Sahu, Raj↗

I-V characterization and parameter extraction tool [SWR-24-59]

GPT-crafted control software and graphical user interface for Keithley 2400 Source Measure Units and global optimization algorithm. It contains Numba-compatible self-adaptive differential evolution algorithm for optimization tasks. This software is comprised of two repositories: https://github.com/NREL/Keithley_GPT https://github.com/NREL/DE

Febba, Davi Marcelo↗

MOOSE Framework Speed and Memory Optimizations

The Multiphysics Object Oriented Simulation Environment (MOOSE) framework has been developed to solve a variety of complex simulations ranging from groundwater flows to full reactor simulations. MOOSE excels at solving fully-implicit, fully-coupled, highly nonlinear models using the Jacobian Free Newton-Krylov (JFNK) method relying on years of expertise in several dependent packages including PETSc, libMesh, Hypre and many others. The modular design of MOOSE enables the rapid development of new physics models that can be coupled with relative ease within the framework for building up simulations of different levels of complexity. With the ongoing adoption of MOOSE to new application areas along with streamlining of existing simulations, the priorities must be adjusted to include code optimizations. This includes both execution speed and the memory footprint of MOOSE-based simulations. These two categories can be further broken down into ''micro-optimizations'' or source code optimizations and algorithmic optimizations where source code is restructured to accomplish the same tasks through a more efficient means. However, before any code optimizations can occur, one must have robust way of measuring these critical simulation properties to identify the best candidates for optimizations along with having a way to identify the effectiveness of proposed optimizations to the framework. This report discusses the preliminary work towards the implementation of a robust execution baseline of the framework and derivative applications under a variety of different simulations. In addition, several potential optimization target areas in both the MOOSE framework and dependent libraries have been identified. An implementation strategy and potential benefits are discussed.

97 MATHEMATICS AND COMPUTING↗

NuSTORM $\mu$ Ring – Design and Injection Optimization

The design of the NuSTORM muon production beam line and storage ring is discussed. The facility includes a pion production target station with a pion collection horn and transport into a straight section of a storage ring. {\pi} decay within that straight section provides {\mu}'s that are stored within the ring for subsequent decay providing precision electron and muon neutrino beams. The ring and transport designs are described and optimized. Genetic Algorithm optimization of the horn and transport into the ring has been performed, providing a significant increase in intensity

43 PARTICLE ACCELERATORS↗

Applicability study of Bayesian optimization in core neutronic design using a toy model

At the Japan Atomic Energy Agency (JAEA), an innovative design approach named ARKADIA (Advanced Reactor Knowledge- and AI-aided Design Integration Approach through the whole plant life cycle) for advanced nuclear reactors is currently under development. One task in ARKADIA is to build a system that automatically optimizes core and fuel designs by conducting core neutronic and thermal-hydraulic calculations, fuel integrity evaluations, and plant dynamic analyses. This system will be implemented to automatically find an optimal design that minimizes (or maximizes) objective function defined by core performance while varying the core and fuel design parameters such as fuel pin diameter, core height and diameter. In this study, as the first step of system development, we focused only on core neutronic design and conducted a study of automatic optimization. As the optimization algorithm, Bayesian optimization (BO), an effective method for optimization problems with expensive computational cost of objective function, was utilized. The applicability of BO was studied based on single- and two-objective optimization examples of core neutronic design in a toy model. As a result, in the former, it was shown that BO can give the optimal solution, which matches the reference solution calculated by a brute force calculation well, with a small number of required calculations. Usability on core neutronic designs, where the computational cost per case is high, was confirmed. In the latter, it was found that BO can give a Pareto solutions-set that shows good agreement with the reference solution. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Riemannian Optimization Applied to AC Optimal Power Flow: Preprint

The nonlinear, nonconvex AC optimal power flow problem is of growing importance as the nature of the power grid evolves. This problem can be difficult to solve for interior point methods. However, the advent of optimization algorithms over smooth Riemannian manifolds presents an alternative approach. The nonlinear, nonconvex constraints in the AC power flow problem form an embedded submanifold of Euclidean space. In this paper, the authors explore the performance of Riemannian optimization algorithms for the ACOPF problem where the optimization is performed directly on the AC power flow manifold. They demonstrate that these are viable computational alternatives to interior point methods. This is done by using Julia and the packages PowerModels.jl and Manopt.jl.

manifold optimization↗

An algorithm for optimal management of aggregated HVAC power demand using smart thermostats

Here, this paper presents an algorithm for optimal management of aggregated power demand of a group of heating, ventilating and air-conditioning (HVAC) units. The algorithm provides an advanced direct load control mechanism for HVACs that leverages the availability of smart thermostats, which are remotely programmable and controllable. The paper provides a theoretical basis and an optimal solution to the problem of cycling a large number of HVAC units while respecting customer-chosen temperature limits for the purpose of maximum load reduction. The problem is presented in a new light by transforming it into a job scheduling problem and is solved using a combination of a novel greedy algorithm and a binary search algorithm. By leveraging widespread availability of smart internet-based (also referred to as IoT-based) thermostats in today’s environment, the proposed approach can be readily applied to residential buildings without additional electrical/IT infrastructure changes.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

On the use of genetic algorithm to optimize industrial assets lifecycle management under safety and budget constraints

The purpose of this paper is to describe the method and tool dedicated to optimize investments planning for industrial assets. These investments may either be preventive maintenance tasks, asset enhancements or logistic investments such as spare parts purchases. The two methodological points to investigate in such an issue are: 1. The measure of the profitability of a portfolio of investments 2. The selection and planning of an optimal set of investments 3. The measure of the risk of a portfolio of investments The measure of the profitability of a set of investments in the IPOP tool is synthesised in the Net Present Value indicator. The NPV is the sum of the differences of discounted cash flows (direct costs, forced outages...) between the situations with and without a given investment. These cash flows are calculated through a pseudo-Markov reliability model representing independently the components of the industrial asset and the spare parts inventories. The component model has been widely discussed over the years but the spare part model is a new one based on some approximations that will be discussed. This model, referred as the NPV function, takes for input an investments portfolio and gives its NPV. The second issue is to optimize the NPV. If all investments were independent, this optimization would be an easy calculation, unfortunately there are two sources of dependency. The first one is introduced by the spare part model, as if components are indeed independent in their reliability model, the fact that several components use the same inventory induces a dependency. The second dependency comes from economic, technical or logistic constraints, such as a global maintenance budget limit or a safety requirement limiting the residual risk of failure of a component or group of component, making the aggregation of individual optimum not necessary feasible. The algorithm used to solve such a difficult optimization problem is a genetic algorithm. After a description of the features of the software a test case is presented showing the influence of the optimization algorithm parameters on its efficiency to find an optimal investments planning. (authors)

97 MATHEMATICS AND COMPUTING↗

A Discrete Lagrangian Algorithm for Optimal Routing Problems

The ideas of discrete Lagrangian methods for conservative systems are exploited for the construction of algorithms applicable in optimal ship routing problems. The algorithm presented here is based on the discretisation of Hamilton's principle of stationary action Lagrangian and specifically on the direct discretization of the Lagrange-Hamilton principle for a conservative system. Since, in contrast to the differential equations, the discrete Euler-Lagrange equations serve as constrains for the optimization of a given cost functional, in the present work we utilize this feature in order to minimize the cost function for optimal ship routing.

97 MATHEMATICS AND COMPUTING↗

Fast model-based scenario optimization in NSTX-U enabled by analytic gradient computation

Model-based optimization offers a systematic approach to advanced scenario planning. In this case, the feedforward-control inputs (actuator trajectories) that are needed to attain and sustain a desired scenario are obtained by solving a nonlinear constrained optimization problem. This class of problems generally minimize a cost function that measures the difference between desired and actual plasma states. Several numerical optimization algorithms, such as sequential quadratic programming, require repeated calculation of the cost function gradients with respect to the input trajectories. Calculating these gradients numerically can be computationally intensive, increasing the time needed to solve the feedforward-control optimization problem. Here, this work introduces a method to analytically calculate these cost function gradients from the current profile evolution model. This can significantly reduce the computational time and allow for fast feedforward-control optimization, which would eventually enable optimal scenario planning between discharges. The performance of the feedforward optimizer with analytical gradients is compared to a traditional optimization algorithm based on numerical gradients for different NSTX-U scenarios. The plasma dynamics in the optimization algorithm are simulated using the Control Oriented Transport SIMulator (COTSIM). Results of the work show that analytical gradients consistently reduce the computation time while achieving trajectories that are comparable to those obtained by traditional optimization algorithms based on numerical gradients.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Multiobjective Particle Swarm Optimization for the optimal design of photovoltaic grid-connected systems

Particle Swarm Optimization (PSO) is a highly efficient evolutionary optimization algorithm. In this paper a multiobjective optimization algorithm based on PSO applied to the optimal design of photovoltaic grid-connected systems (PVGCSs) is presented. The proposed methodology intends to suggest the optimal number of system devices and the optimal PV module installation details, such that the economic and environmental benefits achieved during the system's operational lifetime period are both maximized. The objective function describing the economic benefit of the proposed optimization process is the lifetime system's total net profit which is calculated according to the method of the Net Present Value (NPV). The second objective function, which corresponds to the environmental benefit, equals to the pollutant gas emissions avoided due to the use of the PVGCS. The optimization's decision variables are the optimal number of the PV modules, the PV modules optimal tilt angle, the optimal placement of the PV modules within the available installation area and the optimal distribution of the PV modules among the DC/AC converters. (author)

14 SOLAR ENERGY↗

Controls Optimization Final Report, Controls Algorithms Report, Control Optimization - SPA II: Heaving Buoy Test Results [Three reports]

The over-arching project objective is to fully develop and validate optimal controls frameworks that can subsequently be applied widely to different WEC devices and concepts. Optimal controls of WEC devices represent a fundamental building block for WEC designers that must be considered as an integral part of every stage of device development. Using a building-blocks approach to optimal controls development, this effort will result in the full development of a feed-forward and feed-back control approach and a wave prediction system. Phase I focused primarily on numerical offline optimization and validation using wave tank testing of three industry partners’ WEC devices, including; CalWave, Ocean Energy, and Resolute Marine Energy. These industry partnerships allowed us to identify optimal control strategies for these different WEC topologies at different maturity levels. Phase II focused on demonstrating an integrated control system on an at-sea prototype that is to be custom-built and maturing the HW and SW required to successfully run our advanced controls code frameworks on at-sea systems. A secondary focus during phase II is to adapt our systems identification, controls and wave-prediction frameworks to become more robust and comprehensive in respect to RT capability, robustness, and reliability.

16 TIDAL AND WAVE POWER↗