• Title/Summary/Keyword: improved particle swarm optimization

Search Result 99, Processing Time 0.028 seconds

Particle Swarm Optimization based on Vector Gaussian Learning

  • Zhao, Jia;Lv, Li;Wang, Hui;Sun, Hui;Wu, Runxiu;Nie, Jugen;Xie, Zhifeng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.4
    • /
    • pp.2038-2057
    • /
    • 2017
  • Gaussian learning is a new technology in the computational intelligence area. However, this technology weakens the learning ability of a particle swarm and achieves a lack of diversity. Thus, this paper proposes a vector Gaussian learning strategy and presents an effective approach, named particle swarm optimization based on vector Gaussian learning. The experiments show that the algorithm is more close to the optimal solution and the better search efficiency after we use vector Gaussian learning strategy. The strategy adopts vector Gaussian learning to generate the Gaussian solution of a swarm's optimal location, increases the learning ability of the swarm's optimal location, and maintains the diversity of the swarm. The method divides the states into normal and premature states by analyzing the state threshold of the swarm. If the swarm is in the premature category, the algorithm adopts an inertia weight strategy that decreases linearly in addition to vector Gaussian learning; otherwise, it uses a fixed inertia weight strategy. Experiments are conducted on eight well-known benchmark functions to verify the performance of the new approach. The results demonstrate promising performance of the new method in terms of convergence velocity and precision, with an improved ability to escape from a local optimum.

A Design and Analysis of Improved Firefly Algorithm Based on the Heuristic (휴리스틱에 의하여 개선된 반딧불이 알고리즘의 설계와 분석)

  • Rhee, Hyun-Sook;Lee, Jung-Woo;Oh, Kyung-Whan
    • The KIPS Transactions:PartB
    • /
    • v.18B no.1
    • /
    • pp.39-44
    • /
    • 2011
  • In this paper, we propose a method to improve the Firefly Algorithm(FA) introduced by Xin-She Yang, recently. We design and analyze the improved firefly algorithm based on the heuristic. We compare the FA with the Particle Swarm Optimization (PSO) which the problem domain is similar with the FA in terms of accuracy, algorithm convergence time, the motion of each particle. The compare experiments show that the accuracy of FA is not worse than PSO's, but the convergence time of FA is slower than PSO's. In this paper, we consider intuitive reasons of slow convergence time problem of FA, and propose the improved version of FA using a partial mutation heuristic based on the consideration. The experiments using benchmark functions show the accuracy and convergence time of the improved FA are better than them of PSO and original FA.

An Improved Particle Swarm Optimization for Economic Dispatch Problems with Prohibited Operating Zones (경제급전 문제에의 개선된 PSO 알고리즘 적용)

  • Jeong, Yun-Won;Lee, Woo-Nam;Kim, Hyun-Houng;Park, Jong-Bae;Shin, Joong-Rin
    • Proceedings of the KIEE Conference
    • /
    • 2007.07a
    • /
    • pp.850-851
    • /
    • 2007
  • This paper presents an efficient approach for solving the economic dispatch (ED) problems with prohibited operating zones using an improved particle swarm optimization (PSO). Although the PSO-based approaches have several advantages suitable to the heavily constrained nonconvex optimization problems, they still have the drawbacks such as local optimal trapping due to the premature convergence (i.e., exploration problem) and insufficient capability to find nearly-by extreme points (i.e., exploitation problem). This paper proposes an improved PSO framework adopting a crossover operation scheme to increase both exploration and exploitation capability of the PSO. The proposed method is applied to ED problem with prohibited operating zones. Also, the results are compared with those of the state-of-the-art methods.

  • PDF

