• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2003.06a
• /
• pp.1701-1704
• /
• 2003

This paper presents a new optimization technique of acceleration curve for a wafer transfer crane movement in which high speed and low vibration are desirable. This technique is based on a genetic algorithm with a penalty function for acceleration optimization under the assumption that an initial profile of acceleration curves constitutes the first generation of the genetic algorithm. Especially the penalty function consists of the violation of constraints and the number of violated constraints. The proposed penalty function makes the convergence rate of optimization process using the genetic algorithm more faster than the case of genetic algorithm without a penalty function. The optimized acceleration of the crane through the genetic algorithm and commercial dynamic analysis software has shown to have accurate movement and low vibration.

• Proceedings of the Korean Geotechical Society Conference
• /
• 1999.10a
• /
• pp.415-422
• /
• 1999

This paper describes a new optimum design approach for piled raft foundations using the genetic algorithm. The objective function considered is the cost-based total weight of raft and piles. The genetic algorithm is a search or optimization technique based on nature selection. Successive generation evolves more fit individuals on the basis of the Darwinism survival of the fittest. In formulating the genetic algorithm-based optimum design procedure, the analysis of piled raft foundations is peformed based on the 'hybrid'approach developed by Clancy(1993), and also the simple genetic algorithm proposed by the Goldberg(1989) is used. To evaluate a validity of the optimum design procedure proposed based on the genetic algorithm, comparisons regarding optimal pile placement for minimizing differential settlements by Kim et at.(1999) are made. In addition using proposed design procedure, design examples are presented.

• Journal of Advanced Marine Engineering and Technology
• /
• v.22 no.4
• /
• pp.498-504
• /
• 1998

This paper presents an optimal control algorithm for the overhead crane. To control the swing motion and the position tracking of the payload of the overhead crane a state feedback control algorithm is applied. by using a hybrid genetic algorithm the feedback gains of the state feedback is optimized to minimize the cost function composed of position errors and payload swing angle under unknown constant disturbances. Computer simulation is performed to demonstrate the effectiveness of the proposed control algorithm.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.27 no.10
• /
• pp.1516-1523
• /
• 2003

An inverse radiation analysis is presented for the estimation of the boundary emissivities for an absorbing, emitting, and scattering media with diffusely emitting and reflecting opaque boundaries. The finite-volume method is employed to solve the radiative transfer equation for a two-dimensional irregular geometry. A hybrid genetic algorithm is proposed for improving the efficiency of the genetic algorithm and reducing the effects of genetic parameters on the performance of the genetic algorithm. After verifying the performance of the proposed hybrid genetic algorithm, it is applied to inverse radiation analysis in estimating the wall emissivities in a two-dimensional irregular medium when the measured temperatures are given at only four data positions. The effect of measurement errors on the estimation accuracy is examined.

• The KIPS Transactions:PartB
• /
• v.18B no.3
• /
• pp.157-164
• /
• 2011

This paper presents a fast and scalable re-routing algorithm that adapts to dynamically changing networks. The proposed algorithm integrates Dijkstra's shortest path algorithm with the genetic algorithm. Dijkstra's algorithm is used to define the predecessor array that facilitates the initialization process of the genetic algorithm. After that, the genetic algorithm re-searches the optimal path through appropriate genetic operators under dynamic traffic situations. Experimental results demonstrate that the proposed algorithm produces routes with less traveling time and computational overhead than pure genetic algorithm-based approaches as well as the standard Dijkstra's algorithm for large-scale networks.

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.6
• /
• pp.442-447
• /
• 2003

This paper demonstrates that a modified hybrid neural-genetic multimodel parameter estimation algorithm can be applied to structured system identification of an electro-hydraulic servo system. This algorithm is consists of a recurrent incremental credit assignment(ICRA) neural network and a genetic algorithm. The ICRA neural network evaluates each member of a generation of model and genetic algorithm produces new generation of model. The modified hybrid neural-genetic multimodel parameter estimation algorithm is applied to an electro-hydraulic servo system the task to find the parameter values such as mass, damping coefficient, bulk modulus, spring coefficient and disturbance, which minimizes the total square error.

• 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.

• Proceedings of the Korean Society For Composite Materials Conference
• /
• 2005.11a
• /
• pp.268-271
• /
• 2005

Researches based on genetic algorithms have been performed in composite laminated structures optimization since 1990. However, conventional genetic algorithms have a disadvantage that its augmentation of calculation costs. A lot of variations have been proposed to improve the performance and efficiency, and micro genetic algorithm is one of them. In this paper, micro Genetic Algorithm was employed in the optimization of laminated stiffened composite structures to maximize the linear critical buckling load and the results from both conventional genetic algorithm and micro genetic algorithm were compared.

• Journal of the Korea Computer Industry Society
• /
• v.6 no.5
• /
• pp.813-820
• /
• 2005

To develop a genetic algorithm about job shop scheduling with alternative routing, we are performed that genetic algorithm efficiency analysis of job shop scheduling with alternative routing, First, we proposed genetic algorithm for job shop scheduling with alternative routing. Second, we applied genetic algorithm to traditional benchmak problem appraise a compatibility of genetic algorithm. Third, we compared with dispatching rule and genetic algorithm result for problem Park[3].

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.36 no.3
• /
• pp.17-24
• /
• 2013

Release planning in a software product line (SPL) is to select and assign the features of the multiple software products in the SPL in sequence of releases along a specified planning horizon satisfying the numerous constraints regarding technical precedence, conflicting priorities for features, and available resources. A greedy genetic algorithm is designed to solve the problems of release planning in SPL which is formulated as a precedence-constrained multiple 0-1 knapsack problem. To be guaranteed to obtain feasible solutions after the crossover and mutation operation, a greedy-like heuristic is developed as a repair operator and reflected into the genetic algorithm. The performance of the proposed solution methodology in this research is tested using a fractional factorial experimental design as well as compared with the performance of a genetic algorithm developed for the software release planning. The comparison shows that the solution approach proposed in this research yields better result than the genetic algorithm.