• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.2
• /
• pp.47-47
• /
• 1989

This paper considers the parallel machines scheduling problem characterized as a multi-objective combinatorial problem. As this problem belongs to the NP-complete problem, genetic algorithms are applied instead of the traditional analytical approach. The purpose of this study is to show how the problem can be effectively solved by using genetic algorithms with a permutation approach. First, a permutation representation which can effectively represent the chromosome is introduced for this problem . Next, a schedule builder which employs the combination of scheduling theories and a simple heuristic approach is suggested. Finally, through the computer experiments of genetic algorithm to test problems, we show that the niche formation method does not contribute to getting better solutions and that the PMX crossover operator is the best among the selected four recombination operators at least for our problem in terms of both the performance of the solution and the operational convenience.

• The KSFM Journal of Fluid Machinery
• /
• v.14 no.1
• /
• pp.34-41
• /
• 2011

Fire characteristics can be analyzed more realistically by using more accurate properties related to the fire dynamics and one way to acquire these fire properties is to use one of the inverse property estimation techniques. In this study two optimization algorithms which are frequently applied for the inverse heat transfer problems are selected to demonstrate the procedure of obtaining pyrolysis properties of charring material with relatively simple thermal decomposition. Thermal decomposition is occurred at the surface of the charring material heated by receiving the radiative energy from external heat sources and in this process the heat transfer through the charring material is simplified by an unsteady 1-dimensional problem. The basic genetic algorithm(GA) and repulsive particle swarm optimization(RPSO) algorithm are used to find the eight properties of a charring material; thermal conductivity(virgin, char), specific heat(virgin, char), char density, heat of pyrolysis, pre-exponential factor and activation energy by using the surface temperature and mass loss rate history data which are obtained from the calculated experiments. Results show that the RPSO algorithm has better performance in estimating the eight pyrolysis properties than the basic GA for problems considered in this study.

• Journal of Mechanical Science and Technology
• /
• v.20 no.8
• /
• pp.1125-1138
• /
• 2006

The optimal design of the squeeze film damper (SFD) for rotor system has been studied in previous researches. However, these researches have not been considering jumping or nonlinear phenomena of a rotor system with SFD. This paper represents an optimization technique for linear and nonlinear response of a simple rotor system with SFDs by using a hybrid GA-SA algorithm which combined enhanced genetic algorithm (GA) with simulated annealing algorithm (SA). The damper design parameters are the radius, length and radial clearance of the damper. The objective function is to minimize the transmitted load between SFD and foundation at the operating and critical speeds of the rotor system with SFD which has linear and nonlinear unbalance responses. The numerical results show that the transmitted load of the SFD is greatly reduced in linear and nonlinear responses for the rotor system.

• Journal of Digital Convergence
• /
• v.19 no.10
• /
• pp.403-410
• /
• 2021

Given an undirected simple graph, k-club is one of the proposed structures to model social groups that exist in various types in Social Network Analysis (SNA). Maximum k-Club Problem (MkCP) is to find a k-club of maximum cardinality in a graph. This paper introduces a Genetic Algorithm called HGA+DROP which can be used to approximate maximum k-club in graphs. Our algorithm modifies the existing k-CLIQUE & DROP algorithm and utilizes Heuristic Genetic Algorithms (HGA) to obtain multiple k-clubs. We experiment on DIMACS graphs for k = 2, 3, 4 and 5 to compare the performance of the proposed algorithm with existing algorithms.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.6
• /
• pp.725-735
• /
• 2006

This paper deals with the problem of self-learning cooperative motion control for the pushing task of a humanoid robot in the sagittal plane. A model with 27 linked rigid bodies is developed to simulate the system dynamics. A simple genetic algorithm(SGA) is used to find the cooperative motion, which is to minimize the total energy consumption for the entire humanoid robot body. And the multi-layer neural network based on backpropagation(BP) is also constructed and applied to generalize parameters, which are obtained from the optimization procedure by SGA, in order to control the system.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.2
• /
• pp.60-68
• /
• 1992

Fuzzy logic rule based controller has many desirable advantages, whih are simple to implement on the real time and need not the information of structure and dynamic characteristics of the system. Thus, nowadays, the scope of the application of the fuzzy logic controller becomes enlarged. But, if the controlled plant is a time-varying/nonlinear system, it is not easy to construct the fuzzy logic rules which need the knowledge of and expert. In this paper, an approach by which the logic control rules can be auto-generated using the genetic algorithm that is known to be very effective in the optimization problem will be proposed and the effectiveness of the proposed approach will be verified by computer simulation of the 2 d.o.f. planner robot.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.12a
• /
• pp.221-224
• /
• 2001

In this paper, we propose the initial optimized structure of the Radial Basis Function Network which is more simple in the part on the structure and converges more faster than Neural Network with the analysis method using Time-Frequency Localization and genetic algorithm. When we construct the hidden node with the Radial Basis Function whose localization is similar with an approximation target function in the plane of the Time and Frequency, we have initial structure of RBFN, After that, we evaluate the parameters of RBF in the network and the parameters needed for the network is more a few. Finally, we make a good decision of the initial structure having an ability of approximation.

• Journal of Power Electronics
• /
• v.8 no.1
• /
• pp.101-107
• /
• 2008

In this paper, the features extracted from vibration time signals are used to detect the bearing fault condition. The decision tree is applied to diagnose the bearing status, which has the benefits of being an expert system that is based on knowledge history and is simple to understand. This paper also suggests a genetic algorithm (GA) as a method to reduce the number of features. In order to show the potentials of this method in both aspects of accuracy and simplicity, the reduced-feature decision tree is compared with the non reduced-feature decision tree and the PCA-based decision tree.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.4
• /
• pp.1682-1691
• /
• 2015

In this paper, a real time implementation of selective harmonic elimination pulse width modulation (SHEPWM) using Real Coded Genetic Algorithm (RGA), Particle Swarm Optimization technique (PSO) and a new technique known as Linearization Method (LM) for Single Phase Matrix Converter (SPMC) is designed and discussed. In the proposed technique, the switching frequency is fixed and the optimum switching angles are obtained using simple mathematical calculations. A MATLAB simulation was carried out, and FFT analysis of the simulated output voltage waveform confirms the effectiveness of the proposed method. An experimental setup was also developed, and the switching angles and firing pulses are generated using Field Programmable Gate Array (FPGA) processor. The proposed method proves that it is much applicable in the industrial applications by virtue of its suitability in real time applications.

• Journal of Astronomy and Space Sciences
• /
• v.29 no.1
• /
• pp.11-21
• /
• 2012

In this paper, the authors introduced a new approach to find the optimal collision avoidance maneuver considering multi threatening objects within short period, while satisfying constraints on the fuel limit and the acceptable collision probability. A preliminary effort in applying a genetic algorithm (GA) to those kinds of problems has also been demonstrated through a simulation study with a simple case problem and various fitness functions. And then, GA is applied to the complex case problem including multi-threatening objects. Two distinct collision avoidance maneuvers are dealt with: the first is in-track direction of collision avoidance maneuver. The second considers radial, in-track, cross-track direction maneuver. The results show that the first case violates the collision probability threshold, while the second case does not violate the threshold with satisfaction of all conditions. Various factors for analyzing and planning the optimal collision avoidance maneuver are also presented.