Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Optimize”

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 793 records · Page 44

An adjoint method for a high-order discretization of deforming domain conservation laws for optimization of flow problems

We report the fully discrete adjoint equations and the corresponding adjoint method are derived for a globally high-order accurate discretization of conservation laws on parametrized, deforming domains. The conservation law on the deforming domain is transformed into one on a fixed reference domain by the introduction of a time-dependent mapping that encapsulates the domain deformation and parametrization, resulting in an Arbitrary Lagrangian–Eulerian form of the governing equations. A high-order discontinuous Galerkin method is used to discretize the transformed equation in space and a high-order diagonally implicit Runge–Kutta scheme is used for the temporal discretization. Quantities of interest that take the form of space–time integrals are discretized in a solver-consistent manner. The corresponding fully discrete adjoint method is used to compute exact gradients of quantities of interest along the manifold of solutions of the fully discrete conservation law. These quantities of interest and their gradients are used in the context of gradient-based PDE-constrained optimization. The adjoint method is used to solve two optimal shape and control problems governed by the isentropic, compressible Navier–Stokes equations. The first optimization problem seeks the energetically optimal trajectory of a 2D airfoil given a required initial and final spatial position. The optimization solver, driven by gradients computed via the adjoint method, reduced the total energy required to complete the specified mission nearly an order of magnitude. The second optimization problem seeks the energetically optimal flapping motion and time-morphed geometry of a 2D airfoil given an equality constraint on the x-directed impulse generated on the airfoil. The optimization solver satisfied the impulse constraint to greater than 8 digits of accuracy and reduced the required energy between a factor of 2 and 10, depending on the value of the impulse constraint, as compared to the nominal configuration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimal design of chemoepitaxial guideposts for the directed self-assembly of block copolymer systems using an inexact Newton algorithm

Directed self-assembly (DSA) of block copolymers (BCPs) is one of the most promising developments in the cost-effective production of nanoscale devices. The process makes use of the natural tendency for BCP melts to form nanoscale structures upon phase separation. The phase separation can be directed through the use of chemically patterned substrates to promote the formation of morphologies that are essential to the production of semiconductor devices. Moreover, the design of substrate pattern can be formulated as an optimization problem for which we seek optimal substrate designs that effectively produce given target morphologies. In this paper, we adopt a phase field model given by a nonlocal Cahn–Hilliard partial differential equation (PDE) based on the minimization of the Ohta–Kawasaki free energy, and present an efficient PDE-constrained optimization framework for the optimal design problem. The design variables are the locations of circular- or strip-shaped guiding posts that are used to model the substrate chemical pattern. To solve the ensuing optimization problem, we propose a variant of an inexact Newton conjugate gradient algorithm tailored to this problem. Additionally, we demonstrate the effectiveness of our computational strategy on numerical examples that span a range of target morphologies. Owing to our second-order optimizer and fast state solver, the numerical results demonstrate five orders of magnitude reduction in computational cost over previous work. The efficiency of our framework and the fast convergence of our optimization algorithm enable us to rapidly solve the optimal design problem in not only two, but also three spatial dimensions.

97 MATHEMATICS AND COMPUTING↗

Dynamic machine learning-based optimization algorithm to improve boiler efficiency

With decreasing computational costs, improvement in algorithms, and the aggregation of large industrial and commercial datasets, machine learning is becoming a ubiquitous tool for process and business innovations. Machine learning is still lacking applications in the field of dynamic optimization for real-time control. This work presents a novel framework for performing constrained dynamic optimization using a recurrent neural network model combined with a metaheuristic optimizer. The framework is designed to augment an existing control system and is purely data-driven, like most industrial Model Predictive Control applications. Several recurrent neural network models are compared as well as several metaheuristic optimizers. Hyperparameters and optimizer parameters are tuned with parameter sweeps, and the resulting values are reported. Further, the best parameters for each optimizer and model combination are demonstrated in closed-loop control of a dynamic simulation, and several recommendations are made for generalizing this framework to other systems. Up to 0.953% improvement is realized over the non-optimized case for a simulated coal-fired boiler. While this is not a large improvement in percentage, the total economic impact is $991,000 per year, and this study builds a foundation for future machine learning with dynamic optimization.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Quantum approximate multi-objective optimization

