Search NASA⌕ Search

SEARCH · Search NASA

Results for “discrete 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 145 records · Page 8

Route Optimization for Energy Efficient Airport Shuttle Operations - A Case Study from Dallas Fort Worth International Airport

Air travel and requisite surface traffic supporting passenger arrival/departure constitutes a significant portion of travel and emissions in cities with large airports. An airport trip can segment into three parts namely: i) travel from a location in the city to the airport; ii) travel from a parking lot or rental car center to the terminal (i.e., within the airport premises), and iii) travel inside the terminal. Depending on the airport access mode all or a part of these legs comprise a traveler’s journey to the airport. The priority of airport ground transport management teams is to provide passengers with a seamless travel experience within the airport, so it is understandable that within airport shuttle routes might not be optimized for minimizing energy consumption. Solutions that meet the dual objective of reducing energy consumption from airport shuttle operations without compromising on passenger travel experience are key to improving system efficiency. There is currently a dearth of research and tools that can inform airports in making such decisions. Addressing this need, this research effort puts forth an optimization model that generates optimal shuttle routes for a given set of constraints, and a discrete-event simulator that evaluates the optimal solutions in a stochastic environment to understand the tradeoffs between passenger wait times, and within airport shuttle energy consumption. The proposed set of tools are tested in the context of optimizing airport shuttles routes within the Dallas Fort Worth International Airport (DFW). In addition to shuttle spatial positioning, and passenger demand information, high-fidelity vehicle data was collected using data loggers installed on DFW shuttles. Results show that 20% energy reduction in shuttle operations is possible with a modest two-minute increase in average passenger wait times. The tools developed in this research effort are designed to be generalizable and can help optimize shuttle operations planning at any major airport.

air travel↗

Introduction to Mixed Variable Optimization (MVO) [Slides]

Mixed Variable Optimization (MVO) is an optimization method that uses discrete (categorical) and continuous variables in its optimization process. This method of optimization is applicable to highly nonlinear problems where the information used in the optimization is of poor quality of has minor inaccuracies in the data sets.

97 MATHEMATICS AND COMPUTING↗

Two Dimensional Topology Optimization of Heat Exchangers with the Density and Level-Set Methods

We design heat exchangers using two topology optimization approaches: the density, i.e. volume fraction and level set methods. Our goal is to maximize the heat exchange between two fluids in separate channels while constraining the pressure drop across each channel. The heat exchanger is modeled with a coupled thermal-flow formulation. The flow is governed by an isothermal and incompressible Stokes-Brinkman equation and the heat transfer is governed by a convection-diffusion equation with high Peclet number. We solve one set of Stokes-Brinkman equations per fluid. Each Brinkman term in the flow equation serves to model the other phase as a solid, thereby preventing mixing. We first represent the solid and fluid phases using a volume fraction variable and apply a SIMP-like penalization in the Brinkman term to drive the optimization to a discrete design. The cost and constraint function derivatives are automatically calculated with the library pyadjoint and the optimization is performed by the Method of Moving Asymptotes. In a second optimization formulation, we use the level set approach to define the interface that separates the two fluids. Pyadjoint calculates the shape derivatives of the cost and constraint functions and the Hamilton-Jacobi advects the interface, allowing for topological changes. We present results in two dimensions and discuss the advantages and disadvantages of each approach.

42 ENGINEERING↗

Multigrid preconditioning of linear systems for semi-smooth Newton methods applied to optimization problems constrained by smoothing operators

This article is concerned here with the question of constructing efficient multigrid preconditioners for the linear systems arising when applying semi-smooth Newton methods to large-scale linear-quadratic optimization problems constrained by smoothing operators with box-constraints on the controls. It is shown that, for certain discretizations of the optimization problem, the linear systems to be solved at each semi-smooth Newton iteration reduce to inverting principal minors of the Hessian of the associated unconstrained problem. As in the case when box-constraints on the controls are absent, the multigrid preconditioner introduced here is shown to increase in quality as the mesh-size decreases, resulting in a number of iterations that decreases with mesh-size. However, unlike the unconstrained case, the spectral distance between the preconditioners and the Hessian is shown to be of suboptimal order in general.

