• 제목/요약/키워드: PSO (Particle Swarm Optimization) Algorithm

검색결과 324건 처리시간 0.026초

Hybrid PSO-Complex Algorithm Based Parameter Identification for a Composite Load Model

  • Del Castillo, Manuelito Y. Jr.;Song, Hwachang;Lee, Byongjun
    • Journal of Electrical Engineering and Technology
    • /
    • 제8권3호
    • /
    • pp.464-471
    • /
    • 2013
  • This paper proposes a hybrid searching algorithm based on parameter identification for power system load models. Hybrid searching was performed by the combination of particle swarm optimization (PSO) and a complex method, which enhances the convergence of solutions closer to minima and takes advantage of global searching with PSO. In this paper, the load model of interest is composed of a ZIP model and a third-order model for induction motors for stability analysis, and parameter sets are obtained that best-fit the output measurement data using the hybrid search. The origin of the hybrid method is to further apply the complex method as a local search for finding better solutions using the selected particles from the performed PSO procedure.

PSO-Based Nonlinear PI-type Controller Design for Boost Converter

  • Seo, Sang-Wha;Kim, Yong;Choi, Han Ho
    • Journal of Electrical Engineering and Technology
    • /
    • 제13권1호
    • /
    • pp.211-219
    • /
    • 2018
  • This paper designs a nonlinear PI-type controller for the robust control of a boost DC-DC converter using a particle swarm optimization (PSO) algorithm. Based on the common knowledge that the transient responses can be improved if the P and I gains increase when the transient error is big, a nonlinear PI-type control design method is developed. A design procedure to autotune the nonlinear P and I gains is given based on a PSO algorithm. The proposed nonlinear PI-type controller is implemented in real time on a Texas Instruments TMS320F28335 floating-point DSP. Simulation and experimental results are given to demonstrate the effectiveness and practicality of the proposed method.

Hybrid BFPSO Approach for Effective Tuning of PID Controller for Load Frequency Control Application in an Interconnected Power System

  • Anbarasi, S.;Muralidharan, S.
    • Journal of Electrical Engineering and Technology
    • /
    • 제12권3호
    • /
    • pp.1027-1037
    • /
    • 2017
  • Penetration of renewable energy sources makes the modern interconnected power systems to have more intelligence and flexibility in the control. Hence, it is essential to maintain the system frequency and tie-line power exchange at nominal values using Load Frequency Control (LFC) for efficient, economic and reliable operation of power systems. In this paper, intelligent tuning of the Proportional Integral Derivative (PID) controller for LFC in an interconnected power system is considered as a main objective. The chosen problem is formulated as an optimization problem and the optimal gain parameters of PID controllers are computed with three innovative swarm intelligent algorithms named Particle Swarm Optimization (PSO), Bacterial Foraging Optimization Algorithm (BFOA) and hybrid Bacterial Foraging Particle Swarm Optimization (BFPSO) and a comparative study is made between them. A new objective function designed with necessary time domain specifications using weighted sum approach is also offered in this report and compared with conventional objective functions. All the simulation results clearly reveal that, the hybrid BFPSO tuned PID controller with proposed objective function has better control performances over other optimization methodologies.

Particle Swarm Optimization Using Adaptive Boundary Correction for Human Activity Recognition

  • Kwon, Yongjin;Heo, Seonguk;Kang, Kyuchang;Bae, Changseok
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권6호
    • /
    • pp.2070-2086
    • /
    • 2014
  • As a kind of personal lifelog data, activity data have been considered as one of the most compelling information to understand the user's habits and to calibrate diagnoses. In this paper, we proposed a robust algorithm to sampling rates for human activity recognition, which identifies a user's activity using accelerations from a triaxial accelerometer in a smartphone. Although a high sampling rate is required for high accuracy, it is not desirable for actual smartphone usage, battery consumption, or storage occupancy. Activity recognitions with well-known algorithms, including MLP, C4.5, or SVM, suffer from a loss of accuracy when a sampling rate of accelerometers decreases. Thus, we start from particle swarm optimization (PSO), which has relatively better tolerance to declines in sampling rates, and we propose PSO with an adaptive boundary correction (ABC) approach. PSO with ABC is tolerant of various sampling rate in that it identifies all data by adjusting the classification boundaries of each activity. The experimental results show that PSO with ABC has better tolerance to changes of sampling rates of an accelerometer than PSO without ABC and other methods. In particular, PSO with ABC is 6%, 25%, and 35% better than PSO without ABC for sitting, standing, and walking, respectively, at a sampling period of 32 seconds. PSO with ABC is the only algorithm that guarantees at least 80% accuracy for every activity at a sampling period of smaller than or equal to 8 seconds.

