Search NASA⌕ Search

SEARCH · Search NASA

Results for “optimization problems”

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,009 records · Page 56

srMO-BO-3GP: A sequential regularized multi-objective Bayesian optimization for constrained design applications using an uncertain Pareto classifier

Bayesian optimization (BO) is an efficient and flexible global optimization framework that is applicable to a very wide range of engineering applications. To leverage the capability of the classical BO, many extensions, including multi-objective, multi-fidelity, parallelization, and latent-variable modeling, have been proposed to address the limitations of the classical BO framework. In this work, we propose a novel multi-objective BO formalism, called srMO-BO-3GP, to solve multi-objective optimization problems in a sequential setting. Three different Gaussian processes (GPs) are stacked together, where each of the GPs is assigned with a different task. The first GP is used to approximate a single-objective computed from the multi-objective definition, the second GP is used to learn the unknown constraints, and the third one is used to learn the uncertain Pareto frontier. At each iteration, a multi-objective augmented Tchebycheff function is adopted to convert multi-objective to single-objective, where the regularization with a regularized ridge term is also introduced to smooth the single-objective function. Finally, we couple the third GP along with the classical BO framework to explore the convergence and diversity of the Pareto frontier by the acquisition function for exploitation and exploration. The proposed framework is demonstrated using several numerical benchmark functions, as well as a thermomechanical finite element model for flip-chip package design optimization.

42 ENGINEERING↗

A Contextually Supervised Optimization-Based HVAC Load Disaggregation Methodology

This paper presents a novel contextually supervised optimization-based approach for disaggregating heating, ventilation, and air-conditioning (HVAC) loads using smart meter or Supervisory Control and Data Acquisition data. To disaggregate the load into HVAC loads, large and infrequently used loads (LIUL), and base loads, we formulate an optimization problem to minimize a set of five loss terms, consisting of the reconstruction errors of the overall load profile, the ramp rate losses, and three distinct loss functions linked with the HVAC load, base load, and LIUL, respectively. To enhance accuracy, we incorporate two forms of contextual information into the problem formulation. First, we utilize mutual information to estimate HVAC energy consumption. Second, we employ a base load dictionary to constrain HVAC load estimation errors. The obtained HVAC load profiles are fine-tuned by abnormal ramp detection followed by binary hypothesis testing. Here, the proposed method is developed and tested using sub-metered residential and commercial building data. Simulation results show that the proposed method outperforms existing methods across various data resolutions and load aggregation levels, showing excellent transferability and generalizability.

24 POWER TRANSMISSION AND DISTRIBUTION↗

AutoTG: Reinforcement Learning-Based Symbolic Optimization for AI-Assisted Power Converter Design

Power converters are pervasive in modern electronic component design. They can be found in all electronic devices from household appliances and cellphone chargers to vehicles. Currently, designing new circuit topologies is hard because it requires human expertise based on experience and is difficult to automate. However, artificial-intelligence-assisted design can significantly facilitate the development of new power converters and/or improve the final result. Intelligently designed highly efficient power converters can have a significant effect on many important attributes, such as power efficiency, layout size, cost, heat dissemination, energy requirements, etc. We propose Autonomous Topology Generator (AutoTG), a reinforcement-learning-based framework that generates power converter topology candidates based on user specifications, optimized for user preferences. By modeling power converter design as a symbolic optimization problem, we sequentially sample components in an autoregressive manner until new topologies are formed, providing both the topology specification and the sizing (magnitude of each component parameter) of the proposed power converter. Here, we provide an empirical evaluation and show that AutoTG is able to generate varied high-efficiency topologies within component restrictions based on user input and show that previously unknown topologies can be found for further evaluation.

(AI)-based design↗

Fast and robust strategies for large-scale mixed-integer SCOPF

This project develops scalable, computationally efficient algorithms to solve realistic large-scale power system optimization problems, including systems with more than 8,000 buses, as part of a larger series of competitions run by ARPA-E. These problems are critical because the secure and reliable operation of the power grid is becoming increasingly challenging, especially under conditions of increased uncertainty and variability. The economic feasibility of our methods is high, given that they are purely software-based solutions designed to operate power grids more efficiently. The technical effectiveness balances heuristics and approximations to provide a trade-off between speed and accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗

On the closedness and geometry of tensor network state sets

