Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “optimality”

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,675 records · Page 93

Battery Electric Vehicles: Range Optimization and Diversification for the U.S. Drivers

Properly selecting the driving range is critical for accurately predicting the market acceptance and the resulting social benefits of BEVs. Analysis of transportation technology transition could be biased against battery electric vehicles (BEV) and mislead policy making, if BEVs are not represented with optimal ranges. This study proposes a coherent method to optimize the BEV driving range by minimizing the range-related cost, which is formulated as a function of range, battery cost, energy prices, charging frequency, access to backup vehicles, and the cost and refueling hassle of operating the backup vehicle. This method is implemented with a sample of 36,664 drivers, representing U.S. new car drivers, based on the 2009 National Household Travel Survey data. Key findings are: 1) Assuming the near term (2015) battery cost at $405/kWh, about 98% of the sampled drivers are predicted to prefer a range below 200 miles, and about 70% below 100 miles. The most popular 20-mile band of range is 57 to77 miles, unsurprisingly encompassing the Leaf s EPA-certified 73-mile range. With range limited to 4 or 7 discrete options, the majority are predicted to choose a range below 100 miles. 2) Found as a statistically robust rule of thumb, the BEV optimal range is approximately 0.6% of one s annual driving distance. 3) Reducing battery costs could motivate demand for larger range, but improving public charging may cause the opposite. 4) Using a single range to represent BEVs in analysis could significantly underestimate their competitiveness e.g. by $3226/vehicle if BEVs are represented with 73-mile range only or by $7404/BEV if with 150-mile range only. Range optimization and diversification into 4 or 7 range options reduce such analytical bias by 78% or 90%, respectively.

33 ADVANCED PROPULSION SYSTEMS↗

A Multiobjective Optimization Framework for Stochastic Control of Complex Systems

This paper addresses the problem of minimizing the long-run expected average cost of a complex system consisting of subsystems that interact with each other and the environment. We treat the stochastic control problem as a multiobjective optimization problem of the one-stage expected costs of the subsystems, and we show that the control policy yielding the Pareto optimal solution is an optimal control policy that minimizes the average cost criterion for the entire system. For practical situations with constraints consistent to those we study here, our results imply that the Pareto control policy may be of value in deriving online an optimal control policy in complex systems.

Complex systems↗

Reductive Analysis with Compiler-Guided Large Language Models for Input-Centric Code Optimizations

Input-centric program optimization aims to optimize code by considering the relations between program inputs and program behaviors. Despite its promise, a long-standing barrier for its adoption is the difficulty of automatically identifying critical features of complex inputs. This paper introduces a novel technique, reductive analysis through compiler-guided Large Language Models (LLMs), to solve the problem through a synergy between compilers and LLMs. It uses a reductive approach to overcome the scalability and other limitations of LLMs in program code analysis. The solution, for the first time, automates the identification of critical input features without heavy instrumentation or profiling, cutting the time needed for input identification by 44× (or 450× for local LLMs), reduced from 9.6 hours to 13 minutes (with remote LLMs) or 77 seconds (with local LLMs) on average, making input characterization possible to be integrated into the workflow of program compilations. Optimizations on those identified input features show similar or even better results than those identified by previous profiling-based methods, leading to optimizations that yield 92.6% accuracy in selecting the appropriate adaptive OpenMP parallelization decisions, and 20-30% performance improvement of serverless computing while reducing resource usage by 50-60%.

Input-Centric Optimization↗

McCormick envelopes in mixed-integer PDE-constrained optimization

McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.

Approximations and Expansions↗

Global optimization of multicomponent distillation configurations: 2. Enumeration based global minimization algorithm

We present a general Global Minimization Algorithm (GMA) to identify basic or thermally coupled distillation configurations that require the least vapor duty under minimum reflux conditions for separating any ideal or near-ideal multicomponent mixture into a desired number of product streams. In this algorithm, global optimality is guaranteed by modeling the system using Underwood equations and reformulating the resulting constraints to bilinear inequalities. The speed of convergence to the globally optimal solution is increased by using appropriate feasibility and optimality based variable-range reduction techniques and by developing valid inequalities. As a result, the GMA can be coupled with already developed techniques that enumerate basic and thermally coupled distillation configurations, to provide for the first time, a global optimization based rank-list of distillation configurations.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Optimal blending management of biomass resources used for biochemical conversion