펄스 간 이동 성분을 갖는 계단 첩 파형의 개선된 PSO를 이용한 ISAR 영상 요동 보상 (Inter-Pulse Motion Compensation of an ISAR Image Generated by Stepped Chirp Waveform Using Improved Particle Swarm Optimization)

  • 강민석;이성현;박상홍;신승용;양은정;김경태
    • 한국전자파학회논문지
    • /
    • 제26권2호
    • /
    • pp.218-225
    • /
    • 2015
  • 역합성 개구면 레이더(Inverse Synthetic Aperture Radar: ISAR) 영상은 표적으로부터 반사되어 돌아온 레이더 수신신호들을 코히런트하게 신호처리하여 형성한 표적의 2차원 영상이다. 본 논문에서는 계단 첩 파형(Stepped Chirp Waveform: SCW)을 이용한 ISAR 영상 형성과정에서 펄스 간 움직임(Inter-Pulse Motion: IPM)이 존재하는 경우, 이를 효과적으로 보상하기 위한 알고리즘을 제안한다. 널리 쓰이는 최적화 기법 중 하나인 particle swarm optimization(PSO)를 기반으로 IPM에 관련된 표적의 속도와 가속도를 추정한다. 또한, 개선된 PSO를 통해 기존의 성능을 더욱 향상시켜 실시간 요동보상을 수행한다. 시뮬레이션에서는 Boeing-737의 점 산란원 모델을 이용한 기동 시나리오에서 제안된 알고리즘의 성능을 확인한다.

Evaluation of concrete compressive strength based on an improved PSO-LSSVM model

  • Xue, Xinhua
    • Computers and Concrete
    • /
    • 제21권5호
    • /
    • pp.505-511
    • /
    • 2018
  • This paper investigates the potential of a hybrid model which combines the least squares support vector machine (LSSVM) and an improved particle swarm optimization (IMPSO) techniques for prediction of concrete compressive strength. A modified PSO algorithm is employed in determining the optimal values of LSSVM parameters to improve the forecasting accuracy. Experimental data on concrete compressive strength in the literature were used to validate and evaluate the performance of the proposed IMPSO-LSSVM model. Further, predictions from five models (the IMPSO-LSSVM, PSO-LSSVM, genetic algorithm (GA) based LSSVM, back propagation (BP) neural network, and a statistical model) were compared with the experimental data. The results show that the proposed IMPSO-LSSVM model is a feasible and efficient tool for predicting the concrete compressive strength with high accuracy.

액적 충돌 현상기반 최적알고리즘의 비교 (Meta-Heuristic Algorithm Comparison for Droplet Impingements)

  • 문주현
    • 한국분무공학회지
    • /
    • 제28권4호
    • /
    • pp.161-168
    • /
    • 2023
  • Droplet impingement on solid surfaces is pivotal for a range of spray and heat transfer processes. This study aims to optimize the cooling performance of single droplet impingement on heated textured surfaces. We focused on maximizing the cooling effectiveness or the total contact area at the droplet maximum spread. For efficient estimation of the optimal values of the unknown variables, we introduced an enhanced Genetic Algorithm (GA) and Particle swarm optimization algorithm (PSO). These novel algorithms incorporate its developed theoretical backgrounds to compare proper optimized results. The comparison, considering the peak values of objective functions, computation durations, and the count of penalty particles, confirmed that PSO method offers swifter and more efficient searches, compared to GA algorithm, contributing finding the effective way for the spray and droplet impingement process.

