Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 469 records · Page 26

Bayesian optimization algorithms for accelerator physics

Accelerator physics relies on numerical algorithms to solve optimization problems in online accelerator control and tasks such as experimental design and model calibration in simulations. The effectiveness of optimization algorithms in discovering ideal solutions for complex challenges with limited resources often determines the problem complexity these methods can address. The accelerator physics community has recognized the advantages of Bayesian optimization algorithms, which leverage statistical surrogate models of objective functions to effectively address complex optimization challenges, especially in the presence of noise during accelerator operation and in resource-intensive physics simulations. In this review article, we offer a conceptual overview of applying Bayesian optimization techniques toward solving optimization problems in accelerator physics. We begin by providing a straightforward explanation of the essential components that make up Bayesian optimization techniques. We then give an overview of current and previous work applying and modifying these techniques to solve accelerator physics challenges. Finally, we explore practical implementation strategies for Bayesian optimization algorithms to maximize their performance, enabling users to effectively address complex optimization challenges in real-time beam control and accelerator design. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗

Dynamic real‐time optimization for a CO 2 capture process

Growing awareness of climate change has led to increased focus on new energy processes that mitigate generation of CO 2 , or provide for its efficient capture. To enable the development of these processes, advanced modeling and optimization platforms have been created. New capabilities among platforms include efficient solution strategies for online optimization problems. For real time, dynamic optimization of CO 2 capture processes, we demonstrate the application of the Python‐based Pyomo platform to facilitate realization of Moving Horizon Estimation and Nonlinear Model Predictive Control, through novel nonlinear optimization and sensitivity strategies. This capability allows large scale, first principle models to be applied for online optimization. Here, we introduce the Control and Adaptation with Predictive Sensitivity Enhancements (CAPRESE) framework to demonstrate this framework for advanced energy processes. Moreover, we present two case studies: profile tracking with detailed tray‐by‐tray distillation models and Bubbling Fluidized Bed reactors for CO 2 capture. © 2018 American Institute of Chemical Engineers AIChE J , 65: e16511 2019

Thierry, David↗

Identifying attributes of CO 2 leakage zones in shallow aquifers using a parametric level set method: Original Research Article: Identifying attributes of CO 2 leakage zones in shallow aquifers using a parametric level set method

Leakage through abandoned wells and geologic faults poses the greatest risk to CO 2 storage permanence. For shallow aquifers, secondary CO 2 plumes emanating from the leak zones may go undetected for a sustained period of time and has the greatest potential to cause large-scale and long-term environmental impacts. Identification of the attributes of leak zones, including their shape, location, and strength, is required for environmental risk assessment. This study applies a parametric level set (PaLS) method to characterize leak zones. Level set methods are appealing for tracking topological changes and recovering unknown shapes of objects. However, level set evolution using the conventional level set methods is computationally challenging. In PaLS, the level set function is approximated by using a weighted sum of basis functions and the level set evolution problem is replaced by an optimization problem. The efficacy of PaLS is demonstrated by reconstructing attributes of a CO 2 leak zone in a carbonate aquifer. Our results show that PaLS is a robust source identification method that can recover the approximate leak zone locations in the presence of measurement errors, model parameter uncertainty, and inaccurate guesses of source flux strengths. Accurate delineation of source geometry is achievable when a relatively dense observation network is used. The PaLS-based, source recovery framework introduced in this work is generic and can be adapted for any reactive transport model by simply switching the pre- and post-processing routines.

54 ENVIRONMENTAL SCIENCES↗

Microgrid Optimal Scheduling With Chance-Constrained Islanding Capability

