• Title/Summary/Keyword: PSO(Particle Swarm Optimization)

Search Result 492, Processing Time 0.034 seconds

Applying Particle Swarm Optimization for Enhanced Clustering of DNA Chip Data (DNA Chip 데이터의 군집화 성능 향상을 위한 Particle Swarm Optimization 알고리즘의 적용기법)

  • Lee, Min-Soo
    • The KIPS Transactions:PartD
    • /
    • v.17D no.3
    • /
    • pp.175-184
    • /
    • 2010
  • Experiments and research on genes have become very convenient by using DNA chips, which provide large amounts of data from various experiments. The data provided by the DNA chips could be represented as a two dimensional matrix, in which one axis represents genes and the other represents samples. By performing an efficient and good quality clustering on such data, the classification work which follows could be more efficient and accurate. In this paper, we use a bio-inspired algorithm called the Particle Swarm Optimization algorithm to propose an efficient clustering mechanism for large amounts of DNA chip data, and show through experimental results that the clustering technique using the PSO algorithm provides a faster yet good quality result compared with other existing clustering solutions.

An Improved TDoA Localization with Particle Swarm Optimization in UWB Systems (UWB 시스템에서 Particle Swarm Optimization을 이용하는 향상된 TDoA 무선측위)

  • Le, Tan N.;Kim, Jae-Woon;Shin, Yo-An
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1C
    • /
    • pp.87-95
    • /
    • 2010
  • In this paper, we propose an improved TDoA (Time Difference of Arrival) localization scheme using PSO (Particle Swarm Optimization) in UWB (Ultra Wide Band) systems. The proposed scheme is composed of two steps: re-estimation of TDoA parameters and re-localization of a tag position. In both steps, the PSO algorithm is employed to improve the performance. In the first step, the proposed scheme re-estimates the TDoA parameters obtained by traditional TDoA localization to reduce the TDoA estimation error. In the second step, the proposed scheme with the TDoA parameters estimated in the first step, re-localizes the tag to minimize the location error. The simulation results show that the proposed scheme achieves a more superior location performance to the traditional TDoA localization in both LoS (Line-of-Sight) and NLoS (Non-Line-of-Sight) channel environments.

Photovoltaic System Allocation Using Discrete Particle Swarm Optimization with Multi-level Quantization

  • Song, Hwa-Chang;Diolata, Ryan;Joo, Young-Hoon
    • Journal of Electrical Engineering and Technology
    • /
    • v.4 no.2
    • /
    • pp.185-193
    • /
    • 2009
  • This paper presents a methodology for photovoltaic (PV) system allocation in distribution systems using a discrete particle swarm optimization (DPSO). The PV allocation problem is in the category of mixed integer nonlinear programming and its formulation may include multi-valued dis-crete variables. Thus, the PSO requires a scheme to deal with multi-valued discrete variables. This paper introduces a novel multi-level quantization scheme using a sigmoid function for discrete particle swarm optimization. The technique is employed to a standard PSO architecture; the same velocity update equation as in continuous versions of PSO is used but the particle's positions are updated in an alternative manner. The set of multi-level quantization is defined as integer multiples of powers-of-two terms to efficiently approximate the sigmoid function in transforming a particle's position into discrete values. A comparison with a genetic algorithm (GA) is performed to verify the quality of the solutions obtained.

An Improved Particle Swarm Optimization Adopting Chaotic Sequences for Nonconvex Economic Dispatch Problems (개선된 PSO 기법을 적용한 전력계통의 경제급전)

  • Jeong, Yun-Won;Park, Jong-Bae;Cho, Ki-Seon;Kim, Hyeong-Jung;Shin, Joong-Rin
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.56 no.6
    • /
    • pp.1023-1030
    • /
    • 2007
  • This paper presents a new and efficient approach for solving the economic dispatch (ED) problems with nonconvex cost functions using particle swarm optimization (PSO). Although the PSO is easy to implement and has been empirically shown to perform well on many optimization problems, it may easily get trapped in a local optimum when solving problems with multiple local optima and heavily constrained. This paper proposes an improved PSO, which combines the conventional PSO with chaotic sequences (CPSO). The chaotic sequences combined with the linearly decreasing inertia weights in PSO are devised to improve the global searching capability and escaping from local minimum. To verify the feasibility of the proposed method, numerical studies have been performed for two different nonconvex ED test systems and its results are compared with those of previous works. The proposed CPSO algorithm outperforms other state-of-the-art algorithms in solving ED problems, which consider valve-point and multi-fuels with valve-point effects.

