• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.252-256
• /
• 1997

The success of a fuzzy neural network(FNN) control system solving any given problem critically depends on the architecture of the network. Various attempts have been made in optimizing its structure using genetic algorithm automated designs. This paper presents a new approach to structurally optimized designs of FNN models. A messy genetic algorithm is used to obtain structurally optimized FNN models. Structural optimization is regarded important before neural networks based learning is switched into. We have applied the method to the problem of a numerical approximation

• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.615-620
• /
• 2001

This paper addresses the design of sliding model fuzzy-model-based controller using genetic algorithms. In general, the construction of fuzzy logic controllers has difficulties for the lack of systematic design procedure. To release this difficulties, the sliding model fuzzy-model-based controllers was presented by authors. In this proposed method, the fuzzy model, which represents the local dynamic behavior of the given nonlinear system, is utilized to construct the controller. The overall controller consists of the local compensators which compensate the local dynamic linear model and the feed-forward controller which is designed via sliding mode control theory. Although, the stability and the performance is guaranteed by the proposed method, some design parameters have to be chosen by the designer manually. This problem can be solved by using genetic algorithms. The proposed method tunes the parameters of the controller, by which the reasonable accuracy and the control effort is achieved. The validity and the efficiency of the proposed method are verified through simulations.

• Proceedings of the KIEE Conference
• /
• 1999.07f
• /
• pp.2742-2744
• /
• 1999

In this paper, an auto-tuning method for fuzzy logic controller based on the genetic algorithm is presented. In the proposed method, normalization parameters and membership function parameters of fuzzy controller are translated into binary bit-strings, which are processed by the genetic algorithm in order to be optimized for the well-chosen objective function (i.e. fitness function). To examine the validity of the proposed method. a genetic algorithm based fuzzy controller for an indirect vector control of induction motors is simulated and experiment is carried out. The simulation and experimental results show a significant enhancement in shortening development time and improving system performance over a traditional manually tuned fuzzy logic controller.

• The Journal of the Acoustical Society of Korea
• /
• v.19 no.8
• /
• pp.63-67
• /
• 2000

This paper deals with text-prompt speaker recognition based on dynamic time warping (DTW). The Genetic Algorithm was applied to the creation of reference patterns for suitable reflection of the speaker characteristics, one of the most important determinants in the fields of speaker recognition. In order to overcome the weakness of text-dependent and text-independent speaker recognition, the text-prompt type was suggested. Performed speaker identification and verification in close and open set respectively, hence the Genetic algorithm-based reference patterns had been proven to have better performance in both recognition rate and speed than that of conventional reference patterns.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.698-702
• /
• 1992

In this paper, Micro-Genetic algorithms(.mu.-GAs) is proposed on a minimum-time path planning for robot manipulator, which is a kind of optimization algorithm. The minimum-time path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computation burden and can't often find the optimal values. One way to overcome such difficulties is to apply the Micro-Genetic Algorithms, which can allow to find the optimal values, to the minimum-time problem. This paper propose an approach for solving the minimum-time path planning by using Micro-Genetic Algorithms. The effectiveness of the proposed method is demonstrated using the 2 d.o.f plannar Robot manipulator.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.40-47
• /
• 1994

In this paper, Micro-Genetic algorithms($\mu$-GAs) is proposed on a minimum-time path planning for robot manipulator. which is a kind of optimization algorithm. The minimum-time path planning, which can allow the robot system to perform the demanded tasks with a minimum execution time, may be of consequence to improve the productivity. But most of the methods proposed till now suffers from a significant computation burden and can`t often find the optimaul values. One way to overcome such difficulties is to apply the Micro-Genetic Algorithms, which can allow to find the optimul values, to the minimum-time problem. This paper propose an approach for solving the minimum-time path planning by using Micro-Genetic Algorithms. The effectiveness of the proposed method is demonstrated using the 2 d.o.f plannar Robot manipulator.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.59
• /
• pp.11-20
• /
• 2000

The Job Shop Scheduling Problem(JSSP) is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on single genetic algorithm(SGA) and parallel genetic algorithm (PGA) to address JSSP. In this scheduling method, new genetic operator, generating method of initial population are developed and island model PGA are proposed. The scheduling method based on PGA are tested on standard benchmark JSSP. The results were compared with SGA and another GA-based scheduling method. The PGA search the better solution or improves average of solution in benchmark JSSP. Compared to traditional GA, the proposed approach yields significant improvement at a solution.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.3
• /
• pp.30-39
• /
• 2010

This paper considers a problem of optimizing torch paths to cut stock plates nested with open contours. For each contour, one of the two ending points is to be selected as a starting point of cutting with the other being the exit point. A torch path is composed of a single depot and a series of starting and ending points of contours to be cut. The torch path optimization problem is shown to be formulated as an extended version of the standard travelling salesman problem. To solve the problem, a hybrid genetic algorithm with the local search of torch paths is proposed. The genetic algorithm is tested for hypothetical problems whose optimal solutions are known in advance due to the special structure of them. The computational results show that the algorithm generates very near optimal solutions for most cases of the test problems, which verifies the validity of the algorithms.

• Journal of Environmental Science International
• /
• v.14 no.3
• /
• pp.265-269
• /
• 2005

This study was carried out to provide the basic data for an identifying system for Iris species distributed in Korean market from complete analysing of genetic relationship between three native Iris species and one cultivar bred from the native Iris plant. RAPD analysis of genetic relationship among 4 Irises was possible. According to the RAPD analysis, they were divided into two groups. Among 4 Irises used in this study, Iris laevigata 'Veriegata', Iris laevigata and Iris setosa were classified into the same group since they had many similarities even though the habitat of Iris laevigata in Korean peninsular is restricted mainly in the south and Iris setosa is naturally inhabited in the northern part of Kangwondo. The value for the dissimilarity index of Iris laevigata and Iris laevigata 'Veriegata' was 6.757. The value for the dissimilarity index of Iris laevigata and Iris dichotoma was 95.000, so that they were genetically the farthest among them since the genetic relationship between two species are separated far if the value of the dissimilarity index is close to 100.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.2
• /
• pp.91-97
• /
• 2006

The vehicle routing problem with time windows (VRPTW) is an important problem in third party logistics and supply chain management. We extend the VRPTW to the VRPTW with overtime and outsourcing vehicles (VRPTWOV) which allows the overtime of drivers and the possibility of using outsourcing vehicles. This problem can be applied to third party logistics companies for managing central distributor-local distributors, local distributor-retailers (or customers), and a manufacturer. We develop a mixed integer programming model and a genetic algorithm. Computational results demonstrate the efficiency of the developed genetic algorithm. We also develop a decision support system based on this genetic algorithm.