To facilitate the integration of variable renewable generation and improve the resilience of electricity sup-ply in a microgrid, this paper proposes an optimal scheduling strategy for microgrid operation considering constraints of islanding capability. A new concept, probability of successful islanding (PSI), indicating the probability that a microgrid maintains enough spinning reserve (both up and down) to meet local demand and accommodate local renewable generation after instantaneously islanding from the main grid, is developed. The PSI is formulated as mixed-integer linear program using multi-interval approximation taking into account the probability distributions of forecast errors of wind, PV and load. With the goal of minimizing the total operating cost while preserving user specified PSI, a chance-constrained optimization problem is formulated for the optimal scheduling of mirogrids and solved by mixed integer linear programming (MILP). Numerical simulations on a microgrid consisting of a wind turbine, a PV panel, a fuel cell, a micro-turbine, a diesel generator and a battery demonstrate the effectiveness of the proposed scheduling strategy. Lastly, we verify the relationship between PSI and various factors.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Multiobjective optimization of nuclear microreactor reactivity control system operation with swarm and evolutionary algorithms

To improve the marketability of novel microreactor designs, there is a need for automated and optimal control of these reactors. This paper presents a methodology for performing multiobjective optimization of control drum operation for a microreactor under normal and off-nominal conditions. Here, two different case studies are used where the control drum configuration is optimized for the reactor to be critical with some desired power distribution that would satisfy peaking limits. A surrogate model for power distribution is developed based on a feedforward neural network. The process for determining weights for scalarization of the multiobjective optimization problem is also detailed. Six optimization algorithms: evolutionary strategies, differential evolution, grey wolf optimization, Harris hawks optimization, moth flame optimization and particle swarm optimization, are all applied to these cases and the results analyzed. Although all these algorithms will demonstrate optima-seeking behavior, for real-time control it is necessary to identify the best algorithm to efficiently provide reasonable optima without operator interference. The moth flame optimization algorithm was found to perform particularly well on both cases. Overall, it was found that the algorithms capable of supplying the best optima were also the most consistent. Finally, the found optima were verified with the original model used to train surrogates.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Valuation of Distributed Wind Turbines Providing Multiple Market Services

The role of wind turbines has traditionally been limited to providing energy capacity to the grid, but the availability of smart inverters and recent regulatory changes provide the technical and policy capability for wind turbines to also provide ancillary services. However, in contrast to the technical and policy aspects, the valuation of distributed wind turbines providing such services has not been thoroughly studied. This paper presents an optimal market-participation method for distributed wind turbines and valuates different strategies in California Independent System Operator’s balancing area. The services include energy capacity, regulation up and down, and reserves. An optimization problem is formulated to determine optimal power output for each service and demonstrated using historical data for one complete year. The revenues from multiple services are quantified, and a sensitivity analysis is performed to relate market prices with revenues. It is found that the optimal strategy generates 6% more revenue compared to the revenue from participating in the energy market only. Also, the reduced energy prices in future scenarios increase the relative importance of market participation in ancillary services.

Bhatti, Bilal Ahmad↗

Adaptive building load control to enable high penetration of solar photovoltaic generation

This paper investigates the ability of a collection of deferrable heating, ventilation and air conditioning (HVAC) loads to directly emulate energy storage devices (ESD), that is, to absorb any low frequency fluctuations in solar generation. We find the optimal number of aggregated HVAC loads to absorb solar fluctuation in the same frequency band based on frequency analysis. To guarantee quality of service in afleet of residential buildings, an optimization problem is formed to compute optimal schedule of the HVAC loads considering temperature comfort band and available solar generation. By minimizing the tracking error between solar generation and total consumption, the proposed method also quantifies the minimum capacity of ESD (battery or fly-wheel) . The simulation results show that the proposed techniques are able to achieve good solar tracking performance as well as obtain a minimal ESD capacity. Therefore, we show that most of the renewable generation can be consumed locally through an intelligent coordination of HVAC loads, their impacts on the grid would be minimal and the required ESD capacity can be minimized.

Dong, Jin↗

Networked Microgrids for Improving Economics and Resiliency

