A Multi-Objective Evolutionary Algorithm Approach for Optimizing Part Quality Aware Assembly Job Shop Scheduling Problems
Explore the source record for details and available documents.
Prince, Michael↗
SEARCH · Search NASA
Results for “Optimization algorithms”
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.
Implementing a projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs.
Abstract not provided.
Punla-Green, She'ifa↗
ARPA-e Grid Optimization Competition: Benchmark Algorithm Overview
Explore the source record for details and available documents.
Energy Sciences↗
Leveraging Machine Learning Algorithms for Efficient Optimization
Explore the source record for details and available documents.
Engineering - Aeronautics, Mathematics and Computi↗
Next-Generation Optimization under Uncertainty: Structure-Oriented Algorithms
With the advent of the smart grid, renewable technologies, and carbon emission programs, a key concern is the coordination of national infrastructures such as the electricity, natural gas, and water supply network systems. Anticipating and mitigating uncertainty of weather, demands, and contingencies in a more integrated environment is necessary to maximize resource efficiency and prevent cascading failures that can ultimately lead to catastrophic shortages of supplies. This project developed scalable algorithms for stochastic optimization capable of addressing extreme-scale problems (motivated by challenges in the design and operation of national infrastructures). Specifically, the project developed a new family of algorithms to solve continuous stochastic problems to local and global optimality as well as algorithms to solve mixed-integer convex and nonconvex stochastic programs. We developed supporting local and global convergence theory for these algorithms and implemented the algorithms in open-source software packages that can leverage high-performance computing architectures.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Optimization and Prediction of Spectral Response of Metasurfaces Using Artificial Intelligence
Hot-electron generation has been a topic of intense research for decades for numerous applications ranging from photodetection and photochemistry to biosensing. Recently, the technique of hot-electron generation using non-radiative decay of surface plasmons excited by metallic nanoantennas, or meta-atoms, in a metasurface has attracted attention. These metasurfaces can be designed with thicknesses on the order of the hot-electron diffusion length. The plasmonic resonances of these ultrathin metasurfaces can be tailored by changing the shape and size of the meta-atoms. One of the fundamental mechanisms leading to generation of hot-electrons in such systems is optical absorption, therefore, optimization of absorption is a key step in enhancing the performance of any metasurface based hot-electron device. Here we utilized an artificial intelligence-based approach, the genetic algorithm, to optimize absorption spectra of plasmonic metasurfaces. Using genetic algorithm optimization strategies, we designed a polarization insensitive plasmonic metasurface with 90% absorption at 1550 nm that does not require an optically thick ground plane. We fabricated and optically characterized the metasurface and our experimental results agree with simulations. Finally, we present a convolutional neural network that can predict the absorption spectra of metasurfaces never seen by the network, thereby eliminating the need for computationally expensive simulations. Our results suggest a new direction for optimizing hot-electron based photodetectors and sensors.
77 NANOSCIENCE AND NANOTECHNOLOGY↗
Inexact Newton-CG algorithms with complexity guarantees
Abstract We consider variants of a recently developed Newton-CG algorithm for nonconvex problems (Royer, C. W. & Wright, S. J. (2018) Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477) in which inexact estimates of the gradient and the Hessian information are used for various steps. Under certain conditions on the inexactness measures, we derive iteration complexity bounds for achieving $\epsilon $-approximate second-order optimality that match best-known lower bounds. Our inexactness condition on the gradient is adaptive, allowing for crude accuracy in regions with large gradients. We describe two variants of our approach, one in which the step size along the computed search direction is chosen adaptively, and another in which the step size is pre-defined. To obtain second-order optimality, our algorithms will make use of a negative curvature direction on some steps. These directions can be obtained, with high probability, using the randomized Lanczos algorithm. In this sense, all of our results hold with high probability over the run of the algorithm. We evaluate the performance of our proposed algorithms empirically on several machine learning models. Our approach is a first attempt to introduce inexact Hessian and/or gradient information into the Newton-CG algorithm of Royer & Wright (2018, Complexity analysis of second-order line-search algorithms for smooth nonconvex optimization. SIAM J. Optim., 28, 1448–1477).
Mathematics↗
Fast tensor disentangling algorithm
Many recent tensor network algorithms apply unitary operators to parts of a tensor network in order to reduce entanglement. However, many of the previously used iterative algorithms to minimize entanglement can be slow. We introduce an approximate, fast, and simple algorithm to optimize disentangling unitary tensors. Our algorithm is asymptotically faster than previous iterative algorithms and often results in a residual entanglement entropy that is within 10 to 40% of the minimum. For certain input tensors, our algorithm returns an optimal solution. When disentangling order-4 tensors with equal bond dimensions, our algorithm achieves an entanglement spectrum where nearly half of the singular values are zero. We further validate our algorithm by showing that it can efficiently disentangle random 1D states of qubits.
Slagle, Kevin↗
sbovqaopt: Surrogate-based optimizer for variational quantum algorithms v.0.1.0
SAND2022-13232 O The sbovqaopt package provides a surrogate-based optimizer for variational quantum algorithms as introduced in the journal publication of the same title. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.
SciDAC↗
A Quantum-Inspired Tensor Network Algorithm for Constrained Combinatorial Optimization Problems
Combinatorial optimization is of general interest for both theoretical study and real-world applications. Fast-developing quantum algorithms provide a different perspective on solving combinatorial optimization problems. In this paper, we propose a quantum-inspired tensor-network-based algorithm for general locally constrained combinatorial optimization problems. Our algorithm constructs a Hamiltonian for the problem of interest, effectively mapping it to a quantum problem, then encodes the constraints directly into a tensor network state and solves the optimal solution by evolving the system to the ground state of the Hamiltonian. We demonstrate our algorithm with the open-pit mining problem, which results in a quadratic asymptotic time complexity. Our numerical results show the effectiveness of this construction and potential applications in further studies for general combinatorial optimization problems.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
A class of customized proximal point algorithms for linearly constrained convex optimization
In this paper, we propose a class of customized proximal point algorithms for linearly constrained convex optimization problems. The algorithms are implementable, provided that the proximal operator of the objective function is easy to evaluate. We show that, with special setting of the algorithmic scalar, our algorithms contain the customized proximal point algorithm (He et al., Optim Appl 56:559–572, 2013), the linearized augmented Lagrangian method (Yang and Yuan, Math Comput 82:301–329, 2013), the Bregman Operator Splitting algorithm (Zhang et al., SIAM J Imaging Sci 3:253–276, 2010) as special cases. The global convergence and worst-case convergence rate measured by the iteration complexity are established for the proposed algorithms. Numerical results demonstrate that the algorithms work well for a wide range of the scalar.
97 MATHEMATICS AND COMPUTING↗
Tools for analysis of optimization models
The software is code for analyzing, debugging, and solving optimization models. The code implements several algorithms and provides convenient APIs to apply these algorithms to optimization models. The algorithms are primarily based on graph theory. They compute well-known partitions of graphs, and use these partitions to provide the user information about their optimization model, including diagnosing certain types of structural modeling errors. Some algorithms may be used as a subroutine to solve an optimization problem, and may call an optimization solver to facilitate this. Well-known linear algebra routines are called to provide further diagnostics. The software contains no data and no models other than toy models used for testing.
Parker, Robert↗
Improvement of machine learning enhanced genetic algorithm for nonlinear beam dynamics optimization
On top of the genetic algorithm enhanced by machine learning for nonlinear lattice optimization, as proposed in Li et al. (2018), an improved repopulation technique has been developed. Different weight coefficients for defining the “elite cluster” were compared to discern the fastest convergence in two classic optimization test problems. Additonally, the volume of the parameter space for generating potentially competitive candidates was further confined by repopulation in the vicinity of randomly selected “elite seeds”. The new repopulation technique significantly improves the quality of newly populated candidates by excluding the less competitive seeds introduced by the old repopulation algorithm. Finally, this technique has been validated, having a faster convergence for test problems first, and then applied to the nonlinear lattice optimization for the High Energy Photon Source storage ring.
36 MATERIALS SCIENCE↗
Per-Phase and 3-Phase Optimal Coordination of Directional Overcurrent Relays Using Genetic Algorithm
Penetration of the power grid by renewable energy sources, distributed storage, and distributed generators is becoming increasingly common. Increased utilization of these distributed energy resources (DERs) has given rise to additional protection coordination concerns, particularly where they are utilized in an unbalanced manner or where loading among phases is unbalanced. Digital relays such as the SEL-751 (produced by Schweitzer Engineering Laboratories, Pullman, WA, USA) series have the capability of being set on a per-phase basis. This capability is underutilized in common practice. Additionally, in optimization algorithms for determining relay settings, the time-overcurrent characteristics (TOCs) of relays are generally not treated as variables and are assigned before running the optimization algorithm. In this paper, TOC options themselves are treated as discrete variables to be considered in the optimization algorithm. A mixed integer nonlinear programming problem (MINLP) is set up where the goal is to minimize relay operating times. A genetic algorithm (GA) approach is implemented in MATLAB where two cases are considered. In the first case, the TOC and Time dial setting (TDS) of each relay is set on a three-phase basis. In the second case, per-phase settings are considered. Relay TDSs and TOCs are both considered as simultaneous discrete control variables. Despite the stochastic nature of using per-phase settings for unbalanced systems is found to generally allow for shorter operating times. However, for relatively balanced systems, it is best to use three-phase settings if computation time is of importance.
Matthews, Ronald C.↗
Case Study: Hybrid Carbon Conversion Using Low-Carbon Energy Sources in Coal-Producing States
The demand for more carbon efficient power sources and a decrease in natural gas prices has decreased the desire for coal power. This decrease in demand has led to massive job losses in coal mining regions over the past decade. The purpose of this project is to develop a hybrid energy system utilizing both a coal power plant and advanced reactor, which is competitive with natural gas by improving on profitability and decreasing carbon emissions. This report details the problem with a summary of the impact on the coal industry and the availability of renewable energy sources in the Appalachian region. Because of the geography of the region, variable renewable energy sources are not available without significant size and siting restrictions. However, biomass in the form of wood waste is abundant and can be used as a carbon neutral energy source. Combining biomass and coal processing, in addition to thermal power plants, can increase system profits and efficiency by providing peaking power and conversion opportunities for secondary markets. The electric load is based on publicly available demand data from Appalachian Power, which services the western Virginia and southern West Virginia in the Appalachian region. The demand information is combined by service, normalized, and scaled to an average demand of 1000 kW, which will be the basis for sizing the hybrid energy system. A traditional screening curve analysis for a coal plant and advanced reactor shows that the least cost design varies significantly based on the assumed discount rate and capital recovery period. An optimization program to size the design in TEAL based on the load curve gives 10 optimal designs, all with a negative resulting net present value (NPV) and a coal plant capacity of less than 15%. Including profits from selling captured carbon at a flat rate results in a positive NPV; however, the coal capacity factor only increases to about 40%. There are limitations with this optimization as well since the price of CO2 is likely to decrease as more is sold to the conversion market. The suggested design will combine coal power, an advanced reactor, and coal and biomass coprocessing to produce a variety of products that can be sold to the conversion market while increasing system efficiency. The analysis of conversion pathways for coal and biomass reveals that multiple options will need to be included in the analysis to produce the optimal system design. Three systems will be optimized and compared to determine the best design based on the figures of merit of total NPV and cost of carbon avoided. The first system will include a coal power plant and an advanced reactor that will sell electricity to the grid to meet demand and sell captured carbon to the conversion market. The second system adds a high-temperature steam electrolysis plant, which will utilize electricity during times of low demand to produce hydrogen and sell it to the conversion market. The third system adds biomass and coal processing with options for hydrocarbon oils, syngas to be produced for the conversion market, and electricity generation to power components within the system or provide peaking power. This analysis will be based on a new approach that combines traditional screening curve methods with a dispatch algorithm that optimizes the system based on the opportunity cost of different production options. The resulting optimization algorithm should provide results with less processing time than HERON’s decision tree method. The results from this analysis will determine an optimal design and reinforce the benefits of coal power when used in a hybrid energy system. The initial results show that the addition of a secondary market for carbon sales could result in a positive NPV and increases the capacity factor of the coal plant as compared to a design with only sales to the electricity market. The addition of more markets and additional coal consumption from biomass coprocessing could increase NPV further, replace carbon in other markets through the sale of biomass-derived hydrocarbons, and demonstrate the value of coal power technology.
01 COAL, LIGNITE, AND PEAT↗
Optimization of Thermal Conductance at Interfaces Using Machine Learning Algorithms
We report optimization of thermal transport across the interface of two different materials is critical to micro-/nanoscale electronic, photonic, and phononic devices. Although several examples of compositional intermixing at the interfaces having a positive effect on interfacial thermal conductance (ITC) have been reported, an optimum arrangement has not yet been determined because of the large number of potential atomic configurations and the significant computational cost of evaluation. On the other hand, computation-driven materials design efforts are rising in popularity and importance. Yet, the scalability and transferability of machine learning models remain as challenges in creating a complete pipeline for the simulation and analysis of large molecular systems. In this work we present a scalable Bayesian optimization framework, which leverages dynamic spawning of jobs through the Message Passing Interface (MPI) to run multiple parallel molecular dynamics simulations within a parent MPI job to optimize heat transfer at the silicon and aluminum (Si/Al) interface. We found a maximum of 50% increase in the ITC when introducing a two-layer intermixed region that consists of a higher percentage of Si. Because of the random nature of the intermixing, the magnitude of increase in the ITC varies. We observed that both homogeneity/heterogeneity of the intermixing and the intrinsic stochastic nature of molecular dynamics simulations account for the variance in ITC.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
An approach of orthogonalization within the Gram–Schmidt algorithm
In this paper we consider the variants of Gram–Schmidt such as Classical Gram–Schmidt and Modified Gram–Schmidt algorithms. It is shown that for problems of dimension more than two the round-off error of operation q{sub 1}{sup T}q{sub 2} has more propagation in both of algorithms. To cure this difficulty we will present an algorithm, namely Optimized Modified Gram–Schmidt algorithm. Numerical examples indicate the accuracy of this algorithm. We show that this method can improve the loss of orthogonality of the orthogonalization in some ill-conditioned cases.
97 MATHEMATICS AND COMPUTING↗
Investigating capacity credit sensitivity to reliability metrics and computational methodologies
Assigning capacity value to renewable energy sources (RES) is a challenge faced in planning their integration with the grid. The difficulties stem from the natural characteristics of variability and intermittency of wind and solar sources. The capacity credit (CC) analysis evaluates the system’s actual power output compared with a constant capacity generator, i.e., conventional generator and determines an effective capacity to use for planning and operation. Herein this paper presents different factors that could affect the CC of a system. Two methods are proposed to determine the CC, namely equivalent firm capacity (EFC) and effective load carrying capability (ELCC). Since these methods are based on satisfying reliability criteria, daily loss of load expectation (LOLE), hourly loss of load (LOLH), and expected energy not served (EENS) have been employed as indices. To obtain the CC value, both methods apply two techniques: traditional and optimization. Genetic algorithm (GA) is the optimization approach used in this paper. Then, this work compares the two techniques and shows the superior performance of the optimization approach. Two hybrid systems, stand-alone (SA) and grid-connected (GC) modes, are proposed and used as case studies. The hybrid systems consist of photovoltaic (PV), wind turbine (WT), and battery energy storage system (BESS). In this work, three different scenarios are used to compare capacity credit: system as a whole, only wind, and no batteries. Finally, sensitivity analysis is carried out to examine the impact of varying the wind speed, solar irradiation, and load. It is demonstrated that the choice of reliability index plays an important role in determining the capacity credit and it is shown that EENS is a more comprehensive and consistent index of reliability.
24 POWER TRANSMISSION AND DISTRIBUTION↗