• Title/Summary/Keyword: improved particle swarm optimization

Search Result 99, Processing Time 0.032 seconds

A multi-layer approach to DN 50 electric valve fault diagnosis using shallow-deep intelligent models

  • Liu, Yong-kuo;Zhou, Wen;Ayodeji, Abiodun;Zhou, Xin-qiu;Peng, Min-jun;Chao, Nan
    • Nuclear Engineering and Technology
    • /
    • v.53 no.1
    • /
    • pp.148-163
    • /
    • 2021
  • Timely fault identification is important for safe and reliable operation of the electric valve system. Many research works have utilized different data-driven approach for fault diagnosis in complex systems. However, they do not consider specific characteristics of critical control components such as electric valves. This work presents an integrated shallow-deep fault diagnostic model, developed based on signals extracted from DN50 electric valve. First, the local optimal issue of particle swarm optimization algorithm is solved by optimizing the weight search capability, the particle speed, and position update strategy. Then, to develop a shallow diagnostic model, the modified particle swarm algorithm is combined with support vector machine to form a hybrid improved particle swarm-support vector machine (IPs-SVM). To decouple the influence of the background noise, the wavelet packet transform method is used to reconstruct the vibration signal. Thereafter, the IPs-SVM is used to classify phase imbalance and damaged valve faults, and the performance was evaluated against other models developed using the conventional SVM and particle swarm optimized SVM. Secondly, three different deep belief network (DBN) models are developed, using different acoustic signal structures: raw signal, wavelet transformed signal and time-series (sequential) signal. The models are developed to estimate internal leakage sizes in the electric valve. The predictive performance of the DBN and the evaluation results of the proposed IPs-SVM are also presented in this paper.

A Study on Identification using Particle Swarm Optimization for 3-DOF Helicopter System (3-자유도 헬리콥터 시스템의 입자군집최적화 기법을 이용한 시스템 식별)

  • Lee, Ho-Woon;Kim, Tae-Woo;Kim, Tae-Hyoung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.25 no.2
    • /
    • pp.105-110
    • /
    • 2015
  • This study proposes the more improved mathematical model than conventional that for the 3-DOF Helicopter System in Quanser Inc., and checks the validity about the proposed model by performance comparison between the controller based on the conventional model and that based on the proposed model. Research process is next : First, analyze the dynamics for the 3-DOF helicopter system and establish the linear mathematical model. Second, check the eliminated nonlinear-elements in linearization process for establishing the linear mathematical model. And establish the improved mathematical model including the parameters corresponding to the eliminated nonlinear-elements. At that time, it is used for modeling that Particle Swarm Optimization algorithm the meta-heuristic global optimization method. Finally, design the controller based on the proposed model, and verify the validity of the proposed model by comparison about the experimental results between the designed controller and the controller based on the conventional model.

PMDV-hop: An effective range-free 3D localization scheme based on the particle swarm optimization in wireless sensor network

  • Wang, Wenjuan;Yang, Yuwang;Wang, Lei;Lu, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.61-80
    • /
    • 2018
  • Location information of individual nodes is important in the implementation of necessary network functions. While extensive studies focus on localization techniques in 2D space, few approaches have been proposed for 3D positioning, which brings the location closer to the reality with more complex calculation consumptions for high accuracy. In this paper, an effective range-free localization scheme is proposed for 3D space localization, and the sensitivity of parameters is evaluated. Firstly, we present an improved algorithm (MDV-Hop), that the average distance per hop of the anchor nodes is calculated by root-mean-square error (RMSE), and is dynamically corrected in groups with the weighted RMSE based on group hops. For more improvement in accuracy, we expand particle swarm optimization (PSO) of intelligent optimization algorithms to MDV-Hop localization algorithm, called PMDV-hop, in which the parameters (inertia weight and trust coefficient) in PSO are calculated dynamically. Secondly, the effect of various localization parameters affecting the PMDV-hop performance is also present. The simulation results show that PMDV-hop performs better in positioning accuracy with limited energy.

