• Title/Summary/Keyword: particle swarm optimization algorithm

Search Result 464, Processing Time 0.024 seconds

Optimum distribution of steel frame assembly for seismic retrofit of framed structures

  • Michael Adane;Seungho Chun;Jinkoo Kim
    • Steel and Composite Structures
    • /
    • v.50 no.3
    • /
    • pp.337-345
    • /
    • 2024
  • This research proposed a particle swarm optimization (PSO) based seismic retrofit design of moment frame structures using a steel frame assembly. Two full scale specimens of the steel frame assembly with different corner details were attached to one-story RC frames for seismic retrofit, and the lateral load resisting capacities of the retrofitted frames subjected to cyclic loads were compared with those of a bare RC frame. The open source software framework Opensees was used to develop an analytical model for validating the experimental results. The developed analytical model and the optimization scheme were applied to a case study structure for economic seismic retrofit design, and its seismic performance was assessed before and after the retrofit. The results show that the developed steel frame assembly was effective in increasing seismic load resisting capability of the structure, and the PSO algorithm could be applied as convenient optimization tool for seismic retrofit design of structures.

PESA: Prioritized experience replay for parallel hybrid evolutionary and swarm algorithms - Application to nuclear fuel

  • Radaideh, Majdi I.;Shirvan, Koroush
    • Nuclear Engineering and Technology
    • /
    • v.54 no.10
    • /
    • pp.3864-3877
    • /
    • 2022
  • We propose a new approach called PESA (Prioritized replay Evolutionary and Swarm Algorithms) combining prioritized replay of reinforcement learning with hybrid evolutionary algorithms. PESA hybridizes different evolutionary and swarm algorithms such as particle swarm optimization, evolution strategies, simulated annealing, and differential evolution, with a modular approach to account for other algorithms. PESA hybridizes three algorithms by storing their solutions in a shared replay memory, then applying prioritized replay to redistribute data between the integral algorithms in frequent form based on their fitness and priority values, which significantly enhances sample diversity and algorithm exploration. Additionally, greedy replay is used implicitly to improve PESA exploitation close to the end of evolution. PESA features in balancing exploration and exploitation during search and the parallel computing result in an agnostic excellent performance over a wide range of experiments and problems presented in this work. PESA also shows very good scalability with number of processors in solving an expensive problem of optimizing nuclear fuel in nuclear power plants. PESA's competitive performance and modularity over all experiments allow it to join the family of evolutionary algorithms as a new hybrid algorithm; unleashing the power of parallel computing for expensive optimization.

PMDV-hop: An effective range-free 3D localization scheme based on the particle swarm optimization in wireless sensor network

  • Wang, Wenjuan;Yang, Yuwang;Wang, Lei;Lu, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.61-80
    • /
    • 2018
  • Location information of individual nodes is important in the implementation of necessary network functions. While extensive studies focus on localization techniques in 2D space, few approaches have been proposed for 3D positioning, which brings the location closer to the reality with more complex calculation consumptions for high accuracy. In this paper, an effective range-free localization scheme is proposed for 3D space localization, and the sensitivity of parameters is evaluated. Firstly, we present an improved algorithm (MDV-Hop), that the average distance per hop of the anchor nodes is calculated by root-mean-square error (RMSE), and is dynamically corrected in groups with the weighted RMSE based on group hops. For more improvement in accuracy, we expand particle swarm optimization (PSO) of intelligent optimization algorithms to MDV-Hop localization algorithm, called PMDV-hop, in which the parameters (inertia weight and trust coefficient) in PSO are calculated dynamically. Secondly, the effect of various localization parameters affecting the PMDV-hop performance is also present. The simulation results show that PMDV-hop performs better in positioning accuracy with limited energy.

