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

• 한국지능시스템학회논문지
• /
• 제25권2호
• /
• pp.105-110
• /
• 2015

본 연구는 Quanser사의 3-자유도 헬리콥터 시스템에 대한 종래의 선형 수리 모델을 개선한 수리 모델을 제안하고, 실험을 통해 제안된 수리 모델을 기반으로 설계된 제어기의 제어 성능을 종래의 수리 모델을 기반으로 설계된 제어기의 제어 성능과 비교함으로써 그 타당성을 검증한다. 이에 대한 연구 진행 과정은 다음과 같다. 첫째, 3-자유도 헬리콥터 시스템의 동 특성을 분석하고, 종래의 선형 수리 모델을 구축한다. 둘째, 종래의 수리 모델의 구축을 위해 수행된 선형화 과정에서 제거된 비선형적 요소들을 파악한다. 그리고 이 제거된 비선형적 요소들에 대응하는 파라미터들을 추가하여 개선된 수리 모델을 구축한다. 이 때, 수리 모델을 구축하기 위해 메타 휴리스틱 전역 최적화 기법인 입자군집최적화 알고리즘을 이용한다. 마지막으로, 제안된 모델을 기반으로 제어기를 설계하고, 이를 종래의 수리 모델을 기반으로 설계된 제어기의 제어 성능을 비교하여 제안된 수리 모델의 타당성을 검증한다.

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

• Industrial Engineering and Management Systems
• /
• 제7권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.

• 한국시뮬레이션학회논문지
• /
• 제28권4호
• /
• pp.21-32
• /
• 2019

군집에 대한 사회적 행동 모델에 영감을 받은 군집 최적화 알고리즘은 복잡한 최적화 문제 해결에서부터 인공 신경망의 학습에까지 활용되는 대표적인 메타휴리스틱 최적화 알고리즘 중의 하나이다. 하지만 이 알고리즘은 기본적으로 확률적 노이즈가 존재하지 않는 결정적인 환경에서 개발되었기 때문에, 많은 경우 확률적 노이즈가 존재하는 실제 문제에 적용하기에 어려움이 있었다. 본 논문에서는 이를 개선하기 위하여 불확실 평가 기법이라고 정의되는 통계적 가설 검정 기반의 리샘플링 기법을 적용한다. 이 기법을 통하여 입자 군집 최적화 알고리즘의 성능에 가장 큰 영향을 미치는 입자들의 전역 최적을 정확하게 찾으므로 노이즈 환경에서 입자들이 최적해로 보다 정확하고 빠르게 수렴하도록 한다. 다양한 벤치마크 문제들에 대한 기존 알고리즘들과의 비교 실험 결과는 제안하는 알고리즘의 개선된 성능을 입증하고, 사례 연구의 결과는 본 연구의 필요성을 강조한다. 본 연구 결과가 4차 산업혁명 시대에 디지털 트윈 등을 통한 시뮬레이션 기반 시스템 최적화에 효과적으로 적용될 수 있을 것이라 기대한다.

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

• Journal of Information Processing Systems
• /
• 제15권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.

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

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2008년도 추계학술대회 논문집 전기기기 및 에너지변환시스템부문
• /
• pp.62-64
• /
• 2008

본 논문에서는 기존의 Particle Swarm Optimization (PSO) 알고리즘에 반발 속도 (Repulsion Velocity) 개념을 도입한 개선된 PSO 알고리즘을 제안하였다. 낮은 적합도를 가지는 지역을 멀리하는 성질을 모사한 것이 반발 속도의 개념이다. 반발 속도의 개념을 도입한 제안된 알고리즘은 기존의 알고리즘에 비해서, 더 좋은 수렴 특성을 가지고, 더 빠른 계산 특성을 가짐을 알 수 있었다. 시험 함수를 통해서 제안된 알고리즘의 검증을 수행하였고, 외전형 영구자석형 전동기의 최적화에 적용하여서 그 결과를 나타내었다.

• 지식경영연구
• /
• 제10권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.