Tensor network states (TNS) are a powerful approach for the study of strongly correlated quantum matter. The curse of dimensionality is addressed by parametrizing the many-body state in terms of a network of partially contracted tensors. These tensors form a substantially reduced set of effective degrees of freedom. In practical algorithms, functionals like energy expectation values or overlaps are optimized over certain sets of TNS. Concerning algorithmic stability, it is important whether the considered sets are closed because, otherwise, the algorithms may approach a boundary point that is outside the TNS set and tensor elements diverge. Here we discuss the closedness and geometries of TNS sets, and we propose regularizations for optimization problems on non-closed TNS sets. We show that sets of matrix product states (MPS) with open boundary conditions, tree tensor network states, and the multiscale entanglement renormalization ansatz are always closed, whereas sets of translation-invariant MPS with periodic boundary conditions (PBC), heterogeneous MPS with PBC, and projected entangled pair states are generally not closed. The latter is done using explicit examples like the W state, states that we call two-domain states, and fine-grained versions thereof.

97 MATHEMATICS AND COMPUTING↗

Snowflake: A Lightweight Portable Stencil DSL

Stencil computations are not well optimized by general-purpose production compilers and the increased use of multicore, manycore, and accelerator-based systems makes the optimization problem even more challenging. In this paper we present Snowflake, a Domain Specific Language (DSL) for stencils that uses a 'micro-compiler' approach, i.e., small, focused, domain-specific code generators. The approach is similar to that used in image processing stencils, but Snowflake handles the much more complex stencils that arise in scientific computing, including complex boundary conditions, higher-order operators (larger stencils), higher dimensions, variable coefficients, non-unit-stride iteration spaces, and multiple input or output meshes. Snowflake is embedded in the Python language, allowing it to interoperate with popular scientific tools like SciPy and iPython; it also takes advantage of built-in Python libraries for powerful dependence analysis as part of a just-in-time compiler. We demonstrate the power of the Snowflake language and the micro-compiler approach with a complex scientific benchmark, HPGMG, that exercises the generality of stencil support in Snowflake. By generating OpenMP comparable to, and OpenCL within a factor of 2x of hand-optimized HPGMG, Snowflake demonstrates that a micro-compiler can support diverse processor architectures and is performance-competitive whilst preserving a high-level Python implementation.

97 MATHEMATICS AND COMPUTING↗

Quantum annealing algorithms for Boolean tensor networks

Abstract Quantum annealers manufactured by D-Wave Systems, Inc., are computational devices capable of finding high-quality heuristic solutions of NP-hard problems. In this contribution, we explore the potential and effectiveness of such quantum annealers for computing Boolean tensor networks. Tensors offer a natural way to model high-dimensional data commonplace in many scientific fields, and representing a binary tensor as a Boolean tensor network is the task of expressing a tensor containing categorical (i.e., $$\{0, 1\}$$ { 0 , 1 } ) values as a product of low dimensional binary tensors. A Boolean tensor network is computed by Boolean tensor decomposition, and it is usually not exact. The aim of such decomposition is to minimize the given distance measure between the high-dimensional input tensor and the product of lower-dimensional (usually three-dimensional) tensors and matrices representing the tensor network. In this paper, we introduce and analyze three general algorithms for Boolean tensor networks: Tucker, Tensor Train, and Hierarchical Tucker networks. The computation of a Boolean tensor network is reduced to a sequence of Boolean matrix factorizations, which we show can be expressed as a quadratic unconstrained binary optimization problem suitable for solving on a quantum annealer. By using a novel method we introduce called parallel quantum annealing, we demonstrate that Boolean tensor’s with up to millions of elements can be decomposed efficiently using a DWave 2000Q quantum annealer.

97 MATHEMATICS AND COMPUTING↗

Final Scientific/Technical Report

In this work, we have built upon our results from previous DOE funding (DEFG 0204ER25655), where we developed new and more efficient methods for solving certain optimization problems with many inequality constraints. This past work resulted in efficient algorithms (and analysis of their convergence) for linear programming, convex quadratic programming, and the training of support vector machines. The algorithms are based on using constraint reduction in interior point methods: at each iteration we consider only a smaller subset of the inequality constraints, focusing on the constraints that are close enough to be relevant. Surprisingly, we have been able to show theoretically that such algorithms are globally convergent and to demonstrate experimentally that they are much more efficient than standard interior point methods.

