• 제어로봇시스템학회논문지
• /
• 제20권8호
• /
• pp.854-867
• /
• 2014

This paper deals with the performance comparison of a PSO algorithm inspired in the process of simulating the behavior pattern of the organisms. The PSO algorithm finds the optimal solution (fitness value) of the objective function based on a stochastic process. Generally, the stochastic process, a random function, is used with the expression related to the velocity included in the PSO algorithm. In this case, the random function of the normal distribution (Gaussian) or uniform distribution are mainly used as the random function in a PSO algorithm. However, in this paper, because the probability distribution which is various with 2 shape parameters can be expressed, the performance comparison of a PSO algorithm using the beta probability distribution function, that is a random function which has a high degree of freedom, is introduced. For performance comparison, 3 functions (Rastrigin, Rosenbrock, Schwefel) were selected among the benchmark Set. And the convergence property was compared and analyzed using PSO-FIW to find the optimal solution.

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

• 한국전자파학회논문지
• /
• 제26권2호
• /
• pp.218-225
• /
• 2015

역합성 개구면 레이더(Inverse Synthetic Aperture Radar: ISAR) 영상은 표적으로부터 반사되어 돌아온 레이더 수신신호들을 코히런트하게 신호처리하여 형성한 표적의 2차원 영상이다. 본 논문에서는 계단 첩 파형(Stepped Chirp Waveform: SCW)을 이용한 ISAR 영상 형성과정에서 펄스 간 움직임(Inter-Pulse Motion: IPM)이 존재하는 경우, 이를 효과적으로 보상하기 위한 알고리즘을 제안한다. 널리 쓰이는 최적화 기법 중 하나인 particle swarm optimization(PSO)를 기반으로 IPM에 관련된 표적의 속도와 가속도를 추정한다. 또한, 개선된 PSO를 통해 기존의 성능을 더욱 향상시켜 실시간 요동보상을 수행한다. 시뮬레이션에서는 Boeing-737의 점 산란원 모델을 이용한 기동 시나리오에서 제안된 알고리즘의 성능을 확인한다.

• Nuclear Engineering and Technology
• /
• 제55권3호
• /
• pp.827-838
• /
• 2023

Centrifugal pump is a key part of nuclear power plant systems, and its health status is critical to the safety and reliability of nuclear power plants. Therefore, fault diagnosis is required for centrifugal pump. Traditional fault diagnosis methods have difficulty extracting fault features from nonlinear and non-stationary signals, resulting in low diagnostic accuracy. In this paper, a new fault diagnosis method is proposed based on the improved particle swarm optimization (IPSO) algorithm-based variational modal decomposition (VMD) and relevance vector machine (RVM). Firstly, a simulation test bench for rotor faults is built, in which vibration displacement signals of the rotor are also collected by eddy current sensors. Then, the improved particle swarm algorithm is used to optimize the VMD to achieve adaptive decomposition of vibration displacement signals. Meanwhile, a screening criterion based on the minimum Kullback-Leibler (K-L) divergence value is established to extract the primary intrinsic modal function (IMF) component. Eventually, the factors are obtained from the primary IMF component to form a fault feature vector, and fault patterns are recognized using the RVM model. The results show that the extraction of the fault information and fault diagnosis classification have been improved, and the average accuracy could reach 97.87%.

• Geomechanics and Engineering
• /
• 제36권3호
• /
• pp.259-276
• /
• 2024

The undrained shear strength is widely acknowledged as a fundamental mechanical property of soil and is considered a critical engineering parameter. In recent years, researchers have employed various methodologies to evaluate the shear strength of soil under undrained conditions. These methods encompass both numerical analyses and empirical techniques, such as the cone penetration test (CPT), to gain insights into the properties and behavior of soil. However, several of these methods rely on correlation assumptions, which can lead to inconsistent accuracy and precision. The study involved the development of innovative methods using extreme gradient boosting (XGB) to predict the pile set-up component "A" based on two distinct data sets. The first data set includes average modified cone point bearing capacity (q_t), average wall friction (f_s), and effective vertical stress (σ_vo), while the second data set comprises plasticity index (PI), soil undrained shear cohesion (S_u), and the over consolidation ratio (OCR). These data sets were utilized to develop XGBoost-based methods for predicting the pile set-up component "A". To optimize the internal hyperparameters of the XGBoost model, four optimization algorithms were employed: Particle Swarm Optimization (PSO), Social Spider Optimization (SSO), Arithmetic Optimization Algorithm (AOA), and Sine Cosine Optimization Algorithm (SCOA). The results from the first data set indicate that the XGBoost model optimized using the Arithmetic Optimization Algorithm (XGB - AOA) achieved the highest accuracy, with R2 values of 0.9962 for the training part and 0.9807 for the testing part. The performance of the developed models was further evaluated using the RMSE, MAE, and VAF indices. The results revealed that the XGBoost model optimized using XGBoost - AOA outperformed other models in terms of accuracy, with RMSE, MAE, and VAF values of 0.0078, 0.0015, and 99.6189 for the training part and 0.0141, 0.0112, and 98.0394 for the testing part, respectively. These findings suggest that XGBoost - AOA is the most accurate model for predicting the pile set-up component.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3512-3528
• /
• 2016

