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

검색결과 470건 처리시간 0.031초

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
    • /
    • 제22권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 알고리즘을 이용한 퍼지 Extreme Learning Machine 최적화 (Optimization of Fuzzy Learning Machine by Using Particle Swarm Optimization)

  • 노석범;왕계홍;김용수;안태천
    • 한국지능시스템학회논문지
    • /
    • 제26권1호
    • /
    • pp.87-92
    • /
    • 2016
  • 본 논문에서는 일반적인 신경회로망의 단점인 느린 학습속도를 획기적으로 개선한 네트워크인 Extreme Learning Machine과 전문가들의 언어적 정보들을 기술 할 수 있는 퍼지 이론을 접목한 퍼지 Extreme Learning Machine을 최적화하기 위하여 Particle Swarm Optimization 알고리즘을 이용하였다. 퍼지 Extreme Learning Machine의 활성화 함수를 일반적인 시그모이드 함수를 사용하지 않고, 퍼지 C-Means 클러스터링 알고리즘의 활성화 레벨 함수를 이용하였다. Particle Swarm Optimization 알고리즘과 같은 최적화 알고리즘을 통하여 퍼지 Extreme Learning Machine의 활성화 함수의 파라미터들을 최적화 한다. Particle Swarm Optimization과 같은 최적화 알고리즘을 통한 제안된 모델의 최적화 하고 최적화된 모델의 분류성능을 평가하기 위하여 다양한 머신 러닝 데이터 집합을 사용하여 평가한다.

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

  • Harikala, Thoka;Narayana, Ravinutala Satya
    • ETRI Journal
    • /
    • 제43권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)

  • 정진우
    • 한국전자통신학회논문지
    • /
    • 제13권3호
    • /
    • pp.587-592
    • /
    • 2018
  • 위상 배열 안테나를 이용한 적응형 빔 형성 시스템은 간섭신호가 있는 통신환경에 적응형으로 빔을 형성하여 통신 품질을 향상시킨다. 적응형 빔 형성을 위해서는 위상 배열 안테나의 각 방사소자에 급전되는 신호의 위상을 우수한 조합을 산출해야 한다. 본 논문에서는 우수한 위상 천이 조합 산출 확률을 증가시키기 위해, 개치 밀도에 따른 재확산 절차가 추가된 개선된 개체 군집 최적화 알고리즘을 제안하였다.

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)
    • /
    • 제12권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
    • /
    • 제9권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
    • /
    • 제42권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.

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

  • 김웅기;오성권;김현기
    • 전기학회논문지
    • /
    • 제58권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.

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

  • 박진일;이대종;전명근
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국지능시스템학회 2008년도 춘계학술대회 학술발표회 논문집
    • /
    • pp.11-12
    • /
    • 2008
  • 퍼지 시계열 예측은 전체 퍼지 구간에 따른 퍼지 소속 함수의 개수와 범위에 따라서 예측성능에 많은 영향을 미치고 있으며, 이러한 문제점을 개선하기 위한 방법으로 다수 객체들의 학습 및 군집 특성을 이용한 Particle Swarm Optimization기법을 도입하였다. 제안된 방법에서는 군집의 최적 객체를 전체 최적해와 각각의 퍼지 소속 함수들에 대한 최적해로 구분하여 탐색하는 기법을 제안한다. 실제 시계열 데이터를 이용한 실험을 통하여 기존의 연구 결과들과 비교함으로써 제안된 방법의 우수한 성능을 가짐을 검증하였다.

  • PDF

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

  • 손용두;손준익;추연규;임영도
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국해양정보통신학회 2009년도 춘계학술대회
    • /
    • pp.185-188
    • /
    • 2009
  • 이 논문에서는 PID 알고리즘을 이용하여 시소 시스템의 균형을 위한 위치 제어기를 설계하고자 한다. 시소 시스템은(Seesaw System) 선박 및 항공 역학, 도립진자, 각종 분석, 로봇 시스템 등의 해석에 광범위하게 응용되는 시스템이자 현대 제어 시스템의 이론과 각종 응용문제를 취급할 수 있는 장치이다. 시소 시스템의 경우 시스템이 비선형성이 강한 제어 대상이므로 시스템의 이해와 해석, 그리고 파라미터의 정확한 선정이 필수요소이다. 사용할 시스템 제어 알고리즘에는 간단하고 오랜 역사를 통해 안정성이 보장된 PID 알고리즘과 정확하고 빠른 PID 파라미터 동조에 필요한 연산 최적화 알고리즘인 PSO(Particle Swarm Optimization) 통해 외란이나 제어기의 변화에 빠르게 적응할 수 있도록 하여 성능과 안정성을 보장한다.

  • PDF