97 MATHEMATICS AND COMPUTING↗

Data-driven approach to parameterize SCAN + U for an accurate description of 3 d transition metal oxide thermochemistry

Semilocal density-functional theory (DFT) methods exhibit significant errors for the phase diagrams of transition-metal oxides that are caused by an incorrect description of molecular oxygen and the large self-interaction error in materials with strongly localized electronic orbitals. Empirical and semiempirical corrections based on the DFT + U method can reduce these errors, but the parameterization and validation of the correction terms remains an on-going challenge. Here we develop a systematic methodology to determine the parameters and to statistically assess the results by considering interlinked thermochemical data across a set of transition metal compounds. We consider three interconnected levels of correction terms: (1) a constant oxygen binding correction, (2) Hubbard-U correction, and (3) DFT/DFT + U compatibility correction. The parameterization is expressed as a unified optimization problem. We demonstrate this approach for 3d transition metal oxides, considering a target set of binary and ternary oxides. With a total of 37 measured formation enthalpies taken from the literature, the dataset is augmented by the reaction energies of 1710 unique reactions that were derived from the formation energies by systematic enumeration. To ensure a balanced dataset across the available data, the reactions were grouped by their similarity using clustering and suitably weighted. The parameterization is validated using leave-one-out cross validation (CV), a standard technique for the validation of statistical models. We apply the methodology to the strongly constrained and appropriately normed (SCAN) density functional. Based on the CV score, the error of binary (ternary) oxide formation energies is reduced by 40% (75%) to 0.10 (0.03) eV/atom. A simplified correction scheme that does not involve SCAN/SCAN + U compatibility terms still achieves an error reduction of 30% (25%). The method and tools demonstrated here can be applied to other classes of materials or to parameterize the corrections to optimize DFT + U performance for other target physical properties.

36 MATERIALS SCIENCE↗

A methodology for determining the dynamic exchange of resources in nuclear fuel cycle simulation

We report simulation of the nuclear fuel cycle can be performed using a wide range of techniques and methodologies. Past efforts have focused on specific fuel cycles or reactor technologies. The CYCLUS fuel cycle simulator seeks to separate the design of the simulation from the fuel cycle or technologies of interest. In order to support this separation, a robust supply–demand communication and solution framework is required. Accordingly an agent-based supply-chain framework, the Dynamic Resource Exchange (DRE), has been designed implemented in CYCLUS. It supports the communication of complex resources, namely isotopic compositions of nuclear fuel, between fuel cycle facilities and their managers (e.g., institutions and regions). Instances of supply and demand are defined as an optimization problem and solved for each timestep. Importantly, the DRE allows each agent in the simulation to independently indicate preference for specific trading options in order to meet both physics requirements and satisfy constraints imposed by potential socio-political models. To display the variety of possible simulations that the DRE enables, example scenarios are formulated and described. Important features include key fuel-cycle facility outages, introduction of external recycled fuel sources (similar to the current mixed oxide (MOX) fuel fabrication facility in the United States), and nontrivial interactions between fuel cycles existing in different regions.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Large-Scale Optimization with Linear Equality Constraints Using Reduced Compact Representation

For optimization problems with linear equality constraints, we prove that the (1,1) block of the inverse KKT matrix remains unchanged when projected onto the nullspace of the constraint matrix. In this work, we develop reduced compact representations of the limited-memory inverse BFGS Hessian to compute search directions efficiently when the constraint Jacobian is sparse. Orthogonal projections are implemented by a sparse QR factorization or a preconditioned LSQR iteration. In numerical experiments two proposed trust-region algorithms improve in computation times, often significantly, compared to previous implementations of related algorithms and compared to IPOPT.

97 MATHEMATICS AND COMPUTING↗

Predicting carcinogenicity of diverse chemicals using probabilistic neural network modeling approaches