Approach toward footstep planning considering the walking period: Optimization-based fast footstep planning for humanoid robots

  • Lee, Woong-Ki;Kim, In-Seok;Hong, Young-Dae
    • ETRI Journal
    • /
    • v.40 no.4
    • /
    • pp.471-482
    • /
    • 2018
  • This paper proposes the necessity of a walking period in footstep planning and details situations in which it should be considered. An optimization-based fast footstep planner that takes the walking period into consideration is also presented. This footstep planner comprises three stages. A binary search is first used to determine the walking period. The front stride, side stride, and walking direction are then determined using the modified rapidly-exploring random tree algorithm. Finally, particle swarm optimization (PSO) is performed to ensure feasibility without departing significantly from the results determined in the two stages. The parameters determined in the previous two stages are optimized together through the PSO. Fast footstep planning is essential for coping with dynamic obstacle environments; however, optimization techniques may require a large computation time. The two stages play an important role in limiting the search space in the PSO. This framework enables fast footstep planning without compromising on the benefits of a continuous optimization approach.

Hybrid GA-ANN and PSO-ANN methods for accurate prediction of uniaxial compression capacity of CFDST columns

  • Quang-Viet Vu;Sawekchai Tangaramvong;Thu Huynh Van;George Papazafeiropoulos
    • Steel and Composite Structures
    • /
    • v.47 no.6
    • /
    • pp.759-779
    • /
    • 2023
  • The paper proposes two hybrid metaheuristic optimization and artificial neural network (ANN) methods for the close prediction of the ultimate axial compressive capacity of concentrically loaded concrete filled double skin steel tube (CFDST) columns. Two metaheuristic optimization, namely genetic algorithm (GA) and particle swarm optimization (PSO), approaches enable the dynamic training architecture underlying an ANN model by optimizing the number and sizes of hidden layers as well as the weights and biases of the neurons, simultaneously. The former is termed as GA-ANN, and the latter as PSO-ANN. These techniques utilize the gradient-based optimization with Bayesian regularization that enhances the optimization process. The proposed GA-ANN and PSO-ANN methods construct the predictive ANNs from 125 available experimental datasets and present the superior performance over standard ANNs. Both the hybrid GA-ANN and PSO-ANN methods are encoded within a user-friendly graphical interface that can reliably map out the accurate ultimate axial compressive capacity of CFDST columns with various geometry and material parameters.

Energy-Aware Virtual Data Center Embedding

  • Ma, Xiao;Zhang, Zhongbao;Su, Sen
    • Journal of Information Processing Systems
    • /
    • v.16 no.2
    • /
    • pp.460-477
    • /
    • 2020
  • As one of the most significant challenges in the virtual data center, the virtual data center embedding has attracted extensive attention from researchers. The existing research works mainly focus on how to design algorithms to increase operating revenue. However, they ignore the energy consumption issue of the physical data center in virtual data center embedding. In this paper, we focus on studying the energy-aware virtual data center embedding problem. Specifically, we first propose an energy consumption model. It includes the energy consumption models of the virtual machine node and the virtual switch node, aiming to quantitatively measure the energy consumption in virtual data center embedding. Based on such a model, we propose two algorithms regarding virtual data center embedding: one is heuristic, and the other is based on particle swarm optimization. The second algorithm provides a better solution to virtual data center embedding by leveraging the evolution process of particle swarm optimization. Finally, experiment results show that our proposed algorithms can effectively save energy while guaranteeing the embedding success rate.

A two-stage structural damage detection method using dynamic responses based on Kalman filter and particle swarm optimization

  • Beygzadeh, Sahar;Torkzadeh, Peyman;Salajegheh, Eysa
    • Structural Engineering and Mechanics
    • /
    • v.83 no.5
    • /
    • pp.593-607
    • /
    • 2022
  • To solve the problem of detecting structural damage, a two-stage method using the Kalman filter and Particle Swarm Optimization (PSO) is proposed. In this method, the first PSO population is enhanced using the Kalman filter method based on dynamic responses. Due to noise in the sensor responses and errors in the damage detection process, the accuracy of the damage detection process is reduced. This method proposes a novel approach for solve this problem by integrating the Kalman filter and sensitivity analysis. In the Kalman filter, an approximate damage equation is considered as the equation of state and the damage detection equation based on sensitivity analysis is considered as the observation equation. The first population of PSO are the random damage scenarios. These damage scenarios are estimated using a step of the Kalman filter. The results of this stage are then used to detect the exact location of the damage and its severity with the PSO algorithm. The efficiency of the proposed method is investigated using three numerical examples: a 31-element planer truss, a 52-element space dome, and a 56-element space truss. In these examples, damage is detected for several scenarios in two states: using the no noise responses and using the noisy responses. The results show that the precision and efficiency of the proposed method are appropriate in structural damage detection.