In this paper, we propose networked microgrids to facilitate the integration of variable renewable generation and improve the economics and resiliency of electricity supply in microgrids. A new concept, probability of successful islanding (PSI) is used to quantify the islanding capability of a microgrid considering the uncertainty of renewable energy resources and load as well as exchanged power at PCC. With the goal of minimizing the total operating cost while preserving user specified PSI, a chance-constrained optimization problem is formulated for the optimal scheduling of both individual microgrid and networked microgrids. Numerical simulation results show significant saving in electricity cost can be achieved by proposed networked microgrids without compromising the resiliency. The impact of correlation coefficients among the renewable generation and load of adjacent microgrids has been studied as well.

Liu, Guodong↗

CAN-D: A Modular Four-Step Pipeline for Comprehensively Decoding Controller Area Network Data

Controller area networks (CANs) are a broadcast protocol for real-time communication of critical vehicle subsystems. Original equipment manufacturers of passenger vehicles hold secret their mappings of CAN data to vehicle signals, and these definitions vary according to make, model, and year. Without these mappings, the wealth of real-time vehicle information hidden in the CAN packets is uninterpretable, severely impeding vehicle-related research, including CAN cybersecurity and privacy studies, aftermarket tuning, efficiency and performance monitoring, and fault diagnosis to name a few. Guided by the four-part CAN signal definition, we present CAN-D (CAN-Decoder), a modular, four-step pipeline for identifying each signal's boundaries (start bit and length), endianness (byte ordering), signedness (bit-to-integer encoding), and by leveraging diagnostic standards, augmenting a subset of the extracted signals with meaningful, physical interpretation. En route to CAN-D, we provide a comprehensive review of the CAN signal reverse engineering research. All previous methods ignore endianness and signedness, rendering them incapable of decoding many standard CAN signal definitions. Incorporating endianness grows the search space from 128 to 4.72E21 signal tokenizations and introduces a web of changing dependencies. In response, we formulate, formally analyze, and provide an efficient solution to an optimization problem, allowing identification of the optimal set of signal boundaries and byte orderings. In addition, we provide two novel, state-of-the-art signal boundary classifiers—both of which are superior to previous approaches in precision and recall in three different test scenarios—and the first signedness classification algorithm, which exhibits a $>$ 97% F-score. Altogether, CAN-D is the only solution with the potential to extract any CAN signal that is also the state of the art. In evaluation on 10 vehicles of different makes, CAN-D's average $\ell ^1$ error is five times better (81% less) than all previous methods and exhibits lower average error, even when considering only signals that meet prior methods’ assumptions. Finally, CAN-D is implemented in lightweight hardware, allowing for an on-board diagnostic (OBD-II) plugin for real-time in-vehicle CAN decoding.

42 ENGINEERING↗

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↗

Energy-Efficient and Comfortable Buildings through Multivariate Integrated Control (ECoMIC)