97 MATHEMATICS AND COMPUTING↗

Multipoint Aerostructural Optimization of Wind Turbine Rotors Using a Coupled Blade‐Resolved Aerostructural Solver

Physics‐based design optimization workflows thread the needle between computational cost limitations and simulation complexity, often compromising between modeling detail and the range of operating design conditions. Multipoint aerostructural optimization of wind turbine rotors has so far been confined to low‐fidelity analyses or to high‐fidelity studies with simplified structural models, leaving the most complex design trade‐offs unexplored. We close this gap by performing the first tightly coupled gradient‐based multipoint aerostructural rotor optimization using 3D aerodynamic and structural solvers with discrete coupled adjoints. The optimizer simultaneously varies blade planform, airfoil shapes, and structural thickness through more than 270 design variables, minimizing a weighted combination of rotor mass and power across multiple wind speeds. Applied to a modified DTU 10‐MW benchmark under conservative structural and aerodynamic constraints, our multipoint optimization reduces rotor mass by up to 36% and increases power by 12%–15% across the main operating conditions; biasing the objective toward power yields power gains up to 18% and a 17% mass reduction. For a nominal wind distribution, 3‐point rotor designs accounting for low RPM and high thrust conditions capture dominant trade‐offs and outperform single‐point designs. Adding two off‐design points changes individual‐condition power by less than 3% but leaves the weighted average within 0.5%, and the mass‐power bias has a stronger effect on the final design than the operating‐point weighting itself. Our framework extends naturally to richer load cases and site‐specific wind distributions, providing a basis for high‐fidelity multipoint design earlier in industrial workflows.

17 WIND ENERGY↗

A Full Multigrid Method for the Self-Adjoint Angular Flux Equation Based on Cellwise Block Jacobi Iteration

Previous work by Densmore et al. has demonstrated that multigrid methods for the self-adjoint angular flux (SAAF) equation with cellwise block Jacobi smoothing can be extremely effective at solving for the angular flux in one dimension. The extension of that work to two dimensions demonstrated that while the smoother works well, the use of a direct coarse-grid approximation can severely limit the rate of convergence for optically thin cells. In that paper, this convergence limit was evaded through the use of a partially Galerkin coarse-grid approximation. However, relying on a Galerkin coarse-grid approximation is not ideal as constructing the coarse-grid discretization in this approach is complicated. The motivation for this summary is to find a method that can work without the need for a Galerkin coarse-grid approximation. The Full Multigrid (FMG) method is well known as a method that can theoretically solve a problem to its discretization accuracy with optimal linear computational complexity, that is in just O(N) operations for N unknowns. Indeed, we develop an FMG method for the 2-D SAAF equation that yields discretization accuracy and does not require the use of a Galerkin coarse-grid approximation. Until recently, aside from proofs about the order of the error for FMG, little work had been done in quantifying when and how FMG can obtain discretization accuracy. However, recent work by Rodrigo et al. has introduced a Fourier analysis technique called worst-case right-hand side analysis used to calculate the FMG accuracy measure. The FMG accuracy measure is the upper bound on the constant of proportionality between the error of the FMG solution and the discretization error. In this summary, we develop and implement an FMG method for the 2-D Cartesian SAAF equations. We then perform worst-case right-hand side analysis and give numerical examples that demonstrate under what circumstances the method can solve the 2-D SAAF equations to discretization accuracy, for optically thin cells, without the need for a Galerkin coarse-grid approximation. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

$\mathrm{IH}$-$\mathrm{GAN}$: A conditional generative model for implicit surface-based inverse design of cellular structures

