• Title/Summary/Keyword: particle swarm optimization algorithm

Search Result 461, Processing Time 0.021 seconds

Phasor Discrete Particle Swarm Optimization Algorithm to Configure Micro-grids

  • Bae, In-Su;Kim, Jin-O
    • Journal of Electrical Engineering and Technology
    • /
    • v.7 no.1
    • /
    • pp.9-16
    • /
    • 2012
  • The present study presents the Phasor Discrete Particle Swarm Optimization (PDPSO) algorithm, an effective optimization technique, the multi-dimensional vectors of which consist of magnitudes and phase angles. PDPSO is employed in the configuration of micro-grids. Micro-grids are concepts of distribution system that directly unifies customers and distributed generations (DGs). Micro-grids could supply electric power to customers and conduct power transaction via a power market by operating economic dispatch of diverse cost functions through several DGs. If a large number of micro-grids exist in one distribution system, the algorithm needs to adjust the configuration of numerous micro-grids in order to supply electric power with minimum generation cost for all customers under the distribution system.

Enhancement OLSR Routing Protocol using Particle Swarm Optimization (PSO) and Genrtic Algorithm (GA) in MANETS

  • Addanki, Udaya Kumar;Kumar, B. Hemantha
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.4
    • /
    • pp.131-138
    • /
    • 2022
  • A Mobile Ad-hoc Network (MANET) is a collection of moving nodes that communicate and collaborate without relying on a pre-existing infrastructure. In this type of network, nodes can freely move in any direction. Routing in this sort of network has always been problematic because of the mobility of nodes. Most existing protocols use simple routing algorithms and criteria, while another important criterion is path selection. The existing protocols should be optimized to resolve these deficiencies. 'Particle Swarm Optimization (PSO)' is an influenced method as it resembles the social behavior of a flock of birds. Genetic algorithms (GA) are search algorithms that use natural selection and genetic principles. This paper applies these optimization models to the OLSR routing protocol and compares their performances across different metrics and varying node sizes. The experimental analysis shows that the Genetic Algorithm is better compared to PSO. The comparison was carried out with the help of the simulation tool NS2, NAM (Network Animator), and xgraph, which was used to create the graphs from the trace files.

PSO-optimized Pareto and Nash equilibrium gaming-based power allocation technique for multistatic radar network

  • Harikala, Thoka;Narayana, Ravinutala Satya
    • ETRI Journal
    • /
    • v.43 no.1
    • /
    • pp.17-30
    • /
    • 2021
  • At present, multiple input multiple output radars offer accurate target detection and better target parameter estimation with higher resolution in high-speed wireless communication systems. This study focuses primarily on power allocation to improve the performance of radars owing to the sparsity of targets in the spatial velocity domain. First, the radars are clustered using the kernel fuzzy C-means algorithm. Next, cooperative and noncooperative clusters are extracted based on the distance measured using the kernel fuzzy C-means algorithm. The power is allocated to cooperative clusters using the Pareto optimality particle swarm optimization algorithm. In addition, the Nash equilibrium particle swarm optimization algorithm is used for allocating power in the noncooperative clusters. The process of allocating power to cooperative and noncooperative clusters reduces the overall transmission power of the radars. In the experimental section, the proposed method obtained the power consumption of 0.014 to 0.0119 at K = 2, M = 3 and K = 2, M = 3, which is better compared to the existing methodologies-generalized Nash game and cooperative and noncooperative game theory.

Improved Particle Swarm Optimization Algorithm for Adaptive Beam Forming System (적응형 빔 형성 시스템을 위한 개선된 개체 군집 최적화 알고리즘)

  • Jung, Jin-Woo
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.13 no.3
    • /
    • pp.587-592
    • /
    • 2018
  • An adaptive beam forming system using a phased array antenna improves communication quality by beam forming adaptively to a communication environment having an interference signal. For adaptive beam forming, a good combination of the phases of the excited signals to each radiating element of the phased array antenna should be calculated. In this paper, improved particle swarm optimization algorithm that adds a re-spreading procedure according to particle density was proposed to increase the probability of good phase shift combination output.

Bi-dimensional Empirical Mode Decomposition Algorithm Based on Particle Swarm-Fractal Interpolation

  • An, Feng-Ping;He, Xin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.12
    • /
    • pp.5955-5977
    • /
    • 2018
  • Performance of the interpolation algorithm used in the technique of bi-dimensional empirical mode decomposition directly affects its popularization and application, so that the researchers pay more attention to the algorithm reasonable, accurate and fast. However, it has been a lack of an adaptive interpolation algorithm that is relatively satisfactory for the bi-dimensional empirical mode decomposition (BEMD) and is derived from the image characteristics. In view of this, this paper proposes an image interpolation algorithm based on the particle swarm and fractal. Its procedure includes: to analyze the given image by using the fractal brown function, to pick up the feature quantity from the image, and then to operate the adaptive image interpolation in terms of the obtained feature quantity. All parameters involved in the interpolation process are determined by using the particle swarm optimization algorithm. The presented interpolation algorithm can solve those problems of low efficiency and poor precision in the interpolation operation of bi-dimensional empirical mode decomposition and can also result in accurate and reliable bi-dimensional intrinsic modal functions with higher speed in the decomposition of the image. It lays the foundation for the further popularization and application of the bi-dimensional empirical mode decomposition algorithm.