This project aims to develop an integrated control solution for enhanced energy efficiency and user comfort in commercial buildings. The developed technology is a zone-based control framework that minimizes energy usage while maintaining occupants’ visual and thermal comfort through control of electric lights, motorized venetian blinds and thermostats. The control framework is designed following a modular, scalable and flexible architecture to facilitate easy integration with exiting building management systems. The control framework contains two key algorithms: 1) the lighting load balancing algorithm and 2) the thermostat control algorithm. The lighting load balancing algorithm adopts a model-based closed-loop control approach to determine the optimal electric light and venetian blind settings. It is formulated into an optimization problem with minimizing lighting-related energy consumptions as the objective and delivering adequate task light and preventing daylight glare as the constraints. The thermostat control algorithm is based on a well-established thermal comfort model and formulated as a root-finding problem to dynamically determine the optimal thermostat setpoint for both energy savings and improved thermal comfort. To address building-wide scalability, a system architecture was developed for the zone-based control technology. Three levels of services are defined in the architecture: external services, facility level services and zone level services. The zone-level service includes the control algorithms described above as well as the corresponding interfaces, profiles, sensors and actuators to realize the zone controller. The facility level services connect to the zones through a backbone network, handle supervisory level information and controls, and thus facilitate building-wide scalability. The external services provide communication capability to entities outside of the building for grid interaction and remote access. Various aspects of the developed control technology were evaluated and verified through both simulations and testbed implementations. Simulations coupling a DOE medium office reference building in EnergyPlus building simulation software and a prototype controller in Matlab were performed. During summer time in a mixed-humid climate zone, the simulations revealed reductions of 27% and 42% in electric lighting load and cooling load, respectively, when compared to an advanced base case with daylight dimming and blinds automatically tilted to block direct sun. Two single-room testbeds were established. The testbed at Philips Lighting business building (Rosemont, IL) was designed for quantifying energy performance of integrated controls. This particular implementation achieved 40% and 79% savings on lighting and HVAC energy, respectively, compared to a relatively simple base case operated on predefined schedules. While the resulting energy savings was very encouraging, it should be noted that there may be several caveats associated with it. 1) The test was run during late spring and early summer, and the savings numbers might not be directly used to extrapolate the annual energy savings. 2) Due to the needs for separate control and metering of the small-scale demonstrator within a large building, the HVAC system, hence the corresponding savings, did not represent a typical energy code-compliant design. 3) The light level in the control case was regulated at a particular setpoint, which was lower than then the full-on light level in the base case, and the savings resulted from tuning down the light level to the setpoint was not attributable to the contribution of the developed technology. The testbed at the Lawrence Berkeley National Laboratory (Berkeley, CA) specifically focused on glare control integration, and has demonstrated the feasibility and capability of the glare detection and prevention technique. While the short one-month test in this testbed provided a functional indication of the developed technology, and it would require at least a full solstice-to-solstice cycle to ruinously quantify the performance, which was not possible within the project timeframe. There are certain limitations inherited from the operational assumptions, which could potentially affect the effectiveness and applicability of the developed control technologies. The system takes a typical ceiling-mounting approach for the photosensor locations, and therefore, the control performance relies on proper commissioning or the built-in intelligence of the photosensor for pertinent task light level estimations. For spaces where daylight penetration diminishes significantly deeper into the zone, certain modification to the control algorithms is required to accommodate multiple lighting control subzones and the corresponding sensors for providing a more uniform light level across the entire zone. Integrated control of visual and thermal comfort requires the lighting control zone and thermal control zone to coincide with each other. In other words, the area illuminated by a lighting circuit needs to be the same area served by the thermostat. Thus, the original zoning will potentially constrain the applicability of this technology in retrofitting projects. This project demonstrated the technical feasibility of a zone-based integrated control technology. From the simulation results and testbed implementations, up to 60% lighting energy savings in daylit areas relative to a “no-controls” case can easily be achieved. A 20% reduction of whole building energy consumption is also attainable. In the aspect of occupant comfort, the testbed demonstrated the ability to maintain specified light level on the workplane while promptly mitigate daylight glare 90% of the time. The control system also managed to maintain the thermal environment at a comfortable level 90% of the time. The aspect of system scalability was guaranteed by the system architecture design, based on which the testbeds were instantiated. Analysis on the aspect of economic benefit has yielded an about 6-year payback time for a medium-sized building, including the installation of all hardware and software, such as motorized blinds and LED luminaires. The payback time can be significantly reduced if part of the hardware is already in place for retrofitting projects. It needs to be noted that since the payback analysis was partly based on the testbed performance results, it is constrained by the caveats associated with the testbed implementations. The main uncertainty lies in the contribution from the space conditioning energy savings as it was non-trivial to realistically configure a room-size HVAC system for directly extrapolating whole-building HVAC energy savings. It is recommended to further evaluate the developed technology at a larger scale, where the lighting and HVAC energy consumption can be realistically measured at the building level, to more rigorously quantify the performance potentials.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Methodology for Exploring Water and Hydropower Operating Criteria That Simultaneously Improve Economic and Environmental Considerations