This research develops an optimization model to describe the tradeoff among blend components in the least-cost biomass blend, based on resource availability, quality requirements, and logistics cost for a biochemical conversion. A mixed-integer linear programming model is developed to determine the least-cost blend from a set of candidate feedstocks. A case study – based on a biorefinery located in western Kansas that uses three-pass corn stover, two-pass corn stover, switchgrass, miscanthus, and municipal solid waste fractions to meet biochemical conversion specifications and feedstock demand – shows that the delivered cost of an optimal blend that meets carbohydrate and ash specifications is 12.12% higher than the delivered cost of optimal blend that meets a carbohydrate specification only. The results indicate that a least-cost blend that meets both carbohydrate and ash specifications consists of miscanthus (48.2%) and switchgrass (29.4%) whereas the least-cost blend meeting carbohydrate specification only comprises three-pass corn stover (55.4%) and two-pass corn stover (20.4%). Here an optimal blend uses a low-cost municipal solid waste fraction in all cases, implying that blending could be a potential strategy to reduce delivered feedstock cost.

09 BIOMASS FUELS↗

Detailed modeling of the video signal and optimal readout of charge-coupled devices

This paper provides a practical design methodology to calculate an optimal filter for noise reduction in the readout of charge-coupled devices (CCDs) taking into account the charge transfer and feedthroughs due to capacitive coupling in the CCD. A detailed analysis of the dynamics of the video signal and charge transfer is presented, including the circuital modeling of the output stage of the CCD and the dynamics of the electronics in the video chain before the analog-to-digital (AD) converter. This model is used to compute an optimal filter that minimizes the variance of the pixel noise and uses the samples of the charge transfer, before the charge is fully settled. This is necessary to enhance the performance of previous results that also use optimal filters but do not use the transition samples, while also reducing the pixel readout time, resulting in faster readouts. As a proof of concept for the optimal filter, we present in this paper novel experimental results using a Skipper CCD, which has a floating sense node that allows to measure the charge packet an arbitrary number of times. However, this technique can be applied to any CCD that has a readout system that digitally samples the video signal.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Multiscale design of nonlinear materials using a Eulerian shape optimization scheme

Motivated by recent advances in manufacturing, the design of materials is the focal point of interest in the material research community. One of the critical challenges in this field is finding optimal material microstructure for a desired macroscopic response. This work presents a computational method for the mesoscale-level design of particulate composites for an optimal macroscale-level response. The method relies on a custom shape optimization scheme to find the extrema of a nonlinear cost function subject to a set of constraints. Three key “modules” constitute the method: multiscale modeling, sensitivity analysis, and optimization. Multiscale modeling relies on a classical homogenization method and a nonlinear NURBS-based generalized finite element scheme to efficiently and accurately compute the structural response of particulate composites using a nonconformal discretization. A three-parameter isotropic damage law is used to model microstructure-level failure. An analytical sensitivity method is developed to compute the derivatives of the cost/constraint functions with respect to the design variables that control the microstructure's geometry. The derivation uncovers subtle but essential new terms contributing to the sensitivity of finite element shape functions and their spatial derivatives. Several structural problems are solved to demonstrate the applicability, performance, and accuracy of the method for the design of particulate composites with a desired macroscopic nonlinear stress-strain response.

42 ENGINEERING↗

Plastic work constrained elastoplastic topology optimization

An elastoplastic topology optimization framework for limiting plastic work generation while maximizing stiffness is presented. The kinematics and constitutive model are based on finite strain linear isotropic hardening plasticity, and the balance laws are solved using a total Lagrangian finite element formulation. Aggregation of the specific plastic work combined with an adaptive normalization scheme efficiently constrains the maximum specific plastic work. The optimization problem is regularized using an augmented partial differential equation filter, and is solved by the method of moving asymptotes where path-dependent sensitivities are derived using the adjoint method. The numerical examples show a clear dependence on the optimized maximum stiffness structures for different levels of constrained specific plastic work. It is also shown that due to the history dependency of the plasticity, the load path significantly influences the structural performance and optimized topology.

42 ENGINEERING↗

Bayesian D‐Optimal Designs for Gaussian Process Surrogate Models