Modified Particle Swarm Optimization with Time Varying Acceleration Coefficients for Economic Load Dispatch with Generator Constraints

  • Abdullah, M.N.;Bakar, A.H.A;Rahim, N.A.;Mokhlis, H.;Illias, H.A.;Jamian, J.J.
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.1
    • /
    • pp.15-26
    • /
    • 2014
  • This paper proposes a Modified Particle Swarm Optimization with Time Varying Acceleration Coefficients (MPSO-TVAC) for solving economic load dispatch (ELD) problem. Due to prohibited operating zones (POZ) and ramp rate limits of the practical generators, the ELD problems become nonlinear and nonconvex optimization problem. Furthermore, the ELD problem may be more complicated if transmission losses are considered. Particle swarm optimization (PSO) is one of the famous heuristic methods for solving nonconvex problems. However, this method may suffer to trap at local minima especially for multimodal problem. To improve the solution quality and robustness of PSO algorithm, a new best neighbour particle called 'rbest' is proposed. The rbest provides extra information for each particle that is randomly selected from other best particles in order to diversify the movement of particle and avoid premature convergence. The effectiveness of MPSO-TVAC algorithm is tested on different power systems with POZ, ramp-rate limits and transmission loss constraints. To validate the performances of the proposed algorithm, comparative studies have been carried out in terms of convergence characteristic, solution quality, computation time and robustness. Simulation results found that the proposed MPSO-TVAC algorithm has good solution quality and more robust than other methods reported in previous work.

A hybrid CSS and PSO algorithm for optimal design of structures

  • Kaveh, A.;Talatahari, S.
    • Structural Engineering and Mechanics
    • /
    • v.42 no.6
    • /
    • pp.783-797
    • /
    • 2012
  • A new hybrid meta-heuristic optimization algorithm is presented for design of structures. The algorithm is based on the concepts of the charged system search (CSS) and the particle swarm optimization (PSO) algorithms. The CSS is inspired by the Coulomb and Gauss's laws of electrostatics in physics, the governing laws of motion from the Newtonian mechanics, and the PSO is based on the swarm intelligence and utilizes the information of the best fitness historically achieved by the particles (local best) and by the best among all the particles (global best). In the new hybrid algorithm, each agent is affected by local and global best positions stored in the charged memory considering the governing laws of electrical physics. Three different types of structures are optimized as the numerical examples with the new algorithm. Comparison of the results of the hybrid algorithm with those of other meta-heuristic algorithms proves the robustness of the new algorithm.

A Study on Feature Selection in Face Image Using Principal Component Analysis and Particle Swarm Optimization Algorithm (PCA와 입자 군집 최적화 알고리즘을 이용한 얼굴이미지에서 특징선택에 관한 연구)

  • Kim, Woong-Ki;Oh, Sung-Kwun;Kim, Hyun-Ki
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.12
    • /
    • pp.2511-2519
    • /
    • 2009
  • In this paper, we introduce the methodological system design via feature selection using Principal Component Analysis and Particle Swarm Optimization algorithms. The overall methodological system design comes from three kinds of modules such as preprocessing module, feature extraction module, and recognition module. First, Histogram equalization enhance the quality of image by exploiting contrast effect based on the normalized function generated from histogram distribution values of 2D face image. Secondly, PCA extracts feature vectors to be used for face recognition by using eigenvalues and eigenvectors obtained from covariance matrix. Finally the feature selection for face recognition among the entire feature vectors is considered by means of the Particle Swarm Optimization. The optimized Polynomial-based Radial Basis Function Neural Networks are used to evaluate the face recognition performance. This study shows that the proposed methodological system design is effective to the analysis of preferred face recognition.

Advanced Particle Swarm Optimization Technique for Fuzzy Time Series Forecasting (퍼지 시계열 예측을 위한 개선된 Particle Swarm Optimization 기법)

  • Park, Jin-Il;Lee, Dae-Jong;Jeon, Myeong-Geun
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2008.04a
    • /
    • pp.11-12
    • /
    • 2008
  • 퍼지 시계열 예측은 전체 퍼지 구간에 따른 퍼지 소속 함수의 개수와 범위에 따라서 예측성능에 많은 영향을 미치고 있으며, 이러한 문제점을 개선하기 위한 방법으로 다수 객체들의 학습 및 군집 특성을 이용한 Particle Swarm Optimization기법을 도입하였다. 제안된 방법에서는 군집의 최적 객체를 전체 최적해와 각각의 퍼지 소속 함수들에 대한 최적해로 구분하여 탐색하는 기법을 제안한다. 실제 시계열 데이터를 이용한 실험을 통하여 기존의 연구 결과들과 비교함으로써 제안된 방법의 우수한 성능을 가짐을 검증하였다.

  • PDF

A Position Control of Seesaw System using Particle Swarm Optimization - PID Controller (PSO-PID를 이용한 시소 시스템의 위치제어)

  • Son, Yong Doo;Son, Jun Ik;Choo, Yeon Gyu;Lim, Young Do
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2009.05a
    • /
    • pp.185-188
    • /
    • 2009
  • In this paper, Position Controller for balance of Seesaw System design using PID Algorithm. Seesaw System is that it's system use widely to analyze of ship or flight dynamics, Inverted Pendulumand, Robot System, manage system for theory of modern control system and all sorts of analysis. In case of Seesaw System, it's necessity that understand and analysis of system and correct selection of parameter because the system is strong nonlinear control system. It guarantees efficiency and stability to adapt quickly for disturbance or change of controller from PID Algorithm of guarantee safe from simple and long history and PSO(Particle Swarm Optimization) that sort of metaheuristic optimization that need to accuracy and fast PID parameter tuning.

  • PDF