Despite the reliability and flexibility of hydropower, the operation of hydroelectric power plants may have significant impacts on the downstream river system, including its water stage, sediment transport, and water temperature, ultimately affecting the ecology. To address these challenges, there is a need to identify water scheduling patterns that improve both hydropower economics and the environment relative to current operations. This paper presents a new methodology to explore promising operational criteria/rules that can achieve such improvements. Typical environmental impact statements and relicensing processes generally perform detailed site-specific analyses of a few alternatives that focus on reservoir water release operating rules and their associated environmental impacts. In contrast, the methodology presented in this article uses a widely applicable approach that explores a much larger solution space. This large set of potential alternatives can be represented in a multidimensional space for which one axis represents the economic value and the other axis quantify individual environmental impacts (e.g., sediment transport and fish growth), and they are explored via two approaches: a Monte Carlo simulation that identifies “win–win” alternatives and a multi-objective optimization problem that identifies Pareto-optimal alternatives.

13 HYDRO ENERGY↗

Efficient Distributed Optimization of Wind Farms Using Proximal Primal-Dual Algorithms: Preprint

This paper presents a distributed approach to perform real-time optimization of large wind farms. Wind turbines in a wind farm typically operate individually to maximize their own performance regardless of the impact of aerodynamic interactions on neighboring turbines. This paper optimizes the overall power produced by a wind farm by formulating and solving a nonconvex optimization problem where the yaw angles are optimized to allow some turbines to operate in misaligned conditions and shape the aerodynamic interactions in a favorable way. The solution of the nonconvex smooth problem is tackled using a proximal primal-dual gradient method, which provably identifies a first-order stationary solution in a global sublinear manner. By adding auxiliary optimization variables for every pair of turbines that are coupled aerodynamically and properly adding consensus constraints into the underlying problem, a distributed algorithm with turbine-to-turbine message passing is obtained; this allows for turbines to be optimized in parallel using local information rather than information from the whole wind farm. This algorithm is computationally light, as it involves closed-form updates. This approach is demonstrated on a large wind farm with 60 turbines. The results indicate that similar performance can be achieved as with finite-difference gradient-based optimization at a fraction of the computational time and thus approach real-time control/optimization.

17 WIND ENERGY↗

Efficient Distributed Optimization of Wind Farms Using Proximal Primal-Dual Algorithms

This paper presents a distributed approach to performing real-time optimization of large wind farms. Wind turbines in a wind farm typically operate individually to maximize their own performance regardless of the impact of aerodynamic interactions on neighboring turbines. This paper optimizes the overall power produced by a wind farm by formulating and solving a nonconvex optimization problem where the yaw angles are optimized to allow some turbines to operate in misaligned conditions and shape the aerodynamic interactions in a favorable way. The solution of the nonconvex smooth problem is tackled using a proximal primal-dual gradient method, which provably identifies a first-order stationary solution in a global sublinear manner. By adding auxiliary optimization variables for every pair of turbines that are coupled aerodynamically, and properly adding consensus constraints into the underlying problem, a distributed algorithm with turbine-to-turbine message passing is obtained; this allows for turbines to be optimized in parallel using local information rather than information from the whole wind farm. This algorithm is computationally light, as it involves closed-form updates. This approach is demonstrated on a large wind farm with 60 turbines. The results indicate that similar performance can be achieved as with finite-difference gradient-based optimization at a fraction of the computational time and thus approaching real-time control/optimization.

17 WIND ENERGY↗

Application of Fireworks Algorithm in Gamma-Ray Spectrum Fitting for Radioisotope Identification

