• 한국정밀공학회지
• /
• 제26권11호
• /
• pp.99-107
• /
• 2009

Since a long work piece influences the natural frequency of the entire system with a miniature high speed spindle, a bar-feeder is used for a long work piece to improve the vibration characteristics of a spindle system. Therefore, it is very important to design optimally support positions between a bar-feeder and a long work piece for a miniature high speed spindle system. The goal of the current paper is to present an optimization method for the design of support positions between a bar-feeder and a long work piece. This optimization method is effectively composed of the method of design of experiment (DOE), the artificial neural network (ANN) and the genetic algorithm (GA). First, finite element models which include a high speed spindle, a long work piece and the support conditions of a bar-feeder were generated from the orthogonal array of the DOE method, and then the results of natural vibration analysis using FEM were provided for the learning inputs of the neural network. Finally, the design of bar-feeder support positions was optimized by the genetic algorithm method using the neural network approximations.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2001년도 하계종합학술대회 논문집(3)
• /
• pp.29-32
• /
• 2001

In this paper, we applied the high-performance PGAP(Parallel Genetic Algorithm Processor) to recognizing rotated pattern. In order to perform this research efficiently, we used Multi-PGAP system consisted of four PGAP. In addition, we used mental rotation based on the rotated pattern recognition mechanism of human to reduce the number of operation. Also, we experimented with distinguishing specific pattern from similar coin patterns and determine rotated angle between patterns. The result showed that the development of future artificial recognition system is feasible by employing high performance PGAPS.

• 한국산업경영시스템학회:학술대회논문집
• /
• 한국산업경영시스템학회 2002년도 춘계학술대회
• /
• pp.203-208
• /
• 2002

In case of the problems with multiple plants, alternative operation sequence, alternative machine, setup time, and transportation time between plants, we need a robust methodology for the integration of process planning and scheduling in supply chain. The objective of this model is to minimize the tardiness and to maximize the resource utilization. So, we propose a multi-objective model with limited-capacity constraint. To solve this model, we develope an efficient and flexible model using adaptive genetic algorithm(AGA), compared to traditional genetic algorithm(TGA)

• 산업공학
• /
• 제13권1호
• /
• pp.78-91
• /
• 2000

This paper presents a computerized quality forecasting system for glass manufacturing. In forecasting the molten glass quality, we are concerned with three major issues : (1) to find the reasonable time lags between a set of process conditions and the quality measurement of glass products, (2) to find the most significant process variables affecting the quality, and (3) to construct the appropriate causal forecasting models using genetic algorithms. The experimental results show the proposed model results in better forecasting than linear regression model. The suggested forecasting model was implemented successfully and is being currently used in a real manufacturing line.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2002년도 춘계학술대회 및 임시총회
• /
• pp.19-22
• /
• 2002

분류자 시스템은 유전자 알고리즘(Genetic Algorithm : GA)을 이용하여 새로운 규칙 집합을 발견하는 시스템이다 또 로봇 축구 시뮬레이션 게임(SimuroSot)은 시간에 따라 상태가 변화하는 동적인 시스템이다 본 논문에서는 GBML(Genetic Based Machine Learning)의 한 갈래이자 미시간 접근 방법을 기반으로 하는 Zeroth Level Classifier System(ZCS)을 SimuroSot에 적용하여 게임 전략을 구성하는 새로운 규칙의 발견과 학습에 의한 축구 로봇의 행동전략 알고리즘을 제안하고, 시뮬레이션을 통하여 본 전략의 유용성을 확인한다

• 한국안전학회지
• /
• 제13권4호
• /
• pp.240-247
• /
• 1998

This paper proposed a method for solving the nonlinear integer programing problem to get easily the best compromise solution while holding a nonlinear property by using the genetic algorithms. Also, this paper reported that the optimization problem of systems reliability as was solved by using the preposed method, and the numerical comparison experiments between the 0-1 LP/0-1 NP formulations were demonstrated, and from the quantitative evaluation the efficiency of the proposed method was demonstrated.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.107.6-107
• /
• 2001

Genetic alogorithm(GA) is a well-known global optimization algorithm. However, as the searching bounds grow wider., performance of local optimization deteriorates. In this paper, we propose a hybrid algorithm which integrates the gradient algorithm and GA so as to reinforce the performance of local optimization. We apply this algorithm to the system identification of second order RLC circuit. Identification results show that the proposed algorithm gets the better and robust performance to find the exact values of RLC elements.

• Journal of applied mathematics & informatics
• /
• 제16권1_2호
• /
• pp.337-354
• /
• 2004

SA, TS, GA and ACS are four of the main algorithms for solving challenging problems of intelligent systems. In this paper we consider Examination Timetabling Problem that is a common problem for all universities and institutions of higher education. There are many methods to solve this problem, In this paper we use Simulated Annealing, Tabu Search, Genetic Algorithm and Ant Colony System in their basic frameworks for solving this problem and compare results of them with each other.

• 산업공학
• /
• 제14권4호
• /
• pp.374-384
• /
• 2001

The objective of this paper is to design the dynamic route guidance system(DRGS) and develop a genetic algorithm(GA) for finding the multiple shortest paths in real traffic network. The proposed GA finds a collection of paths between source and destination considering turn-restrictions, U-turn, and P-turn that are genetically evolved until an acceptable solution is reached. This paper also shows the procedure to find the multiple shortest paths in traffic network of Seoul.

• 한국시뮬레이션학회:학술대회논문집
• /
• 한국시뮬레이션학회 1998년도 추계학술대회 및 정기총회
• /
• pp.142-146
• /
• 1998

In this paper, we suggests a WIP(work in process) of FMS analysis methods based on the Genetic algorithm. We conjoined both the assignment and the scheduling problem in order to create a new representation scheme for a chromosome and a mutation operators.