Computer experiments often employ space-filling strategies to create surrogate models with strong predictive performance. The impact of model parameter estimation for Gaussian process surrogates, however, is often overlooked. Obtaining a better initial estimate of the covariance lengthscale parameter, θ, can greatly improve the resulting Gaussian process fit through more effective sequential acquisitions during active learning. In this work, we propose a novel initial design maximizing the Bayesian D-optimality criterion of the Gaussian process lengthscale parameter. Previously published results have shown the emphasis on lengthscale estimation to be promising, but relied on an empirically driven design creation process. Our Bayesian D-optimal designs are rooted in information theory and lead to more informative sequential acquisitions by improving lengthscale estimation. In many cases, these gains eventually result in better surrogates than those seeded with space-filling initial designs. Furthermore, Bayesian D-optimal designs can be tailored to either isotropic or anisotropic covariance structures, and the Bayesian framework enables the inclusion of prior knowledge in the design process, offering greater flexibility and adaptability. Through several simulation studies, we demonstrate the advantages of Bayesian D-optimal designs in terms of both lengthscale estimation accuracy and predictive performance during active learning.

Bayesian experimental design↗

Optimization of turbine design in wind farms with multiple hub heights, using exact analytic gradients and structural constraints

Wind farms are generally designed with turbines of all the same hub height. If wind farms were designed with turbines of different hub heights, wake interference between turbines could be reduced, lowering the cost of energy (COE). This paper demonstrates a method to optimize onshore wind farms with two different hub heights using exact, analytic gradients. Gradient-based optimization with exact gradients scales well with large problems and is preferable in this application over gradient-free methods. Our model consisted of the following: a version of the FLOw Redirection and Induction in Steady-State wake model that accommodated three-dimensional wakes and calculated annual energy production, a wind farm cost model, and a tower structural model, which provided constraints during optimization. Structural constraints were important to keep tower heights realistic and account for additional mass required from taller towers and higher wind speeds. We optimized several wind farms with tower height, diameter, and shell thickness as coupled design variables. Our results indicate that wind farms with small rotors, low wind shear, and closely spaced turbines can benefit from having two different hub heights. A nine-by-nine grid wind farm with 70-meter rotor diameters and a wind shear exponent of 0.08 realized a 4.9% reduction in COE by using two different tower sizes. If the turbine spacing was reduced to 3 diameters, the reduction in COE decreased further to 11.2%. Allowing for more than two different turbine heights is only slightly more beneficial than two heights and is likely not worth the added complexity.

17 WIND ENERGY↗

Optimizing wind farm siting to reduce power system impacts of wind variability

We introduce and solve two variants of a biobjective optimization model to reduce the negative impact of wind variability on the power system by strategically locating wind farms. The first model variant considers average changes in wind power over time; the second captures extreme fluctuations in wind power. A complementary set of wind sites is selected with the aim of minimizing both residual demand and the variability in residual demand. Because exact optimization is computationally intensive, we develop two heuristics—forward and backward greedy algorithms—to find approximate solutions. The results are compared with the exact optimization results for a well-selected subset of the data as well as to the results from selecting sites based on average wind alone. The two models are solved using demand data and potential wind sites for the Southwest Power Pool. Though both objectives can be improved by adding more sites, for a fixed number of sites, minimizing residual demand and variability in residual demand are competing objectives. Here, we find an approximate efficient frontier to compare trade-offs between the two objectives. We also vary the parameter in the heuristic that controls how the two objectives are prioritized. For the case study, the backward greedy algorithm is more effective at reducing the wind power variability than the forward greedy algorithm. Furthermore, using the backward algorithm for the full dataset is more effective than solving the exact optimization on a subset of the data when the results are evaluated using the full dataset.

17 WIND ENERGY↗

OpenMP Parallelization and Optimization of Graph-Based Machine Learning Algorithms

In this paper, we investigate the OpenMP parallelization and optimization of two novel data classification algorithms. The new algorithms are based on graph and PDE solution techniques and provide significant accuracy and performance advantages over traditional data classification algorithms in serial mode. The methods leverage the Nystrom extension to calculate eigenvalue/eigenvectors of the graph Laplacian and this is a self-contained module that can be used in conjunction with other graph-Laplacian based methods such as spectral clustering. We use performance tools to collect the hotspots and memory access of the serial codes and use OpenMP as the parallelization language to parallelize the most time-consuming parts. Where possible, we also use library routines. We then optimize the OpenMP implementations and detail the performance on traditional supercomputer nodes (in our case a Cray XC30), and test the optimization steps on emerging testbed systems based on Intel’s Knights Corner and Landing processors. We show both performance improvement and strong scaling behavior. Finally, a large number of optimization techniques and analyses are necessary before the algorithm reaches almost ideal scaling.

