• Proceedings of the KIEE Conference
• /
• 1996.11a
• /
• pp.130-132
• /
• 1996

The power flow calculations(PFc) are the most important and powerful tools in power systems engineering. The conventional power now problem is solved generally with numerical methods such as Newton-Raphson. The conventional numerical method generally have some convergency problem, which is sensitive to initial value, and numerical stability problem concerned with matrix inversion. This paper presents a new power flow calculation algorithm based on the genetic algorithm(GA) which can overcome the disadvantages mentioned above. Some case studies with IEEE 6 bus system also presented to show the performance of proposed algorithm.

• Journal of information and communication convergence engineering
• /
• v.7 no.3
• /
• pp.383-391
• /
• 2009

In this paper, blind equalization using a modified Fuzzy C-Means algorithm with Gaussian Weights (MFCM_GW) is attempted to the heavy noise-corrupted channels. The proposed algorithm can deal with both of linear and nonlinear channels, because it searches for the optimal channel output states of a channel instead of estimating the channel parameters in a direct manner. In contrast to the common Euclidean distance in Fuzzy C-Means (FCM), the use of the Bayesian likelihood fitness function and the Gaussian weighted partition matrix is exploited in its search procedure. The selected channel states by MFCM_GW are always close to the optimal set of a channel even the additive white Gaussian noise (AWGN) is heavily corrupted in it. Simulation studies demonstrate that the performance of the proposed method is relatively superior to existing genetic algorithm (GA) and conventional FCM based methods in terms of accuracy and speed.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.1
• /
• pp.43-51
• /
• 2008

Evolutionary Algorithms (EAs) cover all the applications involving the use of Evolutionary Computation in electronic system design. It is largely applied to complex optimization problems. EAs introduce a new idea for automatic design of electronic systems; instead of imagine model, ions, and conventional techniques, it uses search algorithm to design a circuit. In this paper, a method for automatic optimization of the digital circuit design method has been introduced. This method is based on randomized search techniques mimicking natural genetic evolution. The proposed method is an iterative procedure that consists of a constant-size population of individuals, each one encoding a possible solution in a given problem space. The structure of the circuit is encoded into a one-dimensional genotype as represented by a finite string of bits. A number of bit strings is used to represent the wires connection between the level and 7 types of possible logic gates; XOR, XNOR, NAND, NOR, AND, OR, NOT 1, and NOT 2. The structure of gates are arranged in an $m{\times}n$ matrix form in which m is the number of input variables.

• International Journal of Control, Automation, and Systems
• /
• v.5 no.2
• /
• pp.117-127
• /
• 2007

Many real world control systems usually track several control objectives, simultaneously. At the moment, it is desirable to meet all specified goals using the controllers with simple structures like as proportional-integral (PI) and proportional-integral-derivative (PID) which are very useful in industry applications. Since in practice, these controllers are commonly tuned based on classical or trial-and-error approaches, they are incapable of obtaining good dynamical performance to capture all design objectives and specifications. This paper addresses a new method to bridge the gap between the power of optimal multiobjective control and PI/PID industrial controls. First the PI/PID control problem is reduced to a static output feedback control synthesis through the mixed $H_2/H_{\infty}$ control technique, and then the control parameters are easily carried out using an iterative linear matrix inequalities (ILMI) algorithm. Numerical examples on load-frequency control (LFC) and power system stabilizer (PSS) designs are given to illustrate the proposed methodology. The results are compared with genetic algorithm (GA) based multiobjective control and LMI based full order mixed $H_2/H_{\infty}$ control designs.

• Journal of Intelligence and Information Systems
• /
• v.14 no.3
• /
• pp.133-154
• /
• 2008

The data imbalance problem which can be uncounted in data mining classification problems typically means that there are more or less instances in a class than those in other classes. In order to solve the data imbalance problem, there has been proposed a number of techniques based on re-sampling with replacement, adjusting decision thresholds, and adjusting the cost of the different classes. In this paper, we study the feasibility of the combination usage of the techniques previously proposed to deal with the data imbalance problem, and suggest a combination method using genetic algorithm to find the optimal combination ratio of the techniques. To improve the prediction accuracy of a minority class, we determine the combination ratio based on the F-value of the minority class as the fitness function of genetic algorithm. To compare the performance with those of single techniques and the matrix-style combination of random percentage, we performed experiments using four public datasets which has been generally used to compare the performance of methods for the data imbalance problem. From the results of experiments, we can find the usefulness of the proposed method.

• Smart Structures and Systems
• /
• v.30 no.4
• /
• pp.339-351
• /
• 2022

