• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.64 no.4
• /
• pp.315-320
• /
• 2015

Proposal algorithm in this paper introduced cells, units of router group, for distributed processing of previous genetic algorithm. This paper presented ways to reduce search delay time of overall network through cell-based genetic algorithm. As a result of performance analysis comparing with existing genetic algorithm through experiments, the proposal algorithm was verified superior in terms of costs and delay time. Furthermore, time for routing an alternative path was reduced in proposal algorithm, in case that a network was damaged in existing optimal path algorithm, Dijkstra algorithm, and the proposal algorithm was designed to route an alternative path faster than Dijkstra algorithm, as it has a 2nd shortest path in cells of the damaged network. The study showed that the proposal algorithm can support routing of alternative path, if Dijkstra algorithm is damaged in a network.

• Journal of Korean Institute of Industrial Engineers
• /
• v.28 no.1
• /
• pp.76-86
• /
• 2002

In this paper, we suggest a hybrid genetic algorithm reinforced by a fuzzy logic controller (flc-HGA) to overcome weaknesses of conventional genetic algorithms: the problem of parameter fine-tuning, the lack of local search ability, and the convergence speed in searching process. In the proposed flc-HGA, a fuzzy logic controller is used to adaptively regulate the fine-tuning structure of genetic algorithm (GA) parameters and a local search technique is applied to find a better solution in GA loop. In numerical examples, we apply the proposed algorithm to a simple test problem and two complex combinatorial optimization problems. Experiment results show that the proposed algorithm outperforms conventional GAs and heuristics.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 1999.11a
• /
• pp.167-173
• /
• 1999

This paper suggests a method to design the deep groove ball bearing for high-load capacity by using a genetic algorithm. The design problem of ball bearings is a typical discrete/continuous optimization problem because the deep groove ball bearing has discrete variables, such as ball size and number of balls. Thus, a genetic algorithm is employed to find the optimum values from a set of discrete design variables. The ranking process is proposed to effectively deal with the constraints in genetic algorithm. Results obtained fer several 63 series deep groove ball bearings demonstrated the effectiveness of the proposed design methodology by showing that the average basic dynamic capacities of optimally designed bearings increase about 9~34% compared with the standard ones.

• Journal of Intelligence and Information Systems
• /
• v.8 no.2
• /
• pp.189-203
• /
• 2002

In this paper we compare the performances of adaptive operators in genetic algorithm. For the adaptive operators, the crossover and mutation operators of genetic algorithm are considered. One fuzzy logic controller is developed in this paper and two heuristics is presented from conventional works for constructing the operators. The fuzzy logic controller and two conventional heuristics adaptively regulate the rates of the operators during genetic search process. All the algorithms are tested and analyzed in numerical examples. Finally, the best algorithm is recommended.

• Genomics & Informatics
• /
• v.13 no.2
• /
• pp.40-44
• /
• 2015

DNA microarray and next-generation sequencing provide data that can be used for the genetic analysis of multiple quantitative traits such as gene expression levels, transcription factor binding profiles, and epigenetic signatures. In particular, chromatin opening is tightly coupled with gene transcription. To understand how these two processes are genetically regulated and associated with each other, we examined the changes of chromatin accessibility and gene expression in response to genetic variation by means of quantitative trait loci mapping. Regulatory patterns commonly observed in yeast and human across different technical platforms and experimental designs suggest a higher genetic complexity of transcription regulation in contrast to a more robust genetic architecture of chromatin regulation.

• Proceedings of the KIEE Conference
• /
• 2003.11c
• /
• pp.376-379
• /
• 2003