Improved Performance of Permanent Magnet Synchronous Motor by using Particle Swarm Optimization Techniques

  • Elwer, A.S.;Wahsh, S.A.
    • Journal of Power Electronics
    • /
    • v.9 no.2
    • /
    • pp.207-214
    • /
    • 2009
  • This paper presents a modem approach for speed control of a PMSM using the Particle Swarm Optimization (PSO) algorithm to optimize the parameters of the PI-Controller. The overall system simulated under various operating conditions and an experimental setup is prepared. The use of PSO as an optimization algorithm makes the drive robust, with faster dynamic response, higher accuracy and insensitive to load variation. Comparison between different controllers is achieved, using a PI controller which is tuned by two methods, firstly manually and secondly using the PSO technique. The system is tested under variable operating conditions. Implementation of the experimental setup is done. The simulation results show good dynamic response with fast recovery time and good agreement with experimental controller.

Classification of Induction Machine Faults using Time Frequency Representation and Particle Swarm Optimization

  • Medoued, A.;Lebaroud, A.;Laifa, A.;Sayad, D.
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.1
    • /
    • pp.170-177
    • /
    • 2014
  • This paper presents a new method of classification of the induction machine faults using Time Frequency Representation, Particle Swarm Optimization and artificial neural network. The essence of the feature extraction is to project from faulty machine to a low size signal time-frequency representation (TFR), which is deliberately designed for maximizing the separability between classes, a distinct TFR is designed for each class. The feature vectors size is optimized using Particle Swarm Optimization method (PSO). The classifier is designed using an artificial neural network. This method allows an accurate classification independently of load level. The introduction of the PSO in the classification procedure has given good results using the reduced size of the feature vectors obtained by the optimization process. These results are validated on a 5.5-kW induction motor test bench.

Control of the pressurized water nuclear reactors power using optimized proportional-integral-derivative controller with particle swarm optimization algorithm

  • Mousakazemi, Seyed Mohammad Hossein;Ayoobian, Navid;Ansarifar, Gholam Reza
    • Nuclear Engineering and Technology
    • /
    • v.50 no.6
    • /
    • pp.877-885
    • /
    • 2018
  • Various controllers such as proportional-integral-derivative (PID) controllers have been designed and optimized for load-following issues in nuclear reactors. To achieve high performance, gain tuning is of great importance in PID controllers. In this work, gains of a PID controller are optimized for power-level control of a typical pressurized water reactor using particle swarm optimization (PSO) algorithm. The point kinetic is used as a reactor power model. In PSO, the objective (cost) function defined by decision variables including overshoot, settling time, and stabilization time (stability condition) must be minimized (optimized). Stability condition is guaranteed by Lyapunov synthesis. The simulation results demonstrated good stability and high performance of the closed-loop PSO-PID controller to response power demand.

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.

Design of Solving Similarity Recognition for Cloth Products Based on Fuzzy Logic and Particle Swarm Optimization Algorithm

  • Chang, Bae-Muu
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.10
    • /
    • pp.4987-5005
    • /
    • 2017
  • This paper introduces a new method to solve Similarity Recognition for Cloth Products, which is based on Fuzzy logic and Particle swarm optimization algorithm. For convenience, it is called the SRCPFP method hereafter. In this paper, the SRCPFP method combines Fuzzy Logic (FL) and Particle Swarm Optimization (PSO) algorithm to solve similarity recognition for cloth products. First, it establishes three features, length, thickness, and temperature resistance, respectively, for each cloth product. Subsequently, these three features are engaged to construct a Fuzzy Inference System (FIS) which can find out the similarity between a query cloth and each sampling cloth in the cloth database D. At the same time, the FIS integrated with the PSO algorithm can effectively search for near optimal parameters of membership functions in eight fuzzy rules of the FIS for the above similarities. Finally, experimental results represent that the SRCPFP method can realize a satisfying recognition performance and outperform other well-known methods for similarity recognition under considerations here.

HS-PSO Hybrid Optimization Algorithm for HS Performance Improvement (HS 성능 향상을 위한 HS-PSO 하이브리드 최적화 알고리즘)

  • Tae-Bong Lee
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.16 no.4
    • /
    • pp.203-209
    • /
    • 2023
  • Harmony search(HS) does not use the evaluation of individual harmony when referring to HM when constructing a new harmony, but particle swarm optimization(PSO), on the contrary, uses the evaluation value of individual particles and the evaluation value of the population to find a solution. However, in this study, we tried to improve the performance of the algorithm by finding and identifying similarities between HS and PSO and applying the particle improvement process of PSO to HS. To apply the PSO algorithm, the local best of individual particles and the global best of the swam are required. In this study, the process of HS improving the worst harmony in harmony memory(HM) was viewed as a process very similar to that of PSO. Therefore, the worst harmony of HM was regarded as the local best of a particle, and the best harmony was regarded as the global best of swam. In this way, the performance of the HS was improved by introducing the particle improvement process of the PSO into the HS harmony improvement process. The results of this study were confirmed by comparing examples of optimization values for various functions. As a result, it was found that the suggested HS-PSO was much better than the existing HS in terms of accuracy and consistency.