• 정보처리학회논문지D
• /
• 제17D권3호
• /
• pp.175-184
• /
• 2010

최근 DNA 칩의 등장으로 유전자 관련 실험과 연구가 매우 용이해졌으며 이를 활용한 다양한 실험 결과로 대량의 데이터가 제공되고 있다. DNA칩에 의해 제공된 데이터는 2차원 행렬로 표현되며 하나의 축은 유전자를 나타내고 다른 하나의 축은 샘플정보를 나타낸다. 이러한 데이터에 대하여 빠른 시간 안에 좋은 품질의 군집화를 수행함으로써 이후의 분석 단계인 분류화 작업의 정확도와 효율성을 높일 수 있다. 본 논문에서는 생태계 모방 알고리즘의 하나인 Particle Swarm Optimization 알고리즘을 사용하여 방대한 양의 DNA칩 데이터에 대한 효율적인 군집화 기법을 제안하였으며 실험을 통해서 PSO 기반의 군집화 알고리즘이 기존의 군집화 알고리즘들보다 수행속도 및 품질 면에서 우수한 성능을 가짐을 보였다.

• 한국통신학회논문지
• /
• 제35권1C호
• /
• pp.87-95
• /
• 2010

본 논문에서는 UWB (Ultra Wide Band) 시스템에서 PSO (Particle Swarm Optimization)를 사용하는 향상된 TDoA (Time Difference of Arrival) 무선측위 기법을 제안한다. 제안된 기법은 TDoA 파라미터 재추정과 태그(Tag) 위치 재측정을 수행하는 두 단계로 구성된다. 이들 두 단계에서 PSO 알고리즘은 무선측위 성능 향상을 위해 고용된다. 첫 번째 단계에서 TDoA 추정 오차를 줄이기 위해, 제안된 기법은 전형적인 TDoA 무선측위 방식으로부터 얻어진 TDoA 파라미터를 재추정한다. 두 번째 단계에서 무선측위 오차를 최소화시키기 위해, 첫 번째 단계에서 추정된 TDoA 파라미터를 가지고 제안된 기법은 태그의 위치를 다시 측정한다. 모의실험 결과, 제안된 기법은 LoS (Line-of-Sight)와 NLoS (Non-Line-of-Sight) 채널 환경에서 모두 전형적인 TDoA 무선측위 방식에 비해 우수한 무선측위 성능을 달성하는 것을 확인할 수 있었다.

• Journal of Electrical Engineering and Technology
• /
• 제4권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.

• 전기학회논문지
• /
• 제56권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.

• Journal of Power Electronics
• /
• 제9권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.

• Journal of Electrical Engineering and Technology
• /
• 제9권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.

• Nuclear Engineering and Technology
• /
• 제50권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.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권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.

• 한국정보전자통신기술학회논문지
• /
• 제16권4호
• /
• pp.203-209
• /
• 2023

Harmony search(HS)는 새로운 하모니를 구성할 때 HM을 참조하는 경우 개별 하모니의 평가를 이용하지 않지만 PSO(particle swarm optimization)는 개별 입자의 평가와 모집단의 평가를 이용하여 해를 찾아간다. 그러나 본 연구에서는 HS와 PSO의 유사점을 찾아 PSO의 입자 개선 과정을 HS에 적용하여 알고리즘의 성능을 향상시키고자 하였다. PSO 알고리즘을 적용하기 위해서는 개별 입자의 local best와 떼(swam)의 global best가 필요하다. 본 연구에서는 HS가 harmony memory(HM)에서 가장 나쁜 하모니을 개선하는 과정을 PSO와 매우 유사한 과정으로 보았다. 이에 따라 HM의 가장 나쁜 하모니를 입자의 PSO의 local best로, 가장 좋은 하모니는 PSO의 global best 최고로 간주하였다. 이와 같이 PSO의 입자 개선과정을 HS 하모니 개선과정에 도입하여 HS의 성능을 향상시킬 수 있었다. 본 연구의 결과는 다양한 함수에 대한 최적화 예시를 통해 비교 확인하였다. 그 결과 정확성과 일관성에 있어 기존 HS보다 제안한 HS-PSO가 매우 우수함을 알 수 있었다.