A network with high mobility nodes or vehicles is vehicular ad hoc Network (VANET). For improvement in communication efficiency of VANET, many techniques have been proposed; one of these techniques is vehicular node clustering. Cluster nodes (CNs) and Cluster Heads (CHs) are elected or selected in the process of clustering. The longer the lifetime of clusters and the lesser the number of CHs attributes to efficient networking in VANETs. In this paper, a novel Clustering algorithm is proposed based on Ant Colony Optimization (ACO) for VANET named ACONET. This algorithm forms optimized clusters to offer robust communication for VANETs. For optimized clustering, parameters of transmission range, direction, speed of the nodes and load balance factor (LBF) are considered. The ACONET is compared empirically with state of the art methods, including Multi-Objective Particle Swarm Optimization (MOPSO) and Comprehensive Learning Particle Swarm Optimization (CLPSO) based clustering techniques. An extensive set of experiments is performed by varying the grid size of the network, the transmission range of nodes, and total number of nodes in network to evaluate the effectiveness of the algorithms in comparison. The results indicate that the ACONET has significantly outperformed the competitors.

• 신재생에너지
• /
• 제16권1호
• /
• pp.15-24
• /
• 2020

For mechanical load testing of wind turbines, capture matrix is constructed for various range of wind speeds according to the international standard IEC 61400-13. The conventional method wastes considerable amount of data by its invalid data policy -segment data into 10 minutes then remove invalid ones. Previously, we have suggested an alternative way to save the total amount of data to build a capture matrix, but the efficient selection of data has been still under question. The paper introduces optimization algorithms to construct capture matrix with less data. Heuristic algorithm (simple stacking and lowest frequency first), population method (particle swarm optimization) and Q-Learning accompanied with epsilon-greedy exploration are compared. All algorithms show better performance than the conventional way, where the distribution of enhancement was quite diverse. Among the algorithms, the best performance was achieved by heuristic method (lowest frequency first), and similarly by particle swarm optimization: Approximately 28% of data reduction in average and more than 40% in maximum. On the other hand, unexpectedly, the worst performance was achieved by Q-Learning, which was a promising candidate at the beginning. This study is helpful for not only wind turbine evaluation particularly the viewpoint of cost, but also understanding nature of wind speed data.

• Steel and Composite Structures
• /
• 제32권4호
• /
• pp.455-466
• /
• 2019

Despite the rapid advancement in computing resources, many real-life design and optimization problems in structural engineering involve huge computation costs. To counter such challenges, approximate models are often used as surrogates for the highly accurate but time intensive finite element models. In this paper, surrogates for first-order shear deformation based finite element models are built using a polynomial regression approach. Using statistical techniques like Box-Cox transformation and ANOVA, the effectiveness of the surrogates is enhanced. The accuracy of the surrogate models is evaluated using statistical metrics like $R^2$, $R^2{_{adj}}$, $R^2{_{pred}}$ and $Q^2{_{F3}}$. By combining these surrogates with nature-inspired multi-criteria decision-making algorithms, namely multi-objective genetic algorithm (MOGA) and multi-objective particle swarm optimization (MOPSO), the optimal combination of various design variables to simultaneously maximize fundamental frequency and frequency separation is predicted. It is seen that the proposed approach is simple, effective and good at inexpensively producing a host of optimal solutions.

• Journal of Computing Science and Engineering
• /
• 제9권2호
• /
• pp.39-50
• /
• 2015

Genetic algorithm (GA) and particle swarm optimization (PSO) are two excellent approaches to multimodal optimization problems. However, slow convergence or premature convergence readily occurs because of inappropriate and inflexible evolution. In this paper, a novel optimization algorithm with a flexible grid optimization (FGO) is suggested to provide adaptive trade-off between exploration and exploitation according to the specific objective function. Meanwhile, a uniform agents array with adaptive scale is distributed on the gird to speed up the calculation. In addition, a dominance centroid and a fitness center are proposed to efficiently determine the potential guides when the population size varies dynamically. Two types of subregion division strategies are designed to enhance evolutionary diversity and convergence, respectively. By examining the performance on four benchmark functions, FGO is found to be competitive with or even superior to several other popular algorithms in terms of both effectiveness and efficiency, tending to reach the global optimum earlier. Moreover, FGO is evaluated by applying it to a parameter decision in a least squares support vector machine (LS-SVM) to verify its practical competence.

• 국제학술발표논문집
• /
• The 6th International Conference on Construction Engineering and Project Management
• /
• pp.656-657
• /
• 2015

Recently, Multi-Objective Optimization of design elements is an important issue in building design. Design variables that considering the specificities of the different environments should use the appropriate algorithm on optimization process. The purpose of this study is to compare and analyze the optimal solution using three evolutionary algorithms and energy modeling simulation. This paper consists of three steps: i)Developing three evolutionary algorithm model for optimization of design elements ; ii) Conducting Multi-Objective Optimization based on the developed model ; iii) Conducting comparative analysis of the optimal solution from each of the algorithms. Including Non-dominated Sorted Genetic Algorithm (NSGA-II), Multi-Objective Particle Swarm Optimization (MOPSO) and Random Search were used for optimization. Each algorithm showed similar range of result data. However, the execution speed of the optimization using the algorithm was shown a difference. NSGA-II showed the fastest execution speed. Moreover, the most optimal solution distribution is derived from NSGA-II.