The goal of multi-objective optimization is to understand optimal trade-offs between competing objective functions by finding the Pareto front, that is, the set of all Pareto-optimal solutions, where no objective can be improved without degrading another one. Multi-objective optimization can be challenging classically, even if the corresponding single-objective optimization problems are efficiently solvable. Thus, multi-objective optimization represents a compelling problem class to analyze with quantum computers. Here we use a low-depth quantum approximate optimization algorithm to approximate the optimal Pareto front of certain multi-objective weighted maximum-cut problems. We demonstrate its performance on an IBM Quantum computer, as well as with matrix product state numerical simulation, and show its potential to outperform classical approaches.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Cutting Surface Algorithm for Semi-Infinite Convex Programming with an Application to Moment Robust Optimization

In this paper, we present and analyze a central cutting surface algorithm for general semi-infinite convex optimization problems and use it to develop a novel algorithm for distributionally robust optimization problems in which the uncertainty set consists of probability distributions with given bounds on their moments. Moments of arbitrary order, as well as nonpolynomial moments, can be included in the formulation. We show that this gives rise to a hierarchy of optimization problems with decreasing levels of risk-aversion, with classic robust optimization at one end of the spectrum and stochastic programming at the other. Although our primary motivation is to solve distributionally robust optimization problems with moment uncertainty, the cutting surface method for general semi-infinite convex programs is also of independent interest. The proposed method is applicable to problems with nondifferentiable semi-infinite constraints indexed by an infinite dimensional index set. Examples comparing the cutting surface algorithm to the central cutting plane algorithm of Kortanek and No demonstrate the potential of our algorithm even in the solution of traditional semi-infinite convex programming problems, whose constraints are differentiable, and are indexed by an index set of low dimension. After the rate of convergence analysis of the cutting surface algorithm, we extend the authors' moment matching scenario generation algorithm to a probabilistic algorithm that finds optimal probability distributions subject to moment constraints. The combination of this distribution optimization method and the central cutting surface algorithm yields a solution to a family of distributionally robust optimization problems that are considerably more general than the ones proposed to date.

97 MATHEMATICS AND COMPUTING↗

Optimizing pressurized-water reactor equilibrium cycle using a novel loading pattern encoding and rule-based genetic crossover operators

This work presents an extended multi-batch approach applied in shuffling scheme optimization for equilibrium cycle for pressurized water reactors using Genetic Algorithms (GAs). A new ruled based GA crossover operator called Inherited Location and Batch (ILB) was introduced to enhance offsprings reproduction efficiency specialized for equilibrium cycle optimization problem. This approach was implemented within the Plant ReLoad Optimization (PRLO) framework and validated using a generic reactor model based on the AP1000 design, with core parameters calculated via the CASMO/SIMULATE software package. The ILB approach is then applied for both single and multi-objective problems in maximizing cycle length and core average exposure while minimizing the average enrichment of the 57 fresh fuel assemblies (FAs) per cycle. The optimal solutions are selected based on their dominance to the objectives from all feasible solutions. This research identified three optimal solutions satisfied safety constraints: The first solution minimizes feed enrichment costs with a cycle length of 338.8 days and core exposure of 25.39 MWd/MT; the second solution extends cycle length to 361.2 days, with the highest core exposure of 26.84 MWd/MT, using 3.75 wt% average fuel enrichment; the third solution balances both objectives with a cycle length of 349.6 days, core exposure of 25.82 MWd/MT with a slight enrichment increase compared to the first solution. Collectively, these findings underscore the efficiency and effectiveness of the proposed approach in achieving practical multi-objective optimal equilibrium cycle designs using GAs optimizer.

11 - NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

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↗

Factorization Machine‐Based Active Learning for Functional Materials Design with Optimal Initial Data

The optimization of functional materials is important to enhance their properties, but their complex geometries pose great challenges to optimization. Data-driven algorithms efficiently navigate such complex design spaces by learning relationships between material structures and performance metrics to discover high-performance functional materials. Surrogate-based active learning, continually improving its surrogate model by iteratively including high-quality data points, has emerged as a cost-effective data-driven approach. Furthermore, it can be coupled with quantum computing to enhance optimization processes, especially when paired with a special form of surrogate model (i.e., quadratic unconstrained binary optimization), formulated by factorization machine (FM). However, current practices often overlook the variability in design space sizes when determining the initial data size for optimization. In this work, we investigate the optimal initial data sizes required for efficient convergence across various design space sizes. By employing averaged piecewise linear regression, we identify initiation points where convergence begins, highlighting the crucial role of employing adequate initial data in achieving efficient optimization. These results contribute to the efficient optimization of functional materials by ensuring faster convergence and reducing computational costs in FM-based active learning.

active learning↗

Optimally configuring a measurement system to detect diversions from a nuclear fuel cycle