An Improved Particle Swarm Optimization Algorithm for Care Worker Scheduling

  • Akjiratikarl, Chananes;Yenradee, Pisal;Drake, Paul R.
    • Industrial Engineering and Management Systems
    • /
    • v.7 no.2
    • /
    • pp.171-181
    • /
    • 2008
  • Home care, known also as domiciliary care, is part of the community care service that is a responsibility of the local government authorities in the UK as well as many other countries around the world. The aim is to provide the care and support needed to assist people, particularly older people, people with physical or learning disabilities and people who need assistance due to illness to live as independently as possible in their own homes. It is performed primarily by care workers visiting clients' homes where they provide help with daily activities. This paper is concerned with the dispatching of care workers to clients in an efficient manner. The optimized routine for each care worker determines a schedule to achieve the minimum total cost (in terms of distance traveled) without violating the capacity and time window constraints. A collaborative population-based meta-heuristic called Particle Swarm Optimization (PSO) is applied to solve the problem. A particle is defined as a multi-dimensional point in space which represents the corresponding schedule for care workers and their clients. Each dimension of a particle represents a care activity and the corresponding, allocated care worker. The continuous position value of each dimension determines the care worker to be assigned and also the assignment priority. A heuristic assignment scheme is specially designed to transform the continuous position value to the discrete job schedule. This job schedule represents the potential feasible solution to the problem. The Earliest Start Time Priority with Minimum Distance Assignment (ESTPMDA) technique is developed for generating an initial solution which guides the search direction of the particle. Local improvement procedures (LIP), insertion and swap, are embedded in the PSO algorithm in order to further improve the quality of the solution. The proposed methodology is implemented, tested, and compared with existing solutions for some 'real' problem instances.

Application of Resampling Method based on Statistical Hypothesis Test for Improving the Performance of Particle Swarm Optimization in a Noisy Environment (노이즈 환경에서 입자 군집 최적화 알고리즘의 성능 향상을 위한 통계적 가설 검정 기반 리샘플링 기법의 적용)

  • Choi, Seon Han
    • Journal of the Korea Society for Simulation
    • /
    • v.28 no.4
    • /
    • pp.21-32
    • /
    • 2019
  • Inspired by the social behavior models of a bird flock or fish school, particle swarm optimization (PSO) is a popular metaheuristic optimization algorithm and has been widely used from solving a complex optimization problem to learning a artificial neural network. However, PSO is difficult to apply to many real-life optimization problems involving stochastic noise, since it is originated in a deterministic environment. To resolve this problem, this paper incorporates a resampling method called the uncertainty evaluation (UE) method into PSO. The UE method allows the particles to converge on the accurate optimal solution quickly in a noisy environment by selecting the particles' global best position correctly, one of the significant factors in the performance of PSO. The results of comparative experiments on several benchmark problems demonstrated the improved performance of the propose algorithm compared to the existing studies. In addition, the results of the case study emphasize the necessity of this work. The proposed algorithm is expected to be effectively applied to optimize complex systems through digital twins in the fourth industrial revolution.

Optimal Location of FACTS Devices Using Adaptive Particle Swarm Optimization Hybrid with Simulated Annealing

  • Ajami, Ali;Aghajani, Gh.;Pourmahmood, M.
    • Journal of Electrical Engineering and Technology
    • /
    • v.5 no.2
    • /
    • pp.179-190
    • /
    • 2010
  • This paper describes a new stochastic heuristic algorithm in engineering problem optimization especially in power system applications. An improved particle swarm optimization (PSO) called adaptive particle swarm optimization (APSO), mixed with simulated annealing (SA), is introduced and referred to as APSO-SA. This algorithm uses a novel PSO algorithm (APSO) to increase the convergence rate and incorporate the ability of SA to avoid being trapped in a local optimum. The APSO-SA algorithm efficiency is verified using some benchmark functions. This paper presents the application of APSO-SA to find the optimal location, type and size of flexible AC transmission system devices. Two types of FACTS devices, the thyristor controlled series capacitor (TCSC) and the static VAR compensator (SVC), are considered. The main objectives of the presented method are increasing the voltage stability index and over load factor, decreasing the cost of investment and total real power losses in the power system. In this regard, two cases are considered: single-type devices (same type of FACTS devices) and multi-type devices (combination of TCSC, SVC). Using the proposed method, the locations, type and sizes of FACTS devices are obtained to reach the optimal objective function. The APSO-SA is used to solve the above non.linear programming optimization problem for better accuracy and fast convergence and its results are compared with results of conventional PSO. The presented method expands the search space, improves performance and accelerates to the speed convergence, in comparison with the conventional PSO algorithm. The optimization results are compared with the standard PSO method. This comparison confirms the efficiency and validity of the proposed method. The proposed approach is examined and tested on IEEE 14 bus systems by MATLAB software. Numerical results demonstrate that the APSO-SA is fast and has a much lower computational cost.