Variable-density cellular structures can overcome connectivity and manufacturability issues of topologically optimized structures, particularly those represented as discrete density maps. However, the optimization of such cellular structures is challenging due to the multiscale design problem. Past work addressing this problem generally either only optimizes the volume fraction of single-type unit cells but ignoring the effects of unit cell geometry on properties, or considers the geometry–property relation but builds this relation via heuristics. In contrast, we propose a simple yet more principled way to accurately model the property to geometry mapping using a conditional deep generative model, named Inverse Homogenization Generative Adversarial Network (IH-GAN). It learns the conditional distribution of unit cell geometries given properties and can realize the one-to-many mapping from properties to geometries. Here we further reduce the complexity of IH-GAN by using the implicit function parameterization to represent unit cell geometries. Results show that our method can 1) generate various unit cells that satisfy given material properties with high accuracy (R 2 -scores between target properties and properties of generated unit cells >98%) and 2) improve the optimized structural performance over the conventional variable-density single-type structure. In the minimum compliance example, our IH-GAN generated structure achieves a 79.7% reduction in concentrated stress and an extra 3.03% reduction in displacement. In the target deformation examples, our IH-GAN generated structure reduces the target matching error by 86.4% and 79.6% for two test cases, respectively. We also demonstrated that the connectivity issue for multi-type unit cells can be solved by transition layer blending.

42 ENGINEERING↗

Model Predictive Control of Discrete-Continuous Energy Systems via Generalized Disjunctive Programming

Generalized Disjunctive Programming (GDP) provides an alternative framework to model optimization problems with both discrete and continuous variables. The key idea behind GDP involves the use of logical disjunctions to represent discrete decisions in the continuous space, and logical propositions to denote algebraic constraints in the discrete space. Compared to traditional mixed-integer programming (MIP), the inherent logic structure in GDP yields tighter relaxations that are exploited by global branch and bound algorithms to improve solution quality. In this paper, we present a general GDP model for optimal control of hybrid systems that exhibit both discrete and continuous dynamics. Specifically, we use GDP to formulate a model predictive control (MPC) model for piecewise-affine systems with implicit switching logic. As an example, the GDP-based MPC approach is used as a supervisory control to improve energy efficiency in residential buildings with binary on/off, relay-based thermostats. A simulation study is used to demonstrate the validity of the proposed approach, and the improved solution quality compared to existing MIPbased control approaches.

Bhattacharya, Arnab↗

Optimization of the artificial viscosity in Lagrangian staggered discretization codes. Modeling 1D stand-alone shock - case study

We have developed new measures of errors for numerical shock. The new approach is based on analysis of the structure function, and separation of the errors related to oscillations and shock width, which also include error in the position of the ”center” of the numerical shock. We have demonstrated that those measures correctly characterize the numerical solution. We introduced an objective function in, which both types of errors are weighted, and presented optimal values of the coefficients of the linear and quadratic viscosity for different weights and different Mach numbers.

97 MATHEMATICS AND COMPUTING↗

Optimal design of acoustic metamaterial cloaks under uncertainty

In this work, we consider the problem of optimal design of an acoustic cloak under uncertainty and develop scalable approximation and optimization methods to solve this problem. The design variable is taken as an infinite-dimensional spatially-varying field that represents the material property, while an additive infinite-dimensional random field represents the variability of the material property or the manufacturing error. Discretization of this optimal design problem results in high-dimensional design variables and uncertain parameters. To solve this problem, we develop a computational approach based on a Taylor approximation and an approximate Newton method for optimization, which is based on a Hessian derived at the mean of the random field. We show our approach is scalable with respect to the dimension of both the design variables and uncertain parameters, in the sense that the necessary number of acoustic wave propagations is essentially independent of these dimensions, for numerical experiments with up to one million design variables and half a million uncertain parameters. Additionally, we demonstrate that, using our computational approach, an optimal design of the acoustic cloak that is robust to material uncertainty is achieved in a tractable manner. The optimal design under uncertainty problem is posed and solved for the classical circular obstacle surrounded by a ring-shaped cloaking region, subjected to both a single-direction single-frequency incident wave and multiple-direction multiple-frequency incident waves. Finally, we apply the method to a deterministic large-scale optimal cloaking problem with complex geometry, to demonstrate that the approximate Newton method’s Hessian computation is viable for large, complex problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Adaptive Sampling-Based Bi-Fidelity Stochastic Trust Region Method for Stochastic Derivative-Free Optimization