The civilian nuclear fuel cycle is an industrial process that produces electrical power from the nuclear fission of uranium. Using a measurement system to accurately account for nuclear material, such as uranium, in a fuel cycle is important because of the possible loss or diversion of this potentially dangerous material. A measurement system is defined by a set of measurement methods, or “devices,” used to account for material flows and inventory values at specific locations in the fuel cycle. Here, we develop a simulation-optimization algorithm and an integer-programming model to find the best, or near-best, resource-limited measurement system with a high degree of confidence. The simulation-optimization algorithm minimizes a weighted sum of false positive and false negative diversion-detection probabilities while accounting for material quantities and measurement errors across a finite, discrete time horizon in hypothetical non-diversion and diversion contexts. In each time period, the estimated cumulative material unaccounted for is compared to a fixed or an optimized threshold value to assess if a “significant amount of material” is lost from a measurement system. The integer-programming model minimizes the population variance of the estimated material loss, i.e., material unaccounted for, in a measurement system. We analyze three potential problems in nuclear fuel cycle measurement systems: (i) given location-dependent device precisions, find the configuration of n devices at n locations ( n = 3) that gives the lowest corresponding objective values using the simulation-optimization algorithm and integer-programming model, (ii) find the location at which improving device precision reduces objective values the most using the simulation-optimization algorithm, and determine the effect of measurement frequency on measurement system configurations and objective values using the simulation-optimization algorithm. We obtain comparable results for each problem at least an order of magnitude faster than existing methods do. Using an optimized, rather than fixed, detection threshold in the simulation-optimization algorithm reduces the weighted sum of false positive and false negative probabilities.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Submodular optimization problems and greedy strategies: A survey

The greedy strategy is an approximation algorithm to solve optimization problems arising in decision making with multiple actions. How effective is the greedy strategy compared to the optimal solution? In this survey, we mainly consider two classes of optimization problems where the objective function is submodular. The first is set submodular optimization, which is to choose a set of actions to optimize a set submodular objective function, and the second is string submodular optimization, which is to choose an ordered set of actions to optimize a string submodular function. Our emphasis here is on performance bounds for the greedy strategy in submodular optimization problems. Specifically, we review performance bounds for the greedy strategy, more general and improved bounds in terms of curvature, performance bounds for the batched greedy strategy, and performance bounds for Nash equilibria.

97 MATHEMATICS AND COMPUTING↗

Development Optimization and Uncertainty Analysis Methods for Oil and Gas Reservoirs

Uncertainty complicates the development optimization of oil and gas exploration and production projects, but methods have been devised to analyze uncertainty and its impact on optimal decision-making. This paper compares two methods for development optimization and uncertainty analysis: Monte Carlo (MC) simulation and stochastic programming. Two example problems for a gas field development and an oilfield development are solved and discussed to elaborate the advantages and disadvantages of each method. Development optimization involves decisions regarding the configuration of initial capital investment and subsequent operational decisions. Uncertainty analysis involves the quantification of the impact of uncertain parameters on the optimum design concept. The gas field development problem is designed to highlight the differences in the implementation of the two methods and to show that both methods yield the exact same optimum design. The results show that both MC optimization and stochastic programming provide unique benefits, and that the choice of method depends on the goal of the analysis. While the MC method generates more useful information, along with the optimum design configuration, the stochastic programming method is more computationally efficient in determining the optimal solution. Reservoirs comprise multiple compartments and layers with multiphase flow of oil, water, and gas. We present a workflow for development optimization under uncertainty for these reservoirs, and solve an example on the design optimization of a multicompartment, multilayer oilfield development.

02 PETROLEUM↗

Co-Optimization of Electricity Transmission and Generation Resources for Planning and Policy Analysis: Review of Concepts and Modeling Approaches

The recognition of transmission's interaction with other resources has motivated the development of co-optimization methods to optimize transmission investment while simultaneously considering tradeoffs with investments in electricity supply, demand, and storage resources. For a given set of constraints, co-optimized planning models provide solutions that have lower costs than solutions obtained from decoupled optimization (transmission-only, generation-only, or iterations between them). This paper describes co-optimization and provides an overview of approaches to co-optimizing transmission options, supply-side resources, demand-side resources, and natural gas pipelines. In particular, the paper provides an up-to-date assessment of the present and potential capabilities of existing co-optimization tools, and it discusses needs and challenges for developing advanced co-optimization models.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An efficient optimization of well placement and control for a geothermal prospect under geological uncertainty