DNA computing based DNA sequence Is operated through the biology experiment. Biology experiment used as operator causes illegal reactions through shifted hybridization, mismatched hybridization, undesired hybridization of the DNA sequence. So, it is essential to design DNA sequence to minimize the potential errors. This paper proposes method of the DNA sequence generation based evolutionary operation processor. Genetic algorithm was used for evolutionary operation and extra hardware, namely genetic algorithm processor was implemented for solving repeated evolutionary process that causes much computation time. To show efficiency of the Proposed processor, excellent result is confirmed by comparing between fitness of the DNA sequence formed randomly and DNA sequence formed by genetic algorithm processor. Proposed genetic algorithm processor can reduce the time and expense for preparing DNA sequence that is essential in DNA computing. Also it can apply design of the oligomer for development of the DNA chip or oligo chip.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.40.6-40
• /
• 2001

Fuzzy controls are widely used in industrial fields using experts knowledge base for its high degree of performance. Genetic Algorithm(GA) is one of the numerical method that has an advantage of optimization. In this paper, we present an acquisition method of fuzzy rules using genetic algorithm. Knowledge of the system is the key to generating the control rules. As these rules, a system can be more stable and it reaches the control goal the faster. To get the optimal fuzzy control rules and the membership functions, we use the GA instead of the experts knowledge base. Information of the system is coded the chromosome with suitable phenotype. Then, it is operated by genetic operator, and evaluated by evaluation function. Passing by the decoding process with the fittest chromosome, the genetic algorithm can tune the fuzzy rules and the membership functions automatically ...

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.208-212
• /
• 1998

This paper suggests the method to recognize the various defect patterns of cold mill strip using binary decision tree constructed by genetic algorithm automatically. In case of classifying the complex the complex patterns with high similarity like the defect patterns of cold mill strip, the selection of the optimal feature set and the structure of recognizer is important for high recognition rate. In this paper genetic algorithm is used to select a subset of the suitable features at each node in binary decision tree. The feature subset of maximum fitness is chosen and the patterns are classified into two classes by linear decision function. After this process is repeated at each node until all the patterns are classified respectively into individual classes. In this way , binary decision tree classifier is constructed automatically. After construction binary decision tree, the final recognizer is accomplished by the learning process of neural network using a set of standard p tterns at each node. In this paper, binary decision tree classifier is applied to recognition of the defect patterns of cold mill strip and the experimental results are given to show the usefulness of the proposed scheme.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.3
• /
• pp.89-97
• /
• 1997

A genetic algorithm (GA) is a stochastic direct search strategy that mimics the process of genetic evolution. The GA applied herein works on a population of structural designs at any one time, and uses a structured information exchange based on the principles of natural selection and wurvival of the fittest to recombine the most desirable features of the designs over a sequence of generations until the process converges to a "maximum fitness" design. Principles of genetics are adapted into a search procedure for structural optimization. The methods consist of three genetics operations mainly named selection, cross- over and mutation. In this study, a method of finding the optimum topology of truss/beam structure is pro- posed by using the GA. In order to use GA in the optimum topology problem, chromosomes to FEM elements are assigned, and a penalty function is used to include constraints into fitness function. The results show that the GA has the potential to be an effective tool for the optimal design of structures accounting for sizing, geometrical and topological variables.variables.

• Korean Management Science Review
• /
• v.24 no.2
• /
• pp.157-176
• /
• 2007

Fuzzy cognitive map(FCM) has long been used as an effective way of constructing the human's decision making process explicitly. By taking advantage of this feature, FCM has been extensively used in providing what-if solutions to a wide variety of business decision making problems. In contrast, the goal-seeking analysis mechanism by using the FCM is rarely observed in literature, which remains a research void in the fields of FCM. In this sense, this study proposes a new type of the FCM-based goal-seeking analysis which is based on utilizing the genetic algorithm. Its main recipe lies in the fact that the what-if analysis as well as goal-seeking analysis are enabled very effectively by incorporating the genetic algorithm into the FCM-driven inference process. To prove the empirical validity of the proposed approach, valid questionnaires were gathered from a number of experts on software sales, and analyzed statistically. Results showed that the proposed approach is robust and significant.