Techno-Economic Optimization of a Grid-Connected Hybrid Energy System Considering Voltage Fluctuation

  • Saib, Samia;Gherbi, Ahmed;Kaabeche, Abdelhamid;Bayindir, Ramazan
    • Journal of Electrical Engineering and Technology
    • /
    • v.13 no.2
    • /
    • pp.659-668
    • /
    • 2018
  • This paper proposes an optimization approach of a grid-connected photovoltaic and wind hybrid energy system including energy storage considering voltage fluctuation in the electricity grid. A techno-economic analysis is carried out in order to minimize the size of hybrid system by considering the benefit-cost. Lithium-ion battery type is used for both managing the electricity selling to the grid and reducing voltage fluctuation. A new technique is developed to limit the voltage perturbation caused by the solar irradiance and the wind speed through determining the state-of-charge of battery for every hour of a day. Improved particle swarm optimization (PSO) methods, referred to as FC-VACPSO which combines Fast Convergence Particle Swarm Optimization (FCPSO) method and Variable Acceleration Coefficient Based Particle Swarm Optimization (VACPSO) method are used to solve the optimization problem. A comparative study has been performed between standard PSO method and PSO based methods to extract the best size with the benefit cost. A sensitivity analysis has been studied for different kinds and costs of batteries, by considering variable and constant state-ofcharge of battery. The simulations, performed under Matlab environment, yield good results using the FC-VACPSO method regarding the convergence and the benefit cost of the hybrid system.

Maximum Power Point Tracking of Photovoltaic using Improved Particle Swarm Optimization Algorithm (개선된 입자 무리 최적화 알고리즘 이용한 태양광 패널의 최대 전력점 추적)

  • Kim, Jae-Jung;Kim, Chang-Bok
    • Journal of Advanced Navigation Technology
    • /
    • v.24 no.4
    • /
    • pp.291-298
    • /
    • 2020
  • This study proposed a model that can track MPP faster than the existing MPPT algorithm using the particle swarm optimization algorithm (PSO). The proposed model highly sets the acceleration constants of gbest and pbest in the PSO algorithm to quickly track the MPP point and eliminates the power instability problem. In addition, this algorithm was re-executed by detecting the change in power of the solar panel according to the rapid change in solar radiation. As a result of the experiment, MPP time was 0.03 seconds and power was 131.65 for 691.5 W/m2, and MPP was tracked at higher power and speed than the existing P&O and INC algorithms. The proposed model can be applied when a change in the amount of power is detected by partial shading in a Photovoltaic power plant with Photovoltaic connected in parallel. In order to improve the MPPT algorithm, this study needs a comparative study on optimization algorithms such as moth flame optimization (MFO) and whale optimization algorithm (WOA).

Effective Design of Pixel-type Frequency Selective Surfaces using an Improved Binary Particle Swarm Optimization Algorithm (개선된 이진 입자 군집 최적화 알고리즘을 적용한 픽셀 형태 주파수 선택적 표면의 효율적인 설계방안 연구)

  • Yang, Dae-Do;Park, Chan-Sun;Yook, Jong-Gwan
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.30 no.4
    • /
    • pp.261-269
    • /
    • 2019
  • This study investigates a method of designing pixel-type frequency selective surfaces(FSS) with flexibility while considering factors, such as polarization and incident angle. Among the various methods used to solve the discrete space problem when designing a pixel-type FSS, the binary particle swarm optimization(BPSO) algorithm is one of the most applicable techniques to determine the periodic structure pattern of an FSS. Therefore, a method of efficiently designing FSS with roll-off band pass characteristics using an improved BPSO algorithm is proposed. To solve the convergence problem in the fitness function design to induce particles in the desired solution, FSS with desired roll-off wave characteristics can be easily obtained by applying a fitness function using "slope" as an input parameter.