Bi-fidelity stochastic optimization has gained increasing attention as an efficient approach to reduce computational costs by leveraging a low-fidelity (LF) model to optimize an expensive high-fidelity (HF) objective. In this paper, we propose ASTRO-BFDF, an adaptive sampling trust-region method specifically designed for unconstrained bi-fidelity stochastic derivative-free optimization problems. In ASTRO-BFDF, the LF function serves two purposes: (i) to identify better iterates for the HF function when the optimization process indicates a high correlation between them and (ii) to reduce the variance of the HF function estimates using bi-fidelity Monte Carlo (BFMC). The algorithm dynamically determines sample sizes while adaptively choosing between crude Monte Carlo and BFMC to balance the trade-off between optimization and sampling errors. We prove that the iterates generated by ASTRO-BFDF converge to a first-order stationary point almost surely. Additionally, we demonstrate the effectiveness of the proposed algorithm through numerical experiments on synthetic benchmarks and simulation optimization problems involving discrete event systems.

97 MATHEMATICS AND COMPUTING↗

High-bandwidth image-based predictive laser stabilization via optimized Fourier filters

Controlling the delivery of kHz-class pulsed lasers is of interest in a variety of industrial and scientific applications, from next-generation laser-plasma acceleration to laser-based x-ray emission and high-precision manufacturing. The transverse position of the laser pulse train on the application target is often subject to fluctuations by external drivers (e.g., room cooling and heating systems, motorized optics stages and mounts, vacuum systems, chillers, and/or ground vibrations). For typical situations where the disturbance spectrum exhibits discrete peaks on top of a broad-bandwidth lower-frequency background, traditional PID (proportional-integral-derivative) controllers may struggle, since as a general rule PID controllers can be used to suppress vibrations up to only about 5%–10% of the sampling frequency. Here, a predictive feed-forward algorithm is presented that significantly enhances the stabilization bandwidth in such laser systems (up to the Nyquist limit at half the sampling frequency) by online identification and filtering of one or a few discrete frequencies using optimized Fourier filters. Furthermore, the system architecture demonstrated here uses off-the-shelf CMOS cameras and piezo-electric actuated mirrors connected to a standard PC to process the alignment images and implement the algorithm. To avoid high-end, high-cost components, a machine-learning-based model of the piezo mirror’s dynamics was integrated into the system, which enables high-precision positioning by compensating for hysteresis and other hardware-induced effects. A successful demonstration of the method was performed on a 1 kHz laser pulse train, where externally-induced vibrations of up to 400 Hz were attenuated by a factor of five, far exceeding what could be done with a standard PID scheme.

Natal, Joseph↗

Fast yaw optimization for wind plant wake steering using Boolean yaw angles

Abstract. In wind plants, turbines can be yawed into the wind to steer their wakes away from downstream turbines and achieve an overall increase in plant power. Mathematical optimization is typically used to determine the best yaw angles at which to operate the turbines in a plant. In this paper, we present a new heuristic to rapidly determine the yaw angles in a wind plant. In this method, we define the turbine yaw angles as Boolean – either yawed at a predefined angle or nonyawed – as opposed to the typical methods of defining yaw angles as continuous or with fine discretizations. We then optimize which turbines should be yawed with an algorithm that sweeps through the turbines from the most upstream to the most downstream. We demonstrate that our new Boolean optimization method can find turbine yaw angles that perform well compared to a traditionally used gradient-based optimizer for which the yaw angles are defined as continuous. There is less than 0.6 % difference in the optimized power between the two optimization methods for randomly placed turbine layouts and less than a 0.6 % difference in the optimal annual energy production between the two optimization methods for a real wind farm. Additionally, we show that our new method is much more computationally efficient than the traditional method. For plants with nonzero optimal yaw angles, our new method is generally able to solve for the turbine yaw angles 50–150 times faster, and in some extreme cases up to 500 times faster, than the traditional method.

17 WIND ENERGY↗

Identification of parameters of discrete-continuous models

In the paper, the parameters of a discrete-continuous model have been identified on the basis of experimental investigations and formulation of optimization problem. The discrete-continuous model represents a cantilever stepped Timoshenko beam. The mathematical model has been formulated and solved according to the Lagrange multiplier formalism. Optimization has been based on the genetic algorithm. The presented proceeding’s stages make the identification of any parameters of discrete-continuous systems possible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