This work applies an efficient optimization technique based on a multivariate adaptive regression spline (MARS) technique to determine the optimal design and engineering of a potential geothermal production operation at a prospect near Superstition Mountain in Southern California, USA. The faster MARS-based statistical model is used as a surrogate for higher-fidelity physical models within the intensive optimization process. Its use allows for the exploration of the impacts of specific engineering design parameters in the context of geologic uncertainty as a means to both understand and maximize profitability of the production operation. The MARS model is initially developed from a training dataset generated by a finite set of computationally complex hydrothermal models applied to the prospect. Its application reveals that the optimal engineering design variables can differ considerably assuming different choices of hydrothermal flow properties, which, in turn, indicates the importance of reducing the uncertainty of key geologic properties. The major uncertainty sources in the natural-system are identified and ranked first by an efficient MARS-enabled total order sensitivity quantification, which is then used to assist evaluating the effect of geological uncertainties on optimized results. At the Southern California prospect, this parameter sensitivity analysis suggests that groundwater circulation through high permeable structures, rather than heat conduction through impermeable granite, is the primary heat transfer method during geothermal extraction. Reservoir histories simulated using optimal parameters with different constraints are analyzed and compared to investigate the longevity and maximum profit of the geothermal resources. The comparison shows that the longevity and profit are very likely to be overestimated by optimizations without appropriate constraints on natural conditions. In addition to geothermal energy production, this optimization approach can also be used to manage other geologic resource operations, such as hydrocarbon production or CO 2 sequestration, under uncertain reservoir conditions.

15 GEOTHERMAL ENERGY↗

Optimization-Inspired Pin-Fin Array for Supercritical Carbon Dioxide Recuperator

Additively manufactured heat exchangers are one possible route to cost-effective sCO 2 power cycles. In this paper, experimental results are obtained for two helical pin fin tubes that were designed following parametric optimization of the fin array. Neither the numerical optimization nor the experimental testing have been previously reported in the literature. The two tube designs were, (1) the optimization inspired design, and (2) the optimization-inspired design with a fin diameter increased by a factor of 2. To characterize the print, the designs were scanned using X-ray computed tomography to measure feature sizes and heat transfer area. The optimization was conducted in a commercial, computational fluid dynamics code. The code solved the Reynolds Averaged Navier-Stokes (RANS) and energy equations with turbulence closure provided by the shear stress transport (SST) k-ω model. In the experiments, the Nusselt number augmentation was measured using the Wilson plot technique and the friction factor was determined with mass flow and pressure drop measurements. The experimental testing indicated that the optimization-inspired design had a friction factor that was four times less than the baseline tube design at equal Nusselt number. Additionally, the optimization-inspired design had a 14% improvement in Nusselt number, at equal friction factor, relative to the best performing computational fluid dynamics (CFD) trial points. Tube design (2), with the larger diameter pin fins, had similar performance, within experimental error, as the tube with the smaller diameter pin fins (1). Both tubes achieved overall fin array efficiencies near 1. A performance factor, V/V 0 , equal to the volume of the enhanced heat exchanger divided by the volume of the baseline (no-fins) heat exchanger, is recommended to quantify internal cooling performance. In conclusion, the experimental shell and tube heat exchanger, using the additively manufactured tube, is competitive with printed circuit heat exchangers in its pressure drop class and could be further improved by optimizing a shell-and-tube heat exchanger utilizing this heat transfer enhancement feature.

42 ENGINEERING↗

A biomimetic approach to fast selection of optimal controlled variables using multiagent algorithms and a decomposition approach

Selection of primary controlled variables (CVs) with due consideration of economic loss and ease of control is an important step for achieving optimal plant operation under design and off-design conditions. However, the computational expense of the combinatorial optimization step that is undertaken for CV selection renders the existing approaches unaffordable for fast selection of optimal CVs. Two approaches are proposed in this paper for improving the computational efficiency of the optimization step. Typically, the CV selection process is typically executed by considering the entire plant together. Opposed to that, the first approach proposed here seeks to decompose the process plant into multiple partitions based on the connectivity strength. Then the CV selection algorithm can be executed on each partition independently. The decomposition algorithm is biomimetic and has been developed, in analogy to neuroscience, mimicking how the information about the connectivity information is extracted using a dynamic casual model. This approach can significantly decrease the number of combinatorial optimization problems that needs to be solved and facilitates parallelization of the solution. In the second approach, a multiagent optimization framework is proposed that utilizes metaheuristic optimization strategies such as the efficient ant colony algorithm, simulated annealing and the genetic algorithm. These two approaches can be used by themselves or in combination. This framework enables cooperative search by a group of algorithmic agents facilitated through an information sharing protocol. These two approaches are applied to a toy problem and an acid gas removal unit as part of an integrated gasification combined cycle. This study shows how the computational time and economic and control performance of the optimal CV sets vary as the number of partitions are changed.

