SEARCH · Search NASA

Results for “particle swarm 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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records

All sources NASA NTRS DOE OSTI

DOE OSTI2022

Improved Particle Swarm Algorithm Using Rubik’s Cube Topology for Bilevel Building Energy Transaction

Following the rapid growth of distributed energy resources (e.g., renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as reducing power loss and stabilizing the main power grid. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. Additionally, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush–Kuhn–Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence-based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubik’s Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubik’s Cube topology-based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology-based PSO and its scalability on larger scale applications.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2021

Rubik’s Cube Topology Based Particle Swarm Algorithm for Bilevel Building Energy Transaction

Following the rapid growth of distributed energy resources (e.g. renewables, battery), localized peer-to-peer energy transactions are receiving more attention for multiple benefits, such as, reducing power loss, stabilizing the main power grid, etc. To promote distributed renewables locally, the local trading price is usually set to be within the external energy purchasing and selling price range. Consequently, building prosumers are motivated to trade energy through a local transaction center. This local energy transaction is modeled in bilevel optimization game. A selfish upper level agent is assumed with the privilege to set the internal energy transaction price with an objective of maximizing its arbitrage profit. Meanwhile, the building prosumers at the lower level will response to this transaction price and make decisions on electricity transaction amount. Therefore, this non-cooperative leader-follower trading game is seeking for equilibrium solutions on the energy transaction amount and prices. In addition, a uniform local transaction price structure (purchase price equals selling price) is considered here. Aiming at reducing the computational burden from classical Karush-Kuhn-Tucker (KKT) transformation and protecting the private information of each stakeholder (e.g., building), swarm intelligence based solution approach is employed for upper level agent to generate trading price and coordinate the transactive operations. On one hand, to decrease the chance of premature convergence in global-best topology, Rubiks Cube topology is proposed in this study based on further improvement of a two-dimensional square lattice model (i.e., one local-best topology-Von Neumann topology). Rotating operation of the cube is introduced to dynamically changing the neighborhood and enhancing information flow at the later searching state. Several groups of experiments are designed to evaluate the performance of proposed Rubiks Cube topology based particle swarm algorithm. The results have validated the effectiveness of proposed topology and operators comparing with global-best version PSO and Von Neumann topology based PSO and its scalability on larger scale applications.

Feng, Xiaochun↗

NASA NTRS2005

A Parallel Particle Swarm Optimization Algorithm Accelerated by Asynchronous Evaluations

A parallel Particle Swarm Optimization (PSO) algorithm is presented. Particle swarm optimization is a fairly recent addition to the family of non-gradient based, probabilistic search algorithms that is based on a simplified social model and is closely tied to swarming theory. Although PSO algorithms present several attractive properties to the designer, they are plagued by high computational cost as measured by elapsed time. One approach to reduce the elapsed time is to make use of coarse-grained parallelization to evaluate the design points. Previous parallel PSO algorithms were mostly implemented in a synchronous manner, where all design points within a design iteration are evaluated before the next iteration is started. This approach leads to poor parallel speedup in cases where a heterogeneous parallel environment is used and/or where the analysis time depends on the design point being analyzed. This paper introduces an asynchronous parallel PSO algorithm that greatly improves the parallel e ciency. The asynchronous algorithm is benchmarked on a cluster assembled of Apple Macintosh G5 desktop computers, using the multi-disciplinary optimization of a typical transport aircraft wing as an example.

Venter, Gerhard↗

DOE OSTI2024

Enhancing Camera Calibration for Traffic Surveillance with an Integrated Approach of Genetic Algorithm and Particle Swarm Optimization

Recent advancements in sensor technologies, coupled with signal processing and machine learning, have enabled real-time traffic control systems to effectively adapt to changing traffic conditions. Cameras, as sensors, offer a cost-effective means to determine the number, location, type, and speed of vehicles, aiding decision-making at traffic intersections. However, the effective use of cameras for traffic surveillance requires proper calibration. This paper proposes a new optimization-based method for camera calibration. In this approach, initial calibration parameters are established using the Direct Linear Transformation (DLT) method. Then, optimization algorithms are applied to further refine the calibration parameters for the correction of nonlinear lens distortions. A significant enhancement in the optimization process is achieved through the integration of the Genetic Algorithm (GA) and Particle Swarm Optimization (PSO) into a combined Integrated GA and PSO (IGAPSO) technique. The effectiveness of this method is demonstrated through the calibration of eleven roadside cameras at three different intersections. The experimental results show that when compared to the baseline DLT method, the vehicle localization error is reduced by 22.30% with GA, 22.31% with PSO, and 25.51% with IGAPSO.

47 OTHER INSTRUMENTATION↗

DOE OSTI2022

Particle Swarm Optimization Algorithm for Critical Experiment Design

Nuclear criticality experiments are used to validate nuclear cross section data used by simulation software. This is typically achieved by designing a critical system with a high sensitivity to a certain material’s cross section. Once the experiment has been carried out, a high fidelity model of the system is developed into a benchmark. When this benchmark model is simulated by a transport code, some of the difference between the experimental and computational effective neutron multiplication factor can be attributed to inaccurate nuclear data. Nuclear data evaluators then can make adjustments accordingly to improve cross section data.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2021

Teeport: Break the Wall Between the Optimization Algorithms and Problems

Optimization algorithms/techniques such as genetic algorithm, particle swarm optimization, and Gaussian process have been widely used in the accelerator field to tackle complex design/online optimization problems. However, connecting the algorithm with the optimization problem can be difficult, as the algorithms and the problems may be implemented in different languages, or they may require specific resources. We introduce an optimization platform named Teeport that is developed to address the above issues. This real-time communication-based platform is designed to minimize the effort of integrating the algorithms and problems. Once integrated, the users are granted a rich feature set, such as monitoring, controlling, and benchmarking. Some real-life applications of the platform are also discussed.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2022

Optimal Power Dispatch of DGs in Radial and Mesh AC Grids: A Hybrid Solution Methodology between the Salps Swarm Algorithm and Successive Approximation Power Flow Method

In this paper, we address the problem of the optimal power dispatch of Distributed Generators (DGs) in Alternating Current (AC) networks, better known as the Optimal Power Flow (OPF) problem. We used, as the objective function, the minimization of power losses (P loss ) associated with energy transport, which are subject to the set of constraints that compose AC networks in an environment of distributed generation. To validate the effectiveness of the proposed methodology in solving the OPF problem in any network topology, we employed one 10-node mesh test system and three radial text systems: 10, 33, and 69 nodes. In each test system, DGs were allowed to inject 20%, 40%, and 60% of the power supplied by the slack generator in the base case. To solve the OPF problem, we used a master–slave methodology that integrates the optimization method Salps Swarm Algorithm (SSA) and the load flow technique based on the Successive Approximation (SA) method. Moreover, for comparison purposes, we employed some of the algorithms reported in the specialized literature to solve the OPF problem (the continuous genetic algorithm, the particle swarm optimization algorithm, the black hole algorithm, the antlion optimization algorithm, and the Multi-Verse Optimizer algorithm), which were selected because of their excellent results in solving such problems. The results obtained by the proposed solution methodology demonstrate its superiority and convergence capacity in terms of minimization of P loss in both radial and mesh systems. It provided the best reduction in minimum P loss in short processing times and showed excellent repeatability in each test system and scenario under analysis.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2024

A Vibrational Energy Harvesting Sensor Based on Linear and Rotational Electromechanical Effects

In this investigation, a magnetically coupled double-spring design is presented for harvesting low-level non-stationary random vibrational energy. The sensor relies on multimodal coupling between the translation and rotation of a two-spring magnet and coil system to widen the harvesting bandwidth. Energy methods are used to develop a model to characterize the electromechanical response of the system, the solution of which is obtained using stochastic techniques based on a particle swarm algorithm. This approach provides an efficient method to estimate system parameters that otherwise are difficult or impossible to determine with independent measurements. The experimental results demonstrate agreement with the theoretical predictions over a limited bandwidth. The sensor can effectively harvest non-stationary vibration energy down to 10 -4 g within a limited bandwidth of 130–150 Hz. The sensor prototype has an operational volume of 2.6 cm 3 with a calculated power density of 0.2 W/cm 3 . The sensor’s small size results in a coupling efficiency of approximately 6% across the tested bandwidth.

42 ENGINEERING↗

DOE OSTI2025

Hydrogen-Battery Hybrid Energy System on Repurposed Offshore Platforms for Efficient Clean-Energy Transition

Due to the rising global energy demand and enhanced awareness of the environmental impact of fossil fuels, the Gulf of Mexico, traditionally known for oil extraction, offers a distinct chance to repurpose the existing offshore infrastructure. With the depletion of oil reserves, it is feasible to adapt previously utilized floating platforms for extraction to generate renewable energy, specifically through wind-generated power and hydrogen production. This adaptation seeks to promote a transport system that is more ecologically friendly in the future. Offshore wind turbines serve as the main energy source, with help from battery storage and hydrogen production to enhance the overall system performance, hydrogen creation, fuel, and electricity delivery for sustainable energy production. The system is divided into two distinct cases, each evaluated for cost, performance, and feasibility, with a focus on minimizing both the Levelized Cost of Energy (LCOE) and the Levelized Cost of Hydrogen (LCOH). The first case examines the integration of offshore wind turbines with hydrogen production. Excess electricity generated by wind turbines is directed toward hydrogen production via electrolysis. The hydrogen produced can be used as fuel for vehicles or transported to the shore via pipelines. The second case investigates a technology that combines wind turbines with battery storage. The batteries possess an ability to supply electricity for a continuous duration of 4 hours maximum each day. The main objective is to reduce the LCOE by considering the battery's charging and discharging cycles, together with the uncertain attributes of wind power and battery deterioration. The produced energy can be distributed for onshore applications or utilized for the purpose of offsetting offshore loads such as subsea oil and gas production, transportation, etc. The offshore hydrogen-battery hybrid system is improved via three advanced algorithms, Particle Swarm Optimization (PSO), and Grey Wolf Optimizer (GWO). In Case 1, PSO improves hydrogen production by efficiently managing the electrolyzer’s power consumption, decreasing production costs significantly. Particle Swarm Optimization (PSO) is applied to improve the efficiency of the electrolyzer, reducing production costs and achieving an optimized CAPEX of $240.00 million (from an initial $300.00 million) and OPEX of $9.60 million per year. This system produces 4,720,000 kg of hydrogen annually, with a Levelized Cost of Hydrogen (LCOH) of $6.40/kg and an annual profit of $9.27 million. In Case 2, GWO effectively reduces the overall energy cost by improving the charge-discharge management of batteries, which extends battery life and optimizes their use. The second case focuses on integrating battery storage, optimized using the Grey Wolf Optimizer (GWO), which enhances battery charge-discharge cycles, extending battery life and lowering costs. This system achieves an optimized CAPEX of $204.80 million (from an initial $256.00 million) and OPEX of $9.29 million per year, producing 310883.39 MWh of electricity annually at a Levelized Cost of Energy (LCOE) of $86.13/MWh, with an annual profit of $6.25 million. The implementation of a comprehensive strategy results in a substantial reduction in costs, improved energy efficiency, and a dependable supply of both electric power and hydrogen, emphasizing the benefits of converting offshore oil platforms for clean energy transition. This study explores a clean strategy to enable cost-effective repurposing of offshore O&G platforms. Both cases highlight the economic and technical feasibility of transitioning offshore oil platforms to clean energy systems, demonstrating substantial cost reductions and reliable energy and hydrogen supplies for sustainable energy production.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

DOE OSTI2022

Hybrid Particle Swarm-Interpolation Algorithm for Improved Critical Experiment Design

The typical goal of designing a critical experiment is twofold: a system that is both critical and optimized for some other value. This value could be an energy-integrated sensitivity, percent fissions in a certain energy range, or some other value that can be calculated by a transport code. By simulating different combinations of reflector, moderator, and fuel thicknesses a designer can identify such a desirable configuration. The domain of all possible combinations of these thicknesses is referred to as the experiment search space. As more dimensions are added, the search space increases in size exponentially. For a three-dimensional case, which includes three thickness values between zero and ten centimeters to the nearest tenth of a millimeter, a total of 1,000 3 , configurations exists. Rather than check each configuration individually, which would be extremely computationally expensive, it has been shown to be more efficient to use a conventional particle swarm optimization (PSO) algorithm to identify critical and optimal configurations. This work presents the theory and implementation of a novel hybrid PSO interpolation algorithm to perform these optimizations faster than a conventional PSO algorithm. To demonstrate this, an example optimization will be carried out by the conventional and hybrid PSO algorithms and their performances will be compared.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

DOE OSTI2020

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↗

NASA NTRS2002

Particle Swarm Optimization

The purpose of this paper is to show how the search algorithm known as particle swarm optimization performs. Here, particle swarm optimization is applied to structural design problems, but the method has a much wider range of possible applications. The paper's new contributions are improvements to the particle swarm optimization algorithm and conclusions and recommendations as to the utility of the algorithm, Results of numerical experiments for both continuous and discrete applications are presented in the paper. The results indicate that the particle swarm optimization algorithm does locate the constrained minimum design in continuous applications with very good precision, albeit at a much higher computational cost than that of a typical gradient based optimizer. However, the true potential of particle swarm optimization is primarily in applications with discrete and/or discontinuous functions and variables. Additionally, particle swarm optimization has the potential of efficient computation with very large numbers of concurrently operating processors.

Venter, Gerhard↗

DOE OSTI2022

Comparison of multiobjective optimization methods for the $\mathrm{LCLS-II}$ photoinjector

Particle accelerators are among some of the largest science experiments in the world and can consist of thousands of components with a wide variety of input ranges. These systems can easily become unwieldy optimization problems during design and operations studies. Starting in the early 2000s, searching for better beam dynamics configurations became synonymous with heuristic optimization methods in the accelerator physics community. Genetic algorithms and particle swarm optimization are currently the most widely used. These algorithms can take thousands of simulation evaluations to find optimal solutions for one machine prototype. For large facilities such as the Linac Coherent Light Source (LCLS) and others, this equates to a limited exploration of many possible design configurations. In this paper, the LCLS-II photoinjector is optimized with three optimization algorithms. All optimizations were started from both a uniform random and Latin hypercube sample. In all cases, the optimizations started from Latin hypercube samples outperformed optimizations started from uniform samples. All three algorithms were able to optimize the photoinjector, with the model-based methods approximating the Pareto front in fewer simulation evaluations. This work, in combination with previous optimization observations, indicates objective penalties have a strong impact on the efficiency of such methods. In general, we recommend heuristic methods for initial optimizations and model-based methods when information about the objective space is available.

43 PARTICLE ACCELERATORS↗

DOE OSTI2020

A novel active optimization approach for rapid and efficient design space exploration using ensemble machine learning

In this work, a novel design optimization technique based on active learning, which involves dynamic exploration and exploitation of the design space of interest using an ensemble of machine learning algorithms, is presented. In this approach, a hybrid methodology incorporating an explorative weak learner (regularized basis function model) which fits high-level information about the response surface, and an exploitative strong learner (based on committee machine) that fits finer details around promising regions identified by the weak learner, is employed. For each design iteration, an aristocratic approach is used to select a set of nominees, where points that meet a threshold merit value as predicted by the weak learner are selected to be evaluated using expensive function evaluation. In addition to these points, the global optimum as predicted by the strong learner is also evaluated to enable rapid convergence to the actual global optimum once the most promising region has been identified by the optimizer. This methodology is first tested by applying it to the optimization of a two-dimensional multi-modal surface. The performance of the new active learning approach is compared with traditional global optimization methods, namely micro-genetic algorithm (pGA) and particle swarm optimization (PSO). It is demonstrated that the new optimizer is able to reach the global optimum much faster with a significantly fewer number of function evaluations. Subsequently, the new optimizer is also applied to a complex internal combustion (IC) engine combustion optimization case with nine control parameters related to fuel injection, initial thermodynamic conditions, and in-cylinder flow. It is again found that the new approach significantly lowers the number of function evaluations that are needed to reach the optimum design configuration (by up to 80%) when compared to particle swarm and genetic algorithm-based optimization techniques.

Machine learning, active learning, design optimiza↗

DOE OSTI2023

Comparison of Shape Optimization Methods for Heat Exchanger Fins Using Computational Fluid Dynamics

Inverse design techniques are one way to leverage advances in 3D printing, artificial intelligence, and computational resources to achieve increased performance of heat exchangers. Two optimization techniques (genetic algorithm and particle swarm) and three geometry representations (binary level set, composite Bézier, and free form deformation) are used to increase the heat transfer and reduce the pressure drop of a heat exchanger fin. After running 210,810 OpenFOAM simulations, results indicate that a significant performance increase of the fin can be realized in less than 48 hrs, allowing for such a process to be integrated in traditional design processes. The best design increased the performance of the objective function, compared to the baseline rectangular geometry by 75%. A custom distributed infrastructure was built, allowing for all methods to reach 95% of the final objective values in a little over 4 hrs, handling 1674 OpenFoam simulations per hour.

42 ENGINEERING↗

DOE OSTI2021

Initial use of Nek5000/Cardinal to improve closure models in Pronghorn

Heat transfer coefficient closure models for pebble bed reactors are built using a data-driven approach by leveraging the capabilities of an Evolutionary Algorithm entitled Particle Swarm Optimization (PSO). In the present work, the Computational Fluid Dynamics code nekRS was used in order to collect the high-fidelity flow data for a core with 1,568 pebbles. To characterize the heat transfer, multiple concentric regions were considered to extract the physical quantities of interest, e.g./ the Reynolds number. The PSO algorithm is employed as part of an inverse problem targeting determine what are the coefficients for a Nusselt number correlation to match the collected data. Such correlation should follow any given format that is defined a priori. Finally, two correlations are proposed, one with an implicit dependence on the pebbles’ wall temperatures and another expressed as a fully explicit correlation depending on the flow conditions and the position within the core. Anyway, given the generic nature of the proposed approach, correlations following different formats could be tested. Preliminary results for the high-fidelity simulation of a fast MSR core are presented. The target Reynolds number is currently 20K, with the expectation that this will increase, pending the availability of further computational resources. These simulations will be used to inform lower fidelity models, including a coarse CFD turbulence model in Pronghorn. Additionally, they will serve as a reference for the RANS models in Nek5000/NekRS.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

DOE OSTI2022

Development of novel dynamic machine learning-based optimization of a coal-fired power plant

The increasing fraction of intermittent renewable energy in the electrical grid is resulting in coal-fired boilers now routinely ramp up and down. The current state-of-the-art operation for such boilers is to apply steady-state, neural network-based optimization to make control decisions in real-time, and this report demonstrates the feasibility of extending this to dynamic, neural network-based optimization using a long short-term memory neural network. A simplified numerical simulation of a t-fired coal boiler and supporting equipment is used to represent a real plant subjected to both steady-state, neural network-based optimization and dynamic, neural network-based optimization. Using the same intervals and a particle swarm optimization algorithm, the dynamic optimization outperforms the steady-state optimization and realizes up to 4.58% improvement in thermal efficiency. Dynamic optimization with a long short-term memory neural network is shown to both be feasible and beneficial for operation of a coal-fired boiler under changing load.

42 ENGINEERING↗

DOE OSTI2025

Particle Swarm Optimization of Dynamic Load Model Parameters in Large Systems

This paper considers two dynamic load models that are widely used in industry to account for induction motor behavior: CMLD and CLOD. These models must be parametrized for the specific utility system in a general way so that they can be used in planning studies and provide a conservative but realistic representation of load behavior. This study considers a measurement-based approach to tuning both models. The load modeling study compares the response of the tuned models to generic candidate models using historical events. This study considers one area-based subsystem to simplify the modeling approach and reduce the number of models required for simulations. Additionally, because dynamic load models often produce similar results for different sets of parameters, a sensitivity study was conducted to assess the parameter impacts on the voltage response. The sensitivity study covers the parameters that are tuned using event measurements. The process to estimate the parameters uses the particle-swarm optimization algorithm. Overall, the performance of the tuned model more accurately captures recovery voltage, delayed recovery, and settling voltage than its predecessor models while not being overly tuned so that it remains general for peak summer conditions.

dynamic load modeling↗