• The Journal of the Korea Contents Association
• /
• v.21 no.7
• /
• pp.164-170
• /
• 2021

In VLSI design, partitioning is a task of clustering objects into groups so that a given objective circuit is optimized. It is used at the layout level to find strongly connected components that can be placed together in order to minimize the layout area and propagation delay. The most popular algorithms for partitioning include the Kernighan-Lin algorithm, Fiduccia-Mattheyses heuristic and simulated annealing. In this paper, we propose a adapted genetic algorithm searching solution space for the circuit partitioning problem, and then compare it with simulated annealing and genetic algorithm by analyzing the results of implementation. As a result, it was found that an adaptive genetic algorithm approaches the optimal solution more effectively than the simulated annealing and genetic algorithm.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.11 no.3
• /
• pp.135-142
• /
• 2011

Unlike using the sequence-based representation for a chromosome in previous genetic algorithms for Bayesian structure learning, we proposed a matrix representation-based genetic algorithm. Since a good chromosome representation helps us to develop efficient genetic operators that maintain a functional link between parents and their offspring, we represent a chromosome as a matrix that is a general and intuitive data structure for a directed acyclic graph(DAG), Bayesian network structure. This matrix-based genetic algorithm enables us to develop genetic operators more efficient for structuring Bayesian network: a probability matrix and a transpose-based mutation operator to inherit a structure with the correct edge direction and enhance the diversity of the offspring. To show the outstanding performance of the proposed method, we analyzed the performance between two well-known genetic algorithms and the proposed method using two Bayesian network scoring measures.

• Journal of Mechanical Science and Technology
• /
• v.16 no.8
• /
• pp.1033-1038
• /
• 2002

Genetic alsorithm (GA) , compared to the gradient-based optimization, has advantages of convergence to a global optimized solution. The genetic algorithm requires so many number of analyses that may cause high computational cost for genetic search. This paper proposes a personal computer network programming based on TCP/IP protocol and client-server model using socket, to improve processing speed of the genetic algorithm for optimization of composite laminated structures. By distributed processing for the generated population, improvement in processing speed has been obtained. Consequently, usage of network-based genetic algorithm with the faster network communication speed will be a very valuable tool for the discrete optimization of large scale and complex structures requiring high computational cost.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.9
• /
• pp.1462-1469
• /
• 1997

This study presents a genetic algorithm-based method for optimizing control parameters in fluid power systems. Genetic algorithms are general-purpose optimization methods based on natural evolution and genetics. A genetic algorithm seeks control parameters maximizing a measure that evaluates system performance. Five control gains of the PID-PD cascade controller fr an electrohydraulic speed control system with a variable displacement hydraulic motor are optimized using a genetic algorithm in the experiment. Optimized gains are confirmed by inspecting the fitness distribution which represents system performance in gain spaces. It is shown that optimization of the five gains by manual tuning should be a task of great difficulty and that a genetic algorithm is an efficient scheme giving economy of time and in labor in optimizing control parameters of fluid power systems.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.05a
• /
• pp.696-702
• /
• 2006

Flutter characteristics of composite curved wing were investigated in this study. The efficient and robust system for the flutter optimization of general composite curved wing models has been developed using the coupled computational method based on both the standard genetic algorithm and the micro genetic algorithms. Micro genetic algorithm is used as an alternative method to overcome the relatively poor exploitation characteristics of the standard genetic algorithm. The present results show that the micro genetic algorithm is more efficient in order to find optimized lay-ups for a composite curved wing model. It is found that the flutter stability of curved wing model can be significantly increased using composite materials with proper optimum lamination design when compared to the case of isotropic wing model under the same weight condition.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2001.05a
• /
• pp.65-69
• /
• 2001

In this paper, consider the three cases of decide for appling point a general Simple Genetic Algorithm about heuristic method(Bottom and Left Sliding) at the piece auto-nesting on the row plate. The 1st case, about only using the Simple Genetic Algorithm. The 2nd case, applied the heuristic method to the genetic operating of the Simple Genetic Algorithm. The 3rd case, applied the heuristic method to the final result of the Simple Genetic Algorirhm. The estimation of final result were proceed to developed simulation program in this research.

• Journal of Korean Society of Steel Construction
• /
• v.13 no.6
• /
• pp.673-681
• /
• 2001

The objective of this study is the development of size, shape and topology discrete optimum design algorithm which is based on the genetic algorithm. The algorithm can perform both shape and topology optimum designs of trusses. The developed algorithm was implemented in a computer program. For the optimum design, the objective function is the weight of trusses and the constraints are stress and displacement. The basic search method for the optimum design is the genetic algorithm. The algorithm is known to be very efficient for the discrete optimization. The genetic algorithm consists of genetic process and evolutionary process. The genetic process selects the next design points based on the survivability of the design points selected form the genetic process. The evolutionary process evaluates the survivability of the design points. The evolutionary process evaluates the survivability of the design points selected form the genetic process. The efficiency and validity of the developed size, shape and topology discrete optimum design algorithm was verified by applying the algorithm to optimum design examples.

• Journal of Advanced Marine Engineering and Technology
• /
• v.31 no.3
• /
• pp.293-300
• /
• 2007

The aim of this paper is to design a speed controller of a DC motor by selection of a PID parameters using genetic algorithm. The model of a DC motor is considered as a typical non-oscillatory, second-order system, And this paper compares three kinds of tuning methods of parameter for PID controller. One is the controller design by the genetic algorithm. second is the controller design by the model matching method third is the controller design by Ziegler and Nichols method. It was found that the proposed PID parameters adjustment by the genetic algorithm is better than the Ziegler & Nickels' method. And also found that the results of the method by the genetic algorithm is nearly same as the model matching method which is analytical method. The proposed method could be applied to the higher order system which is not easy to use the model matching method.

• Journal of Institute of Control, Robotics and Systems
• /
• v.6 no.12
• /
• pp.1061-1069
• /
• 2000

In this paper, a new genetic algorithm is proposed for solving multimodal function optimization problems that are not easily solved by conventional genetic algorithm(GA)s. This algorithm finds one of local optima first and another optima at the next iteration. By repeating this process, we can locate all the local solutions instead of one local solution as in conventional GAs. To avoid converging to the same optimum again, we devise a new genetic operator, called a Mendel operator which simulates the Mendels genetic law. The proposed algorithm remembers the optima obtained so far, compels individuals to move away from them, and finds a new optimum.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.2
• /
• pp.235-245
• /
• 2008

The purpose of this paper is to develop a genetic algorithm to determine the optimal locations of base stations and relay stations in Wibro MMR Network. Various issues related to the genetic algorithm such as solution representation, selection method, crossover operator, mutation operator, and a heuristic method for improving the quality of solutions are presented. The computational results are presented for determining optimal parameters for the genetic algorithm, and show the convergence of the genetic algorithm.