Evaluating the current condition of existing structures is of primary importance for economic and safety reasons. This can be addressed by Structural System Identification (SSI). A reliable static SSI depends on well-designed sensor configuration and loading cases, as well as efficient parameter estimation algorithms. Static SSI by the Measurement Error-Minimizing Observability Method (MEMOM) is a model-based deterministic static SSI method that could estimate structural parameters from static responses. In the current state of the art, this method is only applicable when structures are subjected to one loading case. This might lead to lack of information in some local regions of the structure (such as the null curvatures zones). To address this issue, the SSI by MEMOM using multiple loading cases is proposed in this work. Observability equations obtained from different loading cases are concatenated simultaneously and an optimization procedure is introduced to obtain the estimations by minimizing the discrepancy between the predicted response and the measured one. In addition, a Genetic-Algorithm (GA)-based Optimal Sensor Placement (OSP) method is proposed to tackle the OSP problem under multiple static loading cases for the very first time. In this approach, the Fisher Information Matrix (FIM)'s determinant is used as the metric of the goodness of sensor configurations. The numerical examples of a 3-span continuous bridge and a 13-story frame, are analyzed to validate the applicability of the extended SSI by MEMOM and the GA-based OSP method.

• IE interfaces
• /
• v.12 no.1
• /
• pp.94-101
• /
• 1999

The set covering(SC) problem is the problem of covering all the rows of an $m{\times}n$ matrix of ones and zeros by a subset of columns with a minimal cost. It has many practical applications of modeling of real world problems. The SC problem has been proven to be NP-complete and many algorithms have been presented to solve the SC problem. In this paper we present hybrid simulated annealing(HSA) algorithm based on the Simulated Annealing(SA) for the SC problem. The HSA is an algorithm which combines SA with a crossover operation in a genetic algorithm and a local search method. Our experimental results show that the HSA obtains better results than SA does.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2574-2587
• /
• 2019

Blind Source Separation (BSS) is a technique used to separate supposed independent sources of signals from a given set of observations. In this paper, the High Exploration Particle Swarm Optimization (HEPSO) algorithm, which is an enhancement of the Particle Swarm Optimization (PSO) algorithm, has been used to separate a set of source signals. Compared to PSO algorithm, HEPSO algorithm depends on two additional operators. The first operator is based on the multi-crossover mechanism of the genetic algorithm while the second one relies on the bee colony mechanism. Both operators have been employed to update the velocity and the position of the particles respectively. Thus, they are used to find the optimal separating matrix. The proposed method enhances the overall efficiency of the standard PSO in terms of good exploration and performance. Based on many tests realized on speech and music signals supplied by the BSS demo, experimental results confirm the robustness and the accuracy of the introduced BSS technique.

• Journal of the Korea Computer Graphics Society
• /
• v.3 no.2
• /
• pp.35-43
• /
• 1997

In monitor-based AR(Augmented Reality) systems, it is required to know the position and direction of a camera in order to combine real images from a camera with virtual images exactly_ Because a tracker is parted from a camera, however, there is a registration error caused by the inconsistency of a tracker with a camera. In this paper, we describe the error correction method using genetic algorithm. This method looks for the position and direction of a camera using genetic algorithm and solves the error correction matrix of it. And then it is registered of the real images and the revised virtual image. It has an effect on the error correction caused by the misalignment of a tracker with a camera in complex AR systems.

• Smart Structures and Systems
• /
• v.26 no.5
• /
• pp.591-603
• /
• 2020

Dynamic deflection monitoring is an essential and critical part of structural health monitoring for high-speed railway bridges. Two critical problems need to be addressed when using inclinometer sensors for such applications. These include constructing a general representation model of inclination-deflection and addressing the ill-posed inverse problem to obtain the accurate dynamic deflection. This paper provides a dynamic deflection monitoring method with the placement of optimal inclinometer sensors for high-speed railway bridges. The deflection shapes are reconstructed using the inclination-deflection transformation model based on the differential relationship between the inclination and displacement mode shape matrix. The proposed optimal sensor configuration can be used to select inclination-deflection transformation models that meet the required accuracy and stability from all possible sensor locations. In this study, the condition number and information entropy are employed to measure the ill-condition of the selected mode shape matrix and evaluate the prediction performance of different sensor configurations. The particle swarm optimization algorithm, genetic algorithm, and artificial fish swarm algorithm are used to optimize the sensor position placement. Numerical simulation and experimental validation results of a 5-span high-speed railway bridge show that the reconstructed deflection shapes agree well with those of the real bridge.