Robust global models capable of discriminating positive and non-positive carcinogens; and predicting carcinogenic potency of chemicals in rodents were developed. The dataset of 834 structurally diverse chemicals extracted from Carcinogenic Potency Database (CPDB) was used which contained 466 positive and 368 non-positive carcinogens. Twelve non-quantum mechanical molecular descriptors were derived. Structural diversity of the chemicals and nonlinearity in the data were evaluated using Tanimoto similarity index and Brock–Dechert–Scheinkman statistics. Probabilistic neural network (PNN) and generalized regression neural network (GRNN) models were constructed for classification and function optimization problems using the carcinogenicity end point in rat. Validation of the models was performed using the internal and external procedures employing a wide series of statistical checks. PNN constructed using five descriptors rendered classification accuracy of 92.09% in complete rat data. The PNN model rendered classification accuracies of 91.77%, 80.70% and 92.08% in mouse, hamster and pesticide data, respectively. The GRNN constructed with nine descriptors yielded correlation coefficient of 0.896 between the measured and predicted carcinogenic potency with mean squared error (MSE) of 0.44 in complete rat data. The rat carcinogenicity model (GRNN) applied to the mouse and hamster data yielded correlation coefficient and MSE of 0.758, 0.71 and 0.760, 0.46, respectively. The results suggest for wide applicability of the inter-species models in predicting carcinogenic potency of chemicals. Both the PNN and GRNN (inter-species) models constructed here can be useful tools in predicting the carcinogenicity of new chemicals for regulatory purposes. - Graphical abstract: Figure (a) shows classification accuracies (positive and non-positive carcinogens) in rat, mouse, hamster, and pesticide data yielded by optimal PNN model. Figure (b) shows generalization and predictive abilities of the interspecies GRNN model to predict the carcinogenic potency of diverse chemicals. - Highlights: • Global robust models constructed for carcinogenicity prediction of diverse chemicals. • Tanimoto/BDS test revealed structural diversity of chemicals and nonlinearity in data. • PNN/GRNN successfully predicted carcinogenicity/carcinogenic potency of chemicals. • Developed interspecies PNN/GRNN models for carcinogenicity prediction. • Proposed models can be used as tool to predict carcinogenicity of new chemicals.

60 APPLIED LIFE SCIENCES↗

Demand-adaptive Transit Design for Urban Transportation Hubs

In this study, we proposed a novel three-stage framework for planning the optimal demand-adaptive transit (DAT) at urban transportation hubs. Given the potential trip demand and road traffic condition, the proposed framework sequentially generates the optimal set of candidate routes, combines the outgoing routes and incoming routes at the hub, and derives the optimal fleet size and corresponding route frequency under the fixed budget. In particular, we build the route generation algorithm which maximizes passenger demand coverage with travel time deviation constraint. And a heuristic algorithm is further developed which yields near-optimal operation routes for real-time demand. The fleet optimization problem is formulated to minimize the weighted cost of energy savings, operation cost and trip revenue. We conduct comprehensive numerical experiments for planning DAT with electric buses at JFK airport in NYC using NYC taxi and for-hire vehicle trip data and GoogleMap speed data. The results show the superior performance of the proposed route generation algorithm which is able to cover citywide passenger demand with only 61 DAT routes. The results also suggest that the proposed DAT planning framework may serve over 47% of existing taxi and FHV demand by operating 18 routes using the fleet of 62 electric buses.

demand adaptive↗

Deep Reinforcement Learning for Distribution System Operations: A Tutorial and Survey

Here, the rapid evolution of modern electric power distribution systems into complex networks of interconnected active devices, distributed generation (DG), and storage poses increasing difficulties for system operators. The large-scale integration of distributed energy resources (DERs) and the rapid exchange of measurement data via communication networks present major opportunities for advancing grid operations but also introduce greater uncertainty, higher data dimensionality, more complex network and device models, and challenging control and optimization problems. Deep reinforcement learning (DRL) algorithms are promising in addressing these challenges. However, they have not been effectively adapted for power systems applications, requiring extensive customization for implementation and evaluation. This has resulted in reproducibility challenges and a steep learning curve for researchers new to applying DRL algorithms to the power systems domain. To bridge these gaps, this tutorial aims to serve as a valuable resource for researchers interested in exploring learning-based algorithms to operate active power distribution networks. Specifically, this work presents a generalized process for translating sequential decision-making problems in power distribution systems into Markov decision process (MDP) formulations, illustrated through concrete grid service examples. Additionally, we introduce a simple environment design strategy to develop and evaluate example DRL algorithms for distribution system applications, complete with an included code repository to guide users through environment construction.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Freeway Loop Detector Data Reconciliation Based on Vehicle Conservation

