• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2005년도 춘계공동학술대회 발표논문
• /
• pp.179-187
• /
• 2005

In this paper, we consider the problem of regrouping a number of service sites into a smaller number of service sites called centers. Each service site is represented as a point in the plane and has an associated value of service demand. We aim to group the sites so that each group has the balanced service demand and the sum of distances from the sites in the group to their corresponding center is minimized. To solve this problem, we propose a hybrid genetic algorithm that is combined with Voronoi diagrams. We provide a variety of experimental results by changing the weights of the two factors: service demands and distances. Our hybrid algorithm finds better solutions in a shorter computation time in comparison with a pure genetic algorithm.

• Journal of the Optical Society of Korea
• /
• 제7권4호
• /
• pp.264-268
• /
• 2003

A new approach to design binary phase holograms, with less computation time and equal effi-ciency compared with the genetic algorithm method, is proposed. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are tested in computer simulation and experimentally demonstrated.

• 제어로봇시스템학회논문지
• /
• 제10권8호
• /
• pp.711-717
• /
• 2004

We propose a path planning method to improve the productivity of SMT (surface mount technology) inspection machines with an area camera. A unified method is newly proposed to determine the FOV clusters and camera sequence simultaneously. The proposed method is implemented by a hybrid genetic algorithm to increase the convergence speed. Comparative simulation results are then presented to verify the usefulness of the proposed algorithm.

• 전자공학회논문지B
• /
• 제33B권4호
• /
• pp.91-99
• /
• 1996

A hybrid approach employing both the genetic algorithm and the newton-raphson method is proposed for the electrical impedance computed tomography (EICT) image reconstruction. Computational experiments based on the new concept have shown promising results for several noise-free models. In particular, the resistance distribution of the tested models having resistivity ratio up to 100:1 has been reconstructed sucessfully. Using the proposed mehtod, it is also possible to get the reconstruction by the conventional iterative approaches be difficult to vonverge to a robust solution. If the compution power is enhanced further, the proposed method is expected to stimulate the practical applications of the EICT technology in the near future.

• 산업공학
• /
• 제14권1호
• /
• pp.20-29
• /
• 2001

This paper presents a concurrent design approach that deals with manufacturing cell formation and cellular layout in Cellular Manufacturing System. Manufacturing cell formation is to group machines into machine cells dedicated to manufacture of part families, and cellular layout problem determines layout of the manufacturing cells within shop and layout of the machines within a cell. In this paper, a concurrent approach for design of machine cell and cellular layout is developed considering manufacturing parameters such as alternative process plans, alternative machines, production volume and processing time of part, and cost per unit time of operation. A mathematical model which minimizes total cost consisting of machine installation cost, machine operating cost, and intercell and intracell movements cost of part is proposed. A hybrid method based on genetic algorithm is proposed to solve the manufacturing cell formation and cellular layout design problem concurrently. The performance of the hybrid method is examined on several problems.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.330-333
• /
• 2003

Initial cluster size for clustering of partitioning methods is very important to the clustering result. In K-means algorithm, the result of cluster analysis becomes different with optimal cluster size K. Usually, the initial cluster size is determined by prior and subjective information. Sometimes this may not be optimal. Now, more objective method is needed to solve this problem. In our research, we propose a hybrid genetic algorithm, a tree induction based evolution algorithm, for determination of optimal cluster size. Initial population of this algorithm is determined by the number of terminal nodes of tree induction. From the initial population based on decision tree, our optimal cluster size is generated. The fitness function of ours is defined an inverse of dissimilarity measure. And the bagging approach is used for saying computational time cost.

• Industrial Engineering and Management Systems
• /
• 제8권1호
• /
• pp.14-21
• /
• 2009

We formulate a mathematical model of remanufacturing system as multi-stage reverse Logistics Network Problem (mrLNP) with minimizing the total costs for reverse logistics shipping cost and inventory holding cost at disassembly centers and processing centers over finite planning horizons. For solving this problem, in the 1st and the 2nd stages, we propose a Genetic Algorithm (GA) with priority-based encoding method combined with a new crossover operator called as Weight Mapping Crossover (WMX). A heuristic approach is applied in the 3rd stage where parts are transported from some processing centers to one manufacturer. Computer simulations show the effectiveness and efficiency of our approach. In numerical experiments, the results of the proposed method are better than pnGA (Prufer number-based GA).

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.442-445
• /
• 1997

We present a hybrid self-tuning method of fuzzy inference systems with hyper elliptic Gaussian membership functions using genetic algorithm(GA) and back-propagation algorithm. The proposed self-tuning method has two phases : one is the coarse tuning process based on GA and the other is the fine tuning process based on back-propagation. But the parameters which is obtained by a GA are near optimal solutions. In order to solve the problem in GA applications, it uses a back-propagation algorithm, which is one of learning algorithms in neural networks, to finely tune the parameters obtained by a GA. We provide Box-Jenkins time series to evaluate the advantage and effectiveness of the proposed approach and compare with the conventional method.

• 한국산학기술학회논문지
• /
• 제12권7호
• /
• pp.2963-2968
• /
• 2011

플라스틱 사출 제품은 다양한 가전제품과 하이테크 제품에 널리 사용되고 있다. 그러나 플라스틱 사출 제품 제조업자들은 고객을 만족시키면서 경쟁력을 얻기 위하여 다른 경쟁자들보다 먼저 새로운 제품을 시장에 출시하고 신제품의 개발기간을 줄이기 위한 노력을 할 여유가 부족하다. 따라서 무한 경쟁의 시장에서 살아남기 위해서는 제조업자들은 시장 마켓 점유를 빠르게 올리는 것과 동시에 제품의 가격 경쟁력을 가져야 한다. 본 연구에서는 하이브리드 인공신경망과 유전자 알고리즘을 이용한 특징기반 플라스틱 사출제품의 비용 평가 모델을 제안한다. 제안하는 방법은 기존의 플라스틱 사출제품의 비용평가절차와 계산을 위해 필요로 하는 변수들을 극적으로 간단하게 하고 줄일 수 있다. 사례연구는 제안하는 모델이 플라스틱 사출 제품의 개발단계에서의 비용평가문제를 해결하는데 효율성과 효과성이 있음을 입증한다.

• Industrial Engineering and Management Systems
• /
• 제12권4호
• /
• pp.306-316
• /
• 2013

The semiconductor industry has grown rapidly, and subsequently production planning problems have raised many important research issues. The reentrant flow-shop (RFS) scheduling problem with time windows constraint for harddisk devices (HDD) manufacturing is one such problem of the expanded semiconductor industry. The RFS scheduling problem with the objective of minimizing the makespan of jobs is considered. Meeting this objective is directly related to maximizing the system throughput which is the most important of HDD industry requirements. Moreover, most manufacturing systems have to handle the quality of semiconductor material. The time windows constraint in the manufacturing system must then be considered. In this paper, we propose a hybrid genetic algorithm (HGA) for improving chromosomes/offspring by checking and repairing time window constraint and improving offspring by left-shift routines as a local search algorithm to solve effectively the RFS scheduling problem with time windows constraint. Numerical experiments on several problems show that the proposed HGA approach has higher search capability to improve quality of solutions.