42 ENGINEERING↗

A Tchebycheff-based multi-objective combined with a PSO–SQP dynamic real-time optimization framework for cycling energy systems

The aim in this work is to develop an optimization framework to address cycling of baseload energy systems due to the penetration of renewables into the grid. The developed strategy corresponds to a multi-objective and dynamic real-time optimization (MOO-DRTO) framework applied to a postcombustion MEA-based CO 2 capture process from a baseload coal-fired power plant under cycling conditions. A Tchebycheff-based method is used for the multi-objective optimization (MOO) component. Also, a hybrid approach consisting of Particle Swarm Optimization (PSO) and Sequential Quadratic Programming (SQP) is implemented for the first time in process systems engineering to solve the dynamic real-time optimization (DRTO) component. The objectives considered in the MOO-DRTO framework are economic and environmental. The proposed MOO-DRTO strategy is successfully implemented and 24-h optimal output trajectories for the carbon capture system under cycling are generated. Also, the optimal compromise is chosen from the Pareto front according to a set of selected weights for the objectives with minimal interaction between the framework and decision maker. The results indicated that the developed framework has potential to be extended to plant-wide optimization applications under cycling.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An Efficient Algorithm for Automatic Structure Optimization in X-ray Standing-Wave Experiments

We present that x-ray standing-wave photoemission experiments involving multilayered samples are emerging as unique probes of the buried interfaces that are ubiquitous in current device and materials research. Such data require for their analysis a structure optimization process comparing experiment to theory that is not straightforward. In this work, we present a new computer program for optimizing the analysis of standing-wave data, called SWOPT, that automates this trial-and-error optimization process. The program includes an algorithm that has been developed for computationally expensive problems: so-called black-box simulation optimizations. It also includes a more efficient version of the Yang X-ray Optics Program (YXRO) [Yang, S.-H., Gray, A.X., Kaiser, A.M., Mun, B.S., Sell, B.C., Kortright, J.B., Fadley, C.S., J. Appl. Phys. 113, 1 (2013)] which is about an order of magnitude faster than the original version. Human interaction is not required during optimization. We tested our optimization algorithm on real and hypothetical problems and show that it finds better solutions significantly faster than a random search approach. The total optimization time ranges, depending on the sample structure, from minutes to a few hours on a modern laptop computer, and can be up to 100x faster than a corresponding manual optimization. Finally, these speeds make the SWOPT program a valuable tool for realtime analyses of data during synchrotron experiments.

36 MATERIALS SCIENCE↗

Experimental optimization of a free vortex propeller runner for micro hydro application

The turbine technology for low head application in the micro hydro range has been vastly neglected despite niche available in scattered regions of valley flows as well as in wastewater canals and other energy recovery schemes, where the available head does not exceed 2 meters. The goal of this study is to develop hydraulically optimized propeller turbines for the micro hydro range with a particular focus on ease of manufacture. This paper presents a wide range of geometrical optimization steps carried out on a propeller runner, whose blades have been designed using the free vortex theory, and operating with a gross head from 1.5 to 2 m and discharge of approximately 75 l/s. It further illustrates 3 stages of geometrical modifications carried out on the runner with an objective of optimizing the runner performance. These modifications comprised of changes to the tip angles (both at the runner inlet and exit) as well as the hub angles (at the runner inlet) of the runner blades. The paper also presents an interesting theoretical methodology to analyze the effects of each optimization stage. This method looks at the relative changes to shaft power and discharge at constant head and speed and gives wonderful insight as to how the internal parameters like Euler shaft work and runner hydraulic losses are behaving with respect to each optimization stage. It was found that the performance of the runner was very sensitive to changes to exit tip angle. At two levels of modification, the discharge increased in the range of 15-30%, while shaft power increased in the range of 12-45%, thus influencing the efficiency characteristics. The results of the runner inlet tip modification were very interesting in that a very significant rise of turbine efficiency was recorded from 55% to 74% at the best efficiency point, which was caused by a reduced discharge consumption as well as a higher power generation. It was also found that the optimization study on a propeller runner has reasonably validated the estimates of the free vortex theory despite small deviations. The final runner configuration demonstrated a maximum efficiency of 74% ({+-}1.8%), which is very encouraging from the perspectives of micro hydro application. The paper concludes with recommendations of a series of optimization steps to increase the efficiency of the runner. It also recommends the attempt of Computational Fluid Dynamics both as a validation and optimization tool for future research on propeller runners. (author)

13 HYDRO ENERGY↗