Smarter Horizontal Single Axis Tracking Using Optimal Positioning Algorithms
PVSC 52 publication on algorithms for single axis tracking
Byford, Brandon Kyle↗
SEARCH · Search NASA
Results for “Optimization algorithm”
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.
Fast algorithms for optimal data acquisition in PDE-constrained optimization problems
Explore the source record for details and available documents.
Madhavan, Madhusudan [Sandia National Laboratories↗
A scalable algorithm for the optimization of neural network architectures
In this work, we propose a new scalable method to optimize the architecture of an artificial neural network. The proposed algorithm, called Greedy Search for Neural Network Architecture, aims to determine a neural network with minimal number of layers that is at least as performant as neural networks of the same structure identified by other hyperparameter search algorithms in terms of accuracy and computational cost. Numerical results performed on benchmark datasets show that, for these datasets, our method outperforms state-of-the-art hyperparameter optimization algorithms in terms of attainable predictive performance by the selected neural network architecture, and time-to-solution for the hyperparameter optimization to complete.
97 MATHEMATICS AND COMPUTING↗
Digital Twin Based Condition Monitoring of LCC-LCC Inductive Power Transfer Systems
Inductive power transfer (IPT) systems provide a flexible, hands-free charging opportunity to electric vehicles (EV). The resonant network components and the transmitter and receiver coils are often subjected to high voltages or currents. Component aging in the compensation network and coils of resonant IPT systems is detrimental to the reliability and power transfer efficiency of the IPT system. Monitoring the component health of such multi-element complex systems requires robust optimization algorithms. This paper discusses condition monitoring of a resonant IPT system for an EV charger using a digital twin model. A hybrid estimation algorithm based on genetic algorithms and adaptive particle swarm optimization is developed to estimate the parameters of the digital twin model. Simulation results are used to verify the monitoring capabilities of the developed algorithm under various operating conditions of the IPT system.
Weldehawaryat, Lidya Mussie [graduate research ass↗
Dynamic optimization and economic evaluation of flexible heat integration in a hybrid concentrated solar power plant
Hybridization of concentrated solar power (CSP) plants provides flexibility in operation that can drastically improve the solar-to-electric (STE) efficiency and levelized cost of electricity (LCOE) relative to standalone CSP plants. Flexible heat integration (FHI) is a novel concept where the collection and integration of CSP within a power plant is modified relative to the amount of solar energy available. FHI improves the thermal efficiency of a hybrid solar tower steam Rankine cycle power plant but leads to increased pumping needs due to continuously elevated molten salt flow rates through the collection system, which can negatively impact STE efficiency. The present work is carried out to maximize the STE efficiency of a hybrid CSP plant utilizing FHI by employing a dynamic optimization framework where a genetic algorithm optimizes the operation of the plant over a given solar irradiance profile. The study concerns a plant hypothetically located in Salt Lake City, Utah. Here, the optimization results confirm the accuracy of a predictive heuristic where the preferred operation of the plant can be estimated relative to local peaks in the incident power generated by the heliostat collection field. The optimized FHI operation demonstrates a yearly STE efficiency of 13.8%, whereas the equivalent base-level hybrid and solar-only plants exhibit solar efficiencies of 13.4% and 11.2%, respectively. Economic analysis shows that FHI reduces yearly natural gas costs, leading to a $\$0.5$/MWh reduction in LCOE relative to the base-level hybrid configuration. Overall, the results show that hybrid FHI schemes exhibit economic benefits along with observed thermodynamic improvements.
14 SOLAR ENERGY↗
A decision support tool for e-waste recycling operations using the hen-and-chicks bio-inspired optimization metaheuristic
E-waste from end-of-life electrical and electronic devices is one of the fastest growing waste streams from households and businesses. E-waste recycling yields environmental sustainability and economic benefits. Due to continuous changes in e-waste types and compositions, recycling businesses face challenges to optimize their operational configuration to achieve better economic and environmental performance. To help e-waste recyclers mitigate this problem, we have developed a modular decision support tool called the Comprehensive Manufacturing Assessment Tool (CMAT) that can simulate both e-waste recycling operations and economics. This tool can give valuable insights regarding the profitability of the entire operation and different e-waste types. In addition, a new bio-inspired metaheuristic optimization algorithm, hen-and-chicks optimization (HACO), was developed to assign manpower to different workstations to maximize operational efficiencies. According to the results of our case study, laptops, desktops, and computer peripherals are the three electronic waste products that produce the most profit. Our examination of the sensitivity of material prices shows that the price of steel has the most significant influence on total profit, because it is the most widely used material in the majority of electronic devices. We have released the decision support tool as open-source software under a general public license. It could be customized for other recycling industries beyond e-waste to achieve business sustainability by making their operations more efficient.
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
LOGOS
LOGOS is a software package which contains a set of discrete optimization models that can be employed for capital budgeting optimization problems. More specifically, provided a set of items (characterized by cost and reward values) and constraints, these models select the best combination of items which maximizes overall reward and satisfies the provided constraints. The developed models are based on different versions of the knapsack optimization algorithms. Two main classes of optimization models have been initially developed: deterministic and stochastic. Stochastic optimization models evolve deterministic models by explicitly considering data uncertainties (associated to constraints or item cost and reward). These models can be employed as stand-alone models or interfaced with the INL developed RAVEN code to propagate data uncertainties and analyze the generated data (i.e., sensitivity analysis).
Wang, Congjian↗
Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems
Quantum computing is a computational paradigm with the potential to outperform classical methods for a variety of problems. Proposed recently, the Quantum Approximate Optimization Algorithm (QAOA) is considered as one of the leading candidates for demonstrating quantum advantage in the near term. QAOA is a variational hybrid quantum-classical algorithm for approximately solving combinatorial optimization problems. The quality of the solution obtained by QAOA for a given problem instance depends on the performance of the classical optimizer used to optimize the variational parameters. In this paper, we formulate the problem of finding optimal QAOA parameters as a learning task in which the knowledge gained from solving training instances can be leveraged to find high-quality solutions for unseen test instances. To this end, we develop two machine-learning-based approaches. Our first approach adopts a reinforcement learning (RL) framework to learn a policy network to optimize QAOA circuits. Our second approach adopts a kernel density estimation (KDE) technique to learn a generative model of optimal QAOA parameters. In both approaches, the training procedure is performed on small-sized problem instances that can be simulated on a classical computer; yet the learned RL policy and the generative model can be used to efficiently solve larger problems. Furthermore, extensive simulations using the IBM Qiskit Aer quantum circuit simulator demonstrate that our proposed RL- and KDE-based approaches reduce the optimality gap by factors up to 30.15 when compared with other commonly used off-the-shelf optimizers.
97 MATHEMATICS AND COMPUTING↗
Crystal Structure Prediction of Binary Alloys via Deep Potential
Predicting crystal structure has been a challenging problem in physics and materials science for a long time. A reliable energy calculation engine combined with an efficient global search algorithm, such as particle swarm optimization algorithm or genetic algorithm, is needed to conduct crystal structure prediction. In recent years, machine learning-based interatomic potential energy surface models have been proposed, potentially allowing us to perform crystal structure prediction for systems with the accuracy of density functional theory (DFT) and the speed of empirical force fields. In this paper, we employ a previously developed Deep Potential model to predict the intermetallic compound of the aluminum–magnesium system, and find six meta-stable phases with negative or nearly zero formation energy. In particular, Mg 12 Al 8 shows excellent ductility and Mg 5 Al 27 has a high Young's modulus. Based on our benchmark results, we propose a relatively robust structure screening criterion that selects potentially stable structures from the Deep Potential-based convex hull and performs DFT refinement. By using this criterion, the computational cost needed to construct the convex hull with ab initio accuracy can be dramatically reduced.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective
An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.
97 MATHEMATICS AND COMPUTING↗
RxnRover/CyRxnOpt
CyRxnOpt aims to provide a single software interface to various optimization algorithms, mainly designed for chemical process optimization applications. CyRxnOpt generalizes the optimization process into four high-level “phases”: Installation, Configuration, Training, and Prediction. This allows developers to program to a general interface for each phase of the optimization, simplifying the development of user-friendly tools to lower the barrier of entry into chemical process optimization, especially for automated laboratory workflows which can greatly benefit from access to various optimization techniques. It is also designed so researchers can easily add new or existing algorithms into existing workflows in a user-friendly manner.
Kulathunga, Dulitha Prasanna [Iowa State Universit↗
Least H 2 norm updating of quadratic interpolation models for derivative-free trust-region algorithms
One particular class of derivative-free optimization algorithms is trust-region algorithms based on quadratic models given by the under-determined interpolation. Different techniques in updating the quadratic model from iteration to iteration will give different interpolation models. We propose a new way to update the quadratic model by minimizing the $H^{2}$ norm of the difference between neighboring quadratic models. The motivation for applying the $H^{2}$ norm is given. The theoretical properties of our new updating technique are also presented. We propose the projection in the sense of $H^{2}$ norm and the interpolation error analysis of our model function. We obtain the coefficients of the quadratic model function using the Karush–Kuhn–Tucker (KKT) conditions. Numerical results show the advantages of our model on the test set considered, and the derivative-free algorithms based on our least $H^{2}$ norm updating quadratic model functions can solve test problems with fewer function evaluations than the algorithm based on the least Frobenius norm updating model and the other compared methods.
derivative-free optimization↗
Red-QAOA: Efficient Variational Optimization through Circuit Reduction
The Quantum Approximate Optimization Algorithm (QAOA) provides a quantum solution for combinatorial optimization problems. However, the optimal parameter searching process of QAOA is greatly affected by noise, leading to non-optimal solutions. This paper introduces a novel approach to optimize QAOA by exploiting the energy landscape concentration of similar instances via graph reduction, thus addressing the effect of noise. We formalize the notion of similar instances in QAOA and develop a Simulated Annealing-based graph reduction algorithm, called Red-QAOA, to identify the most similar subgraph for efficient parameter optimization. Red-QAOA outperforms state-of-the-art Graph Neural Network (GNN) based graph pooling techniques in performance and demonstrates effectiveness on a diverse set of real-world optimization problems encompassing 3200 graphs. Red-QAOA reduced the node counts and edge counts by 28% and 37%, respectively, while maintaining a low mean square error of 2%. These enable the identification of an optimal parameter set that is closer to the ideal true optimal solution in the presence of noise. By substantially streamlining the search for QAOA parameters, our approach sets the stage for the practical application of quantum algorithms in solving complex optimization problems.
Wang, Meng↗
Explainable Neural Architecture Search (XNAS)
Code for the paper Learning Interpretable Models Through Multi-Objective Neural Architecture Search by Zachariah Carmichael, Tim Moon, and Sam Ade Jacobs. Monumental advances in deep learning have led to unprecedented achievements across a multitude of domains. While the performance of deep neural networks is indubitable, the architectural design and interpretability of such models are nontrivial. Research has been introduced to automate the design of neural network architectures through neural architecture search (NAS). Recent progress has made these methods more pragmatic by exploiting distributed computation and novel optimization algorithms. However, there is little work in optimizing architectures for interpretability. To this end, we propose a multiobjective distributed NAS framework that optimizes for both task performance and introspection. We leverage the non-dominated sorting genetic algorithm (NSGA-II) and explainable AI (XAI) techniques to reward architectures that can be better comprehended by humans. The framework is evaluated on several image classification datasets. We demonstrate that jointly optimizing for introspection ability and task error leads to more disentangled architectures that perform within tolerable error.
Carmichael, ZachariahJ↗
Enhancing flexibility for climate change using seasonal energy storage (aquifer thermal energy storage) in distributed energy systems
Long-term energy storage is expected to play a vital role in the deep decarbonization of building energy sectors, while enhancing the flexibility of buildings to withstand future climate variations. However, it is challenging to design distributed multi-energy systems (DMES) while taking into account the uncertainties introduced by climate change, since stochastic optimization of such systems is difficult. The present study introduces a stochastic optimization model to address this bottleneck, taking into account DMES including aquifer thermal energy storage (ATES) as the long-term thermal storage. For the first time, a novel optimization algorithm links ATES with the DMES optimization model with the support of a simplified geotechnical model. Subsequently, a case study was conducted, focusing on a residential district in Chicago where the impact of future climate condition, energy demand, and solar and wind energy potentials were evaluated using Weather Research and Forecasting (WRF) data (up to 2080) and the EnergyPlus model. The study revealed that ATES is an attractive way to improve the renewable energy penetration level and minimize the dependence on fossil fuels with reasonable support from the grid to assist the fluctuations in both demand and generation. Furthermore, ATES notably reduces fuel consumption and dependence while greatly enhancing the flexibility of the energy system to withstand fluctuations in demand and renewable energy generation brought by future climate variations. These qualities will make ATES an important part of distributed energy systems, even though it is not currently the lowest cost alternative due to lack of technology maturity. Furthermore, the design platform introduced in the present study can be used to design DMES enhancing flexibility to accommodate future climate variations.
25 ENERGY STORAGE↗
Feedback Optimization of Incentives for Distribution Grid Services
Energy prices and net power injection limitations regulate the operations in distribution grids and typically ensure that operational constraints are met. Nevertheless, unexpected or prolonged abnormal events could undermine the grid's functioning. During contingencies, customers could contribute effectively to sustaining the network by providing services. Herein this paper proposes an incentive mechanism that promotes users' active participation by essentially altering the energy pricing rule. The incentives are modeled via a linear function whose parameters can be computed by the system operator (SO) by solving an optimization problem. Feedback-based optimization algorithms are then proposed to seek optimal incentives by leveraging measurements from the grid, even in the case when the SO does not have a full grid and customer information. Numerical simulations on a standard testbed validate the proposed approach.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Harmonized Automatic Relay Mitigation of Nefarious Intentional Events (HARMONIE) - Special Protection Scheme (SPS)
The harmonized automatic relay mitigation of nefarious intentional events (HARMONIE) special protection scheme (SPS) was developed to provide adaptive, cyber-physical response to unpredictable disturbances in the electric grid. The HARMONIE-SPS methodology includes a machine learning classification framework that analyzes real time cyber-physical data and determines if the system is in normal conditions, cyber disturbance, physical disturbance, or cyber-physical disturbance. This classification then informs response, if needed and/or suitable, and included cyber-physical corrective actions. Beyond standard power system mitigations, a few novel approaches were developed that included a consensus algorithm-based relay voting scheme, an automated power system triggering condition and corrective action pairing algorithm, and a cyber traffic routing optimization algorithm. Both the classification and response techniques were tested within a newly integrated emulation environment composed of a real-time digital simulator (RTDS) and SCEPTRE™. This report details the HARMONIE-SPS methodology, highlighting both the classification and response techniques, and the subsequent testing results from the emulation environment.
24 POWER TRANSMISSION AND DISTRIBUTION↗
Optimized Test Section for Helium Flow Loop Experiment
Phase 3 of this project uses the knowledge and techniques gained from Phase 1 and Phase 2. The first outcome of Phase 3 is a new test section which can be manufactured and tested in the Helium Flow Loop Experiment to verify the results of the optimization study. The second outcome of Phase 3 is analyzing the features of this design and determining its performance under simulated TBM conditions: heat flux, pressure, mass flow rate, one-sided and volumetric heating. This will be accomplished by first using the results from the Phase 1 analyses and then applying the optimization strategy from Phase This phase uses the STAR-CCM+ Design Manager tool to apply the optimization strategy to the Helium Flow Loop Experiment (HFLE). The optimization algorithm used by the Design Manager tool is Simultaneous Hybrid Exploration that is Robust, Progressive, and Adaptive (SHERPA search algorithm). In addition to demonstrating the optimization features, a simple parameter sweep is also included in this phase. This report details the applied single objective optimization.
42 ENGINEERING↗