We present that identification of radioisotopic signature patterns in gamma-ray spectra is of paramount importance in various applications of gamma spectroscopy. Therefore, there are several active research efforts to develop accurate and precise methods to perform automated spectroscopic analysis and subsequently recognize gamma-ray signatures. In this work, the authors present a new method for radioisotope identification in gamma-ray spectra obtained with a low resolution radiation detector. The method fits the obtained spectrum with a linear combina-tion of known template signature patterns. Coefficients of the linear combination are evaluated by computing the solution of a single objective optimization problem, whose objective is the Theil-1 inequality coefficient. Optimization of the problem is performed by the Fireworks Algorithm, which identifies a set of coefficients that minimize the Theil-1 value. The computed coefficients are statistically tested for being significantly different than zero or not, and if at least one is found to be zero then the Fireworks Algorithm is used to reiterate fitting using the non-zero templates. Fitting iterations are continued up to the point that no linear coefficients are found to be zero. The output of the method is a list that contains the radioisotopes that have been identified in the measured spectrum. The method is tested on a set of both simulated and real experimental gamma-ray spectra comprised of a variety of isotopes, and compared to a multiple linear regression fitting, and genetic algorithm Theil-1 based fitting. Finally, results demonstrate the potentiality of the Fireworks Algorithm based method, expressed as higher accuracy and similar precision over the other two tested methodologies for radioisotope signature pattern identification in the framework of gamma-ray spectrum fitting.

Theil Coefficient↗

Robust Decentralized Learning Using ADMM With Unreliable Agents

Many signal processing and machine learning problems can be formulated as consensus optimization problems which can be solved efficiently via a cooperative multi-agent system. However, the agents in the system can be unreliable due to a variety of reasons: noise, faults and attacks. Providing erroneous updates leads the optimization process in a wrong direction, and degrades the performance of distributed machine learning algorithms. This paper considers the problem of decentralized learning using ADMM in the presence of unreliable agents. First, we rigorously analyze the effect of erroneous updates (in ADMM learning iterations) on the convergence behavior of the multi-agent system. We show that the algorithm linearly converges to a neighborhood of the optimal solution under certain conditions and characterize the neighborhood size analytically. Next, we provide guidelines for network design to achieve a faster convergence to the neighborhood. Here, we also provide conditions on the erroneous updates for exact convergence to the optimal solution. Finally, to mitigate the influence of unreliable agents, we propose ROAD , a robust variant of ADMM, and show its resilience to unreliable agents with an exact convergence to the optimum.

97 MATHEMATICS AND COMPUTING↗

Computing the Feasible Spaces of Optimal Power Flow Problems

The solution to an optimal power flow (OPF) problem provides a minimum cost operating point for an electric power system. The performance of OPF solution techniques strongly depends on the problem’s feasible space. This paper presents an algorithm that is guaranteed to compute the entire feasible spaces of small OPF problems to within a specified discretization tolerance. Specifically, the feasible space is computed by discretizing certain of the OPF problem’s inequality constraints to obtain a set of power flow equations. All solutions to the power flow equations at each discretization point are obtained using the Numerical Polynomial Homotopy Continuation (NPHC) algorithm. To improve computational tractability, “bound tightening” and “grid pruning” algorithms use convex relaxations to preclude consideration of many discretization points that are infeasible for the OPF problem. Here, the proposed algorithm is used to generate the feasible spaces of two small test cases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Derivative-free optimization methods

In many optimization problems arising from scientific, engineering and artificial intelligence applications, objective and constraint functions are available only as the output of a black-box or simulation oracle that does not provide derivative information. Such settings necessitate the use of methods for derivative-free, or zeroth-order, optimization. We provide a review and perspectives on developments in these methods, with an emphasis on highlighting recent developments and on unifying treatment of such problems in the non-linear optimization and machine learning literature. We categorize methods based on assumed properties of the black-box functions, as well as features of the methods. We first overview the primary setting of deterministic methods applied to unconstrained, non-convex optimization problems where the objective function is defined by a deterministic black-box oracle. We then discuss developments in randomized methods, methods that assume some additional structure about the objective (including convexity, separability and general non-smooth compositions), methods for problems where the output of the black-box oracle is stochastic, and methods for handling different types of constraints.

97 MATHEMATICS AND COMPUTING↗