ELECTRICAL RESISTANCE IMAGING OF TWO-PHASE FLOW WITH A MESH GROUPING TECHNIQUE BASED ON PARTICLE SWARM OPTIMIZATION

  • Lee, Bo An;Kim, Bong Seok;Ko, Min Seok;Kim, Kyung Youn;Kim, Sin
    • Nuclear Engineering and Technology
    • /
    • v.46 no.1
    • /
    • pp.109-116
    • /
    • 2014
  • An electrical resistance tomography (ERT) technique combining the particle swarm optimization (PSO) algorithm with the Gauss-Newton method is applied to the visualization of two-phase flows. In the ERT, the electrical conductivity distribution, namely the conductivity values of pixels (numerical meshes) comprising the domain in the context of a numerical image reconstruction algorithm, is estimated with the known injected currents through the electrodes attached on the domain boundary and the measured potentials on those electrodes. In spite of many favorable characteristics of ERT such as no radiation, low cost, and high temporal resolution compared to other tomography techniques, one of the major drawbacks of ERT is low spatial resolution due to the inherent ill-posedness of conventional image reconstruction algorithms. In fact, the number of known data is much less than that of the unknowns (meshes). Recalling that binary mixtures like two-phase flows consist of only two substances with distinct electrical conductivities, this work adopts the PSO algorithm for mesh grouping to reduce the number of unknowns. In order to verify the enhanced performance of the proposed method, several numerical tests are performed. The comparison between the proposed algorithm and conventional Gauss-Newton method shows significant improvements in the quality of reconstructed images.

Optimal deployment of bistatic sonar using particle swarm optimization algorithm (입자 군집 최적화 알고리즘을 이용한 양상태 소나 최적 배치 연구)

  • Ji Seop Kim;Dae Hyeok Lee;Wonjun Yang;Young Seung Kim;Jee Woong Choi;Hyuckjong Kwon;Jungyong Park;Su-Uk Son;Ho Seuk Bae;Joung-Soo Park
    • The Journal of the Acoustical Society of Korea
    • /
    • v.43 no.4
    • /
    • pp.437-444
    • /
    • 2024
  • Bistatic sonar performance varies significantly depending on the ocean environment, the location (latitude, longitude) and water depth of the source and receiver. Therefore, research on optimal deployment of bistatic sonar considering ocean environment is necessary. In this study, we suggest an algorithm to optimize the location and water depth of source and receiver when operating monostatic and bistatic sonar on two spatially separated surface ships in the Ulleung Basin in the East Sea. A particle swarm optimization algorithm was used to search the location and water depth of the source and receiver to maximize the detectable area within the search area. As a result of performing bistatic sonar deployment using the algorithm proposed in this study, the detectable area increased as the number of model iterations increased. Additionally, it was confirmed that the source and receiver on the two surface ships converged to the optimal location and water depth.

Building Indoor Temperature Control Using PSO Algorithm (PSO 알고리즘을 이용한 건물 실내온도 제어)

  • Kim, Jeong-Hyuk;Kim, Ho-Chan
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.5
    • /
    • pp.2536-2543
    • /
    • 2013
  • In this paper, we proposed the modeling in one zone buildings and the energy efficient temperature control algorithm using particle swarm optimization (PSO). A control horizon switching method with PSO is used for optimal control, and the TOU tariff is included to calculate the energy costs. Simulation results show that the reductions of energy cost and peak power can be obtained using proposed algorithms.