Mobile User Interface Pattern Clustering Using Improved Semi-Supervised Kernel Fuzzy Clustering Method

  • Jia, Wei;Hua, Qingyi;Zhang, Minjun;Chen, Rui;Ji, Xiang;Wang, Bo
    • Journal of Information Processing Systems
    • /
    • v.15 no.4
    • /
    • pp.986-1016
    • /
    • 2019
  • Mobile user interface pattern (MUIP) is a kind of structured representation of interaction design knowledge. Several studies have suggested that MUIPs are a proven solution for recurring mobile interface design problems. To facilitate MUIP selection, an effective clustering method is required to discover hidden knowledge of pattern data set. In this paper, we employ the semi-supervised kernel fuzzy c-means clustering (SSKFCM) method to cluster MUIP data. In order to improve the performance of clustering, clustering parameters are optimized by utilizing the global optimization capability of particle swarm optimization (PSO) algorithm. Since the PSO algorithm is easily trapped in local optima, a novel PSO algorithm is presented in this paper. It combines an improved intuitionistic fuzzy entropy measure and a new population search strategy to enhance the population search capability and accelerate the convergence speed. Experimental results show the effectiveness and superiority of the proposed clustering method.

Optimal Power Flow of DC-Grid Based on Improved PSO Algorithm

  • Liu, Xianzheng;Wang, Xingcheng;Wen, Jialiang
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.4
    • /
    • pp.1586-1592
    • /
    • 2017
  • Voltage sourced converter (VSC) based direct-current (DC) grid has the ability to control power flow flexibly and securely, thus it has become one of the most valid approaches in aspect of large-scale renewable power generation, oceanic island power supply and new urban grid construction. To solve the optimal power flow (OPF) problem in DC grid, an adaptive particle swarm optimization (PSO) algorithm based on fuzzy control theory is proposed in this paper, and the optimal operation considering both power loss and voltage quality is realized. Firstly, the fuzzy membership curve is used to transform two objectives into one, the fitness value of latest step is introduced as input of fuzzy controller to adjust the controlling parameters of PSO dynamically. The proposed strategy was applied in solving the power flow issue in six terminals DC grid model, and corresponding results are presented to verify the effectiveness and feasibility of proposed algorithm.

Optimal Design of Outer Rotor Type Interior Permanent Magnet Synchronous Motor using Improved Particle Swarm Optimization (개선된 PSO 알고리즘을 적용한 의전형 영구자석형 전동기의 최적 설계)

  • Lee, Sang-Yub;Seo, Jang-Ho;Jung, Hyun-Kyo
    • Proceedings of the KIEE Conference
    • /
    • 2008.10c
    • /
    • pp.62-64
    • /
    • 2008
  • 본 논문에서는 기존의 Particle Swarm Optimization (PSO) 알고리즘에 반발 속도 (Repulsion Velocity) 개념을 도입한 개선된 PSO 알고리즘을 제안하였다. 낮은 적합도를 가지는 지역을 멀리하는 성질을 모사한 것이 반발 속도의 개념이다. 반발 속도의 개념을 도입한 제안된 알고리즘은 기존의 알고리즘에 비해서, 더 좋은 수렴 특성을 가지고, 더 빠른 계산 특성을 가짐을 알 수 있었다. 시험 함수를 통해서 제안된 알고리즘의 검증을 수행하였고, 외전형 영구자석형 전동기의 최적화에 적용하여서 그 결과를 나타내었다.

  • PDF

An Empirical Analysis Approach to Investigating Effectiveness of the PSO-based Clustering Method for Scholarly Papers Supported by the Research Grant Projects (개선된 PSO방법에 의한 학술연구조성사업 논문의 효과적인 분류 방법과 그 효과성에 관한 실증분석)

  • Lee, Kun-Chang;Seo, Young-Wook;Lee, Dae-Sung
    • Knowledge Management Research
    • /
    • v.10 no.4
    • /
    • pp.17-30
    • /
    • 2009
  • This study is concerned with suggesting a new clustering algorithm to evaluate the value of papers which were supported by research grants by Korea Research Fund (KRF). The algorithm is based on an extended version of a conventional PSO (Particle Swarm Optimization) mechanism. In other words, the proposed algorithm is based on integration of k-means algorithm and simulated annealing mechanism, named KASA-PSO. To evaluate the robustness of KASA-PSO, its clustering results are evaluated by research grants experts working at KRF. Empirical results revealed that the proposed KASA-PSO clustering method shows improved results than conventional clustering method.

  • PDF