A Hybrid PSO-BPSO Based Kernel Extreme Learning Machine Model for Intrusion Detection

  • Shen, Yanping;Zheng, Kangfeng;Wu, Chunhua
    • Journal of Information Processing Systems
    • /
    • 제18권1호
    • /
    • pp.146-158
    • /
    • 2022
  • With the success of the digital economy and the rapid development of its technology, network security has received increasing attention. Intrusion detection technology has always been a focus and hotspot of research. A hybrid model that combines particle swarm optimization (PSO) and kernel extreme learning machine (KELM) is presented in this work. Continuous-valued PSO and binary PSO (BPSO) are adopted together to determine the parameter combination and the feature subset. A fitness function based on the detection rate and the number of selected features is proposed. The results show that the method can simultaneously determine the parameter values and select features. Furthermore, competitive or better accuracy can be obtained using approximately one quarter of the raw input features. Experiments proved that our method is slightly better than the genetic algorithm-based KELM model.

An integrated particle swarm optimizer for optimization of truss structures with discrete variables

  • Mortazavi, Ali;Togan, Vedat;Nuhoglu, Ayhan
    • Structural Engineering and Mechanics
    • /
    • 제61권3호
    • /
    • pp.359-370
    • /
    • 2017
  • This study presents a particle swarm optimization algorithm integrated with weighted particle concept and improved fly-back technique. The rationale behind this integration is to utilize the affirmative properties of these new terms to improve the search capability of the standard particle swarm optimizer. Improved fly-back technique introduced in this study can be a proper alternative for widely used penalty functions to handle existing constraints. This technique emphasizes the role of the weighted particle on escaping from trapping into local optimum(s) by utilizing a recursive procedure. On the other hand, it guaranties the feasibility of the final solution by rejecting infeasible solutions throughout the optimization process. Additionally, in contrast with penalty method, the improved fly-back technique does not contain any adjustable terms, thus it does not inflict any extra ad hoc parameters to the main optimizer algorithm. The improved fly-back approach, as independent unit, can easily be integrated with other optimizers to handle the constraints. Consequently, to evaluate the performance of the proposed method on solving the truss weight minimization problems with discrete variables, several benchmark examples taken from the technical literature are examined using the presented method. The results obtained are comparatively reported through proper graphs and tables. Based on the results acquired in this study, it can be stated that the proposed method (integrated particle swarm optimizer, iPSO) is competitive with other metaheuristic algorithms in solving this class of truss optimization problems.

Weighted sum multi-objective optimization of skew composite laminates

  • Kalita, Kanak;Ragavendran, Uvaraja;Ramachandran, Manickam;Bhoi, Akash Kumar
    • Structural Engineering and Mechanics
    • /
    • 제69권1호
    • /
    • pp.21-31
    • /
    • 2019
  • Optimizing composite structures to exploit their maximum potential is a realistic application with promising returns. In this research, simultaneous maximization of the fundamental frequency and frequency separation between the first two modes by optimizing the fiber angles is considered. A high-fidelity design optimization methodology is developed by combining the high-accuracy of finite element method with iterative improvement capability of metaheuristic algorithms. Three powerful nature-inspired optimization algorithms viz. a genetic algorithm (GA), a particle swarm optimization (PSO) variant and a cuckoo search (CS) variant are used. Advanced memetic features are incorporated in the PSO and CS to form their respective variants-RPSOLC (repulsive particle swarm optimization with local search and chaotic perturbation) and CHP (co-evolutionary host-parasite). A comprehensive set of benchmark solutions on several new problems are reported. Statistical tests and comprehensive assessment of the predicted results show CHP comprehensively outperforms RPSOLC and GA, while RPSOLC has a little superiority over GA. Extensive simulations show that the on repeated trials of the same experiment, CHP has very low variability. About 50% fewer variations are seen in RPSOLC as compared to GA on repeated trials.