• Structural Engineering and Mechanics
• /
• v.70 no.5
• /
• pp.513-524
• /
• 2019

This study proposed an improved particle swarm optimization (IPSO) method ensemble with kriging model for model updating. By introducing genetic algorithm (GA) and grouping strategy together with elite selection into standard particle optimization (PSO), the IPSO is obtained. Kriging metamodel serves for predicting the structural responses to avoid complex computation via finite element model. The combination of IPSO and kriging model shall provide more accurate searching results and obtain global optimal solution for model updating compared with the PSO, Simulate Annealing PSO (SimuAPSO), BreedPSO and PSOGA. A plane truss structure and ASCE Benchmark frame structure are adopted to verify the proposed approach. The results indicated that the hybrid of kriging model and IPSO could serve for model updating effectively and efficiently. The updating results further illustrated that IPSO can provide superior convergent solutions compared with PSO, SimuAPSO, BreedPSO and PSOGA.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.9
• /
• pp.1658-1666
• /
• 2009

This paper proposes an approach of Mult_HPSO based on the PC cluster system to reduce or remove the stagnation on an early convergence effect of PSO, reduce an execution time and improve a search ability on an optimal solution. Hybrid PSO(HPSO) is combines the PSO(Particle Swarm Optimization) with the mutation of conventional GA(Genetic Algorithm). The conventional PSO has operated a search process in a single swarm. However, Multi_PSO operates a search process through multiple swarms, which increments diversity of expected solutions and reduces the execution time. Multiple Swarms are composed of unsynchronized PC clusters. We apply to SCED(security constrained economic dispatch) problem, a nonlinear optimization problem, which considers line flow constraints and N-1 line contingency constraints. To consider N-1 line contingency in power system, we have chosen critical line contingency through a process of Screening and Selection based on PI(performace Index). We have applied to IEEE 118 bus system for verifying a usefulness of the proposed approaches.

• Journal of Advanced Navigation Technology
• /
• v.18 no.2
• /
• pp.170-177
• /
• 2014

Genetic Algorithms are robust search and optimization techniques but have some problems such as premature convergence and convergence to local extremum. As population diversity converges to low value, the search ability decreases and converges to local extremum but population diversity converges to high value, then the search ability increases and converges to global optimum or genetic algorithm may diverge. To guarantee that genetic algorithms converge to the global optima, the genetic operators should be chosen properly. In this paper, we propose the genetic operators with the hybrid function of the average Hamming distance and the fitness value to maintain the diversity of the GA's population for escaping from the premature convergence. Results of simulation studies verified the effects of the mutation operator for maintaining diversity and the other operators for improving convergence properties as well as the feasibility of using proposed genetic operators on convergence properties to avoid premature convergence and convergence to local extremum.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.44 no.11
• /
• pp.989-996
• /
• 2016

This paper intends to develop the rotor track and balance (RTB) algorithm using the nonlinear RTB models and a real-coded hybrid genetic algorithm. The RTB response data computed using the trim solutions with variation of the adjustment parameters have been used to build nonlinear RTB models based on the quadratic interpolation functions. Nonlinear programming problems to minimize the track deviations and the airframe vibration responses have been formulated to find optimum settings of balance weights, trim-tab deflections, and pitch-link lengths of each blade. The results are efficiently resolved using the real-coded genetic algorithm hybridized with the particle swarm optimization techniques for convergence acceleration. The nonlinear RTB models and the optimized RTB parameters have been compared with those computed using the linear models to validate the proposed techniques. The results showed that the nonlinear models lead to more accurate models and reduced RTB responses than the linear counterpart.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.3
• /
• pp.223-230
• /
• 2001

Since self-organizing map (SOM) preserves the topology of ordering in input spaces and trains itself by unsupervised algorithm, it is Llsed in many areas. However, SOM has a shortcoming: structure cannot be easily detcrmined without many trials-and-errors. Structure-adaptive self-orgnizing map (SASOM) which can adapt its structure as well as its weights overcome the shortcoming of self-organizing map: SASOM makes use of structure adaptation capability to place the nodes of prototype vectors into the pattern space accurately so as to make the decision boundmies as close to the class boundaries as possible. In this scheme, the initialization of weights of newly adapted nodes is important. This paper proposes a method which optimizes SASOM with genetic algorithm (GA) to determines the weight vector of newly split node. The leanling algorithm is a hybrid of unsupervised learning method and supervised learning method using LVQ algorithm. This proposed method not only shows higher performance than SASOM in terms of recognition rate and variation, but also preserves the topological order of input patterns well. Experiments with 2D pattern space data and handwritten digit database show that the proposed method is promising.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.66 no.5
• /
• pp.757-764
• /
• 2017

As the reduction of greenhouse gases(GHGs) emission has become a global issue, the microgrid markets are growing rapidly. With the sudden changes in the market, Korean government suggested a new business model called 'Self-Sufficient Energy Islands'. Its main concern is a stand-alone microgrid composed of Distributed Energy Resources(DERs) such as Renewable Energy Sources(RESs), Energy Storage System(ESS) and Fuel Cell, in order to minimize the emission of GHGs. According to these trend, this paper is written to propose an optimal sizing method of DERs in a stand-alone microgrid by using Genetic Algorithm(GA), one of the representative stochastic methods. It is to minimize the net present cost with the variables, size of RESs and ESS. In the process for optimization, the sunless days are considered as additional constraints. Through the case study analysis, the size of DERs installed in a microgrid system has been computed using the proposed method in MATLAB. And the result of MATLAB is compared with that of HOMER(Hybrid Optimization of Multiple Energy Resources), a well-known energy modeling software.

• Journal of Korea Multimedia Society
• /
• v.6 no.1
• /
• pp.48-57
• /
• 2003