97 MATHEMATICS AND COMPUTING↗

Manufacturing and stiffness constraints for topology optimized periodic structures

Topology optimization (TO) is commonly applied to design the unit cells of periodic structures. For example, metamaterials, lattice structures, phononic crystals (PhC), and photonic crystals (PC) have all been previously designed via TO. Unfortunately, the optimal structures for certain design objectives, e.g., bandgaps, are often impossible to manufacture as they have disconnected regions or “islands” of solid material (ISM) that are not self-supporting. Additionally, designs with enclosed void space (EVS) are problematic for additive manufacturing (AM) since support material or pre-sintered powder cannot be removed after manufacturing. We present a series of constraints that may be incorporated into any TO framework to ensure structures are self-supporting without enclosed voids. Additionally, we employ homogenization-based constraints that allow the designer to tune the elastic stiffness and isotropy of the optimized design. The proposed constraints are evaluated on example microstructures and utilized in a simple optimization test problem to highlight their abilities and limitations so that guidelines for appropriate combinations of constraints may be proposed. Effective constraint combinations are demonstrated on the design of 3D photonic crystals for maximum bandgap subject to manufacturing and stiffness constraints.

42 ENGINEERING↗

The Fundamental Solution and Its Role in the Optimal Control of Infinite Dimensional Neutral Systems

In this work, we shall consider standard optimal control problems for a class of neutral functional differential equations in Banach spaces. As the basis of a systematic theory of neutral models, the fundamental solution is constructed and a variation of constants formula of mild solutions is established. We introduce a class of neutral resolvents and show that the Laplace transform of the fundamental solution is its neutral resolvent operator. Necessary conditions in terms of the solutions of neutral adjoint systems are established to deal with the fixed time integral convex cost problem of optimality. Based on optimality conditions, the maximum principle for time varying control domain is presented. Finally, the time optimal control problem to a target set is investigated.

97 MATHEMATICS AND COMPUTING↗

A Planning Problem Combining Calculus of Variations and Optimal Transport

We consider some variants of the classical optimal transport where not only one optimizes over couplings between some variables x and y but also over some control variables governing the evolutions of these variables with time. Such a situation is motivated by an assignment problem of tasks with workers whose characteristics can evolve with time (and be controlled). We distinguish between the coupled and decoupled case. The coupled case is a standard optimal transport with the value of some optimal control problem as cost. The decoupled case is more involved since it is nonlinear in the transport plan.

97 MATHEMATICS AND COMPUTING↗

Optimal Control of the Obstacle Problem in a Perforated Domain

We study the problem of optimally controlling the solution of the obstacle problem in a domain perforated by small periodically distributed holes. The solution is controlled by the choice of a perforated obstacle which is to be chosen in such a fashion that the solution is close to a given profile and the obstacle is not too irregular. We prove existence, uniqueness and stability of an optimal obstacle and derive necessary and sufficient conditions for optimality. When the number of holes increase indefinitely we determine the limit of the sequence of optimal obstacles and solutions. This limit depends strongly on the rate at which the size of the holes shrink.

97 MATHEMATICS AND COMPUTING↗

A Deep Quench Approach to the Optimal Control of an Allen–Cahn Equation with Dynamic Boundary Conditions and Double Obstacles

In this paper, we investigate optimal control problems for Allen-Cahn variational inequalities with a dynamic boundary condition involving double obstacle potentials and the Laplace-Beltrami operator. The approach covers both the cases of distributed controls and of boundary controls. The cost functional is of standard tracking type, and box constraints for the controls are prescribed. We prove existence of optimal controls and derive first-order necessary conditions of optimality. The general strategy is the following: we use the results that were recently established by two of the authors for the case of (differentiable) logarithmic potentials and perform a so-called “deep quench limit”. Using compactness and monotonicity arguments, it is shown that this strategy leads to the desired first-order necessary optimality conditions for the case of (non-differentiable) double obstacle potentials.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