Loop detector is the most common source of traffic flow measurements on freeways. Though being a mature technology, loop detector is prone to miscounts even when it is properly deployed and adjusted. If a loop detectors systematically over- or under-counts, the estimation based on vehicle conservation leads to results that are not physically plausible such as negative density or density higher than the jam-density. Here we propose an optimization-based method in which plausible values of accumulation is guaranteed through explicit constraints. Compared to similar methods, the proposed method distinct in the following: (i) the optimization problem is convex therefore leads to shorter computational time; (ii) occupancy is also taken into account in order to estimate upper and lower bounds in the accumulation between stations; (iii) no modifications are required when data from one or multiple lanes are missing. The method is first validated using micro-simulation by disturbing the loop-detector from micro-simulation, applying the method and then comparing the results with the ground truth data. The results show the method is able to capture the average counts almost exactly while providing estimate of density with satisfactory accuracy. The method is also successfully applied in a scenario in which field-data is available.

data reconciliation↗

Benchmarking embedded chain breaking in quantum annealing*

Quantum annealing solves combinatorial optimization problems by finding the energetic ground states of an embedded Hamiltonian. However, quantum annealing dynamics under the embedded Hamiltonian may violate the principles of adiabatic evolution and generate excitations that correspond to errors in the computed solution. Here we empirically benchmark the probability of chain breaks and identify sweet spots for solving a suite of embedded Hamiltonians. We further correlate the physical location of chain breaks in the quantum annealing hardware with the underlying embedding technique and use these localized rates in a tailored post-processing strategies. Our results demonstrate how to use characterization of the quantum annealing hardware to tune the embedded Hamiltonian and remove computational errors.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Optimization under uncertainty of a hybrid waste tire and natural gas feedstock flexible polygeneration system using a decomposition algorithm

Market uncertainties motivate the development of flexible polygeneration systems that are able to adjust operating conditions to favor production of the most profitable product portfolio. However, this operational flexibility comes at the cost of higher capital expenditure. A scenario-based two-stage stochastic nonconvex Mixed-Integer Nonlinear Programming (MINLP) approach lends itself naturally to optimizing these trade-offs. This work studies the optimal design and operation under uncertainty of a hybrid feedstock flexible polygeneration system producing electricity, methanol, dimethyl ether, olefins or liquefied (synthetic) natural gas. A recently developed C++ based software framework (named GOSSIP) is used for modeling the optimization problem as well as its efficient solution using the Nonconvex Generalized Benders Decomposition (NGBD) algorithm. Two different cases are studied: The first uses estimates of the means and variances of the uncertain parameters from historical data, whereas the second assesses the impact of increased uncertain parameter volatility. The value of implementing flexible designs characterized by the value of the stochastic solution (VSS) is in the range of 260–405 M$ for a scale of approximately 893 MW of thermal input. Increased price volatility around the same mean results in higher expected net present value and VSS as operational flexibility allows for asymmetric exploitation of price peaks.

42 ENGINEERING↗

Optimal Demand Response Incorporating Distribution LMP with PV Generation Uncertainty

The utilization of aggregated demand-side flexibility via demand response (DR) has become a promising pathway for the integration of renewable energy resources in power systems. Nowadays, there are several management strategies for DR such as the price-based transactive control strategies. However, many of such existing price-based control strategies neglect the physics and operational constraints of the underlying distribution networks when computing the price, raising concerns regarding their theoretical and practical values. This paper studies this issue and investigates optimal DR (ODR) by incorporating the distribution locational marginal price (DLMP). In particular, we discuss DR in connection with DLMPs and propose a multiperiod bilevel optimization problem to find the ODR strategy. Here, the objective is to minimize the peak load, load fluctuation, and payments of load aggregators. In addition, a robust bilevel ODR model is formulated to provide a robust ODR strategy while minimizing operating costs under the worst-case realization of uncertainties; this mitigates the impact of forecasting errors on renewable energy resources. Then, we propose an efficient solution approach by employing the Karush-Kuhn-Tucker conditions and strong duality. Simulation results are presented to illustrate the mutual impacts of the interaction between DR and DLMP and the benefits of the robust ODR strategy.

24 POWER TRANSMISSION AND DISTRIBUTION↗