This paper describes an approach for classifying myoelectric patterns using a multilayer perceptrons (MLP's) with genetic algorithm and hidden Markov models (HMM's) hybrid classifier. Genetic Algorithms play a role of selecting Multilayer Perceptron's optimized initial connection weights by its typical global search. The dynamic aspects of EMG are important for tasks such as continuous prosthetic control or various time length EMG signal recognition, which have not been successfully mastered by the most neural approaches. It is known that the hidden Markov model (HMM) is suitable for modeling temporal patterns. In contrast, the multilayer feedforward networks are suitable for static patterns. And, a lot of investigators have shown that the HMM's to be an excellent tool for handling the dynamical problems. Considering these facts, we suggest the combination of ANN and HMM algorithms that might lead to further improved EMG recognition systems.

• Journal of Korean Society of Steel Construction
• /
• v.27 no.2
• /
• pp.131-142
• /
• 2015

In this paper, we present an optimization of truss structures subjected to stress, buckling, and natural frequency constraints. The main objective of the present study is to propose an efficient HA-SA algorithm for solving the truss optimization subject to multiple constraints. The procedure of hybrid HA-SA is a search method which a design values in harmony memory of harmony search are used as an initial value designs in simulated annealing search method. The efficient optimization of HA-SA is illustrated through several optimization examples. The examples of truss structures are used 10-Bar truss, 52-Bar truss (Dome), and 72-Bar truss for natural frequency constraints, and used 18-Bar truss and 47-Bar (Tower) truss for stress and buckling constraints. The optimum results are compared to those of different techniques. The numerical results are demonstrated the advantages of the HA-SA algorithm in truss optimization with multiple constraints.

• Computers and Concrete
• /
• v.32 no.2
• /
• pp.217-232
• /
• 2023

Numerous studies have been performed on the behavior of pile foundations in cold regions. This study first attempted to employ artificial neural networks (ANN) to predict pile-bearing capacity focusing on pile data recorded primarily on cold regions. As the ANN technique has disadvantages such as finding global minima or slower convergence rates, this study in the second phase deals with the development of an ANN-based predictive model improved with an Elephant herding optimizer (EHO), Dragonfly Algorithm (DA), Genetic Algorithm (GA), and Evolution Strategy (ES) methods for predicting the piles' bearing capacity. The network inputs included the pile geometrical features, pile area (m²), pile length (m), internal friction angle along the pile body and pile tip (Ø°), and effective vertical stress. The MLP model pile's output was the ultimate bearing capacity. A sensitivity analysis was performed to determine the optimum parameters to select the best predictive model. A trial-and-error technique was also used to find the optimum network architecture and the number of hidden nodes. According to the results, there is a good consistency between the pile-bearing DA-MLP-predicted capacities and the measured bearing capacities. Based on the R2 and determination coefficient as 0.90364 and 0.8643 for testing and training datasets, respectively, it is suggested that the DA-MLP model can be effectively implemented with higher reliability, efficiency, and practicability to predict the bearing capacity of piles.

• Journal of Intelligence and Information Systems
• /
• v.17 no.4
• /
• pp.241-254
• /
• 2011

Financial time-series forecasting is one of the most important issues because it is essential for the risk management of financial institutions. Therefore, researchers have tried to forecast financial time-series using various data mining techniques such as regression, artificial neural networks, decision trees, k-nearest neighbor etc. Recently, support vector machines (SVMs) are popularly applied to this research area because they have advantages that they don't require huge training data and have low possibility of overfitting. However, a user must determine several design factors by heuristics in order to use SVM. For example, the selection of appropriate kernel function and its parameters and proper feature subset selection are major design factors of SVM. Other than these factors, the proper selection of instance subset may also improve the forecasting performance of SVM by eliminating irrelevant and distorting training instances. Nonetheless, there have been few studies that have applied instance selection to SVM, especially in the domain of stock market prediction. Instance selection tries to choose proper instance subsets from original training data. It may be considered as a method of knowledge refinement and it maintains the instance-base. This study proposes the novel instance selection algorithm for SVMs. The proposed technique in this study uses genetic algorithm (GA) to optimize instance selection process with parameter optimization simultaneously. We call the model as ISVM (SVM with Instance selection) in this study. Experiments on stock market data are implemented using ISVM. In this study, the GA searches for optimal or near-optimal values of kernel parameters and relevant instances for SVMs. This study needs two sets of parameters in chromosomes in GA setting : The codes for kernel parameters and for instance selection. For the controlling parameters of the GA search, the population size is set at 50 organisms and the value of the crossover rate is set at 0.7 while the mutation rate is 0.1. As the stopping condition, 50 generations are permitted. The application data used in this study consists of technical indicators and the direction of change in the daily Korea stock price index (KOSPI). The total number of samples is 2218 trading days. We separate the whole data into three subsets as training, test, hold-out data set. The number of data in each subset is 1056, 581, 581 respectively. This study compares ISVM to several comparative models including logistic regression (logit), backpropagation neural networks (ANN), nearest neighbor (1-NN), conventional SVM (SVM) and SVM with the optimized parameters (PSVM). In especial, PSVM uses optimized kernel parameters by the genetic algorithm. The experimental results show that ISVM outperforms 1-NN by 15.32%, ANN by 6.89%, Logit and SVM by 5.34%, and PSVM by 4.82% for the holdout data. For ISVM, only 556 data from 1056 original training data are used to produce the result. In addition, the two-sample test for proportions is used to examine whether ISVM significantly outperforms other comparative models. The results indicate that ISVM outperforms ANN and 1-NN at the 1% statistical significance level. In addition, ISVM performs better than Logit, SVM and PSVM at the 5% statistical significance level.