The Effect of Sample and Particle Sizes in Discrete Particle Swarm Optimization for Simulation-based Optimization Problems (시뮬레이션 최적화 문제 해결을 위한 이산 입자 군집 최적화에서 샘플수와 개체수의 효과)

  • Yim, Dong-Soon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.1
    • /
    • pp.95-104
    • /
    • 2017
  • This paper deals with solution methods for discrete and multi-valued optimization problems. The objective function of the problem incorporates noise effects generated in case that fitness evaluation is accomplished by computer based experiments such as Monte Carlo simulation or discrete event simulation. Meta heuristics including Genetic Algorithm (GA) and Discrete Particle Swarm Optimization (DPSO) can be used to solve these simulation based multi-valued optimization problems. In applying these population based meta heuristics to simulation based optimization problem, samples size to estimate the expected fitness value of a solution and population (particle) size in a generation (step) should be carefully determined to obtain reliable solutions. Under realistic environment with restriction on available computation time, there exists trade-off between these values. In this paper, the effects of sample and population sizes are analyzed under well-known multi-modal and multi-dimensional test functions with randomly generated noise effects. From the experimental results, it is shown that the performance of DPSO is superior to that of GA. While appropriate determination of population sizes is more important than sample size in GA, appropriate determination of sample size is more important than particle size in DPSO. Especially in DPSO, the solution quality under increasing sample sizes with steps is inferior to constant or decreasing sample sizes with steps. Furthermore, the performance of DPSO is improved when OCBA (Optimal Computing Budget Allocation) is incorporated in selecting the best particle in each step. In applying OCBA in DPSO, smaller value of incremental sample size is preferred to obtain better solutions.

Parallelized Particle Swarm Optimization with GPU for Real-Time Ballistic Target Tracking (실시간 탄도 궤적 목표물 추적을 위한 GPU 기반 병렬적 입자군집최적화 기법)

  • Yunho, Han;Heoncheol, Lee;Hyeokhoon, Gwon;Wonseok, Choi;Bora, Jeong
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.17 no.6
    • /
    • pp.355-365
    • /
    • 2022
  • This paper addresses the problem of real-time tracking a high-speed ballistic target. Particle filters can be considered to overcome the nonlinearity in motion and measurement models in the ballistic target. However, it is difficult to apply particle filters to real-time systems because particle filters generally require much computation time. This paper proposes an accelerated particle filter using graphics processing unit (GPU) for real-time ballistic target tracking. The real-time performance of the proposed method was tested and analyzed on a widely-used embedded system. The comparison results with the conventional particle filter on CPU (central processing unit) showed that the proposed method improved the real-time performance by reducing computation time significantly.

Triangular units based method for simultaneous optimizations of planar trusses

  • Mortazavi, Ali;Togan, Vedat
    • Advances in Computational Design
    • /
    • v.2 no.3
    • /
    • pp.195-210
    • /
    • 2017
  • Simultaneous optimization of trusses which concurrently takes into account design variables related to the size, shape and topology of the structure is recognized as highly complex optimization problems. In this class of optimization problems, it is possible to encounter several unstable mechanisms throughout the solution process. However, to obtain a feasible solution, these unstable mechanisms somehow should be rejected from the set of candidate solutions. This study proposes triangular unit based method (TUBM) instead of ground structure method, which is conventionally used in the topology optimization, to decrease the complexity of search space of simultaneous optimization of the planar truss structures. TUBM considers stability of the triangular units for 2 dimensional truss systems. In addition, integrated particle swarm optimizer (iPSO) strengthened with robust technique so called improved fly-back mechanism is employed as the optimizer tool to obtain the solution for these class of problems. The results obtained in this study show the applicability and efficiency of the TUBM combined with iPSO for the simultaneous optimization of planar truss structures.

Optimal design of hydraulic support landing platform for a four-rotor dish-shaped UUV using particle swarm optimization

  • Zhang, Bao-Shou;Song, Bao-Wei;Jiang, Jun;Mao, Zhao-Yong
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.8 no.5
    • /
    • pp.475-486
    • /
    • 2016
  • Four-rotor dish-shaped unmanned underwater vehicles (FRDS UUVs) are new type underwater vehicles. The main goal of this paper is to develop a quick method to optimize the design of hydraulic support landing platform for the new UUV. In this paper, the geometry configuration and instability type of the platform are defined. Computational investigations are carried out to study the hydrodynamic performance of the landing platform using the Computational Fluid Dynamics (CFD) method. Then, the response surface model of the optimization objective is established. The intelligent particle swarm optimization (PSO) is applied to finding the optimal solution. The result demonstrates that the stability of landing platform is significantly improved with the global objective index increasing from 1.045 to 1.158 (10.86% higher) after the optimization process.