• 한국경영과학회지
• /
• 제24권3호
• /
• pp.73-82
• /
• 1999

In this paper, we address a single machine non-preemptive n-job scheduling problem to minimize the sum of earliness and tardiness with different release times and due dates. To solve the problem, we propose a genetic algorithm with new crossover and mutation operators to find the job sequencing. For the proposed genetic algorithm, the optimal pair of crossover and mutation rates is investigated. To illustrate the suitability of genetic algorithm, solutions of genetic algorithm are compared with solutions of exhaustive enumeration method in small size problems and tabu search method in large size problems. Computational results demonstrate that the proposed genetic algorithm provides the near-optimal job sequencing in the real world problem.

• 한국공작기계학회논문집
• /
• 제12권3호
• /
• pp.82-88
• /
• 2003

SGA(Single Genetic Algorithm) is a heuristic global optimization method based on the natural characteristics and uses many populations and stochastic rules. Therefore SGA needs many function evaluations and takes much time for convergence. In order to solve the demerits of SGA, ${\mu}GA$(Micro-Genetic Algorithm) has recently been developed. In this study, ${\mu}GA$ which have small populations and fast convergence rate, was applied to structural optimization with discrete or integer variables such as 3, 10 and 25 bar trusses. The optimized results of ${\mu}GA$ were compared with those of SGA. Solutions of ${\mu}GA$ for structural optimization were very similar or superior to those of SGA, and faster convergence rate was obtained. From the results of examples, it is found that ${\mu}GA$ is a suitable and very efficient optimization algorithm for structural design.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2003년도 춘계학술대회 논문집
• /
• pp.9-14
• /
• 2003

SGA (Single Genetic Algorithm) is a heuristic global optimization method based on the natural characteristics and uses many populations and stochastic rules. Therefore SGA needs many function evaluations and takes much time for convergence. In order to solve the demerits of SGA, $\mu$GA(Micro-Genetic Algorithm) has recently been developed. In this study, $\mu$GA which have small populations and fast convergence rate, was applied to structural optimization with discrete or integer variables such as 3, 10 and 25 bar trusses. The optimized results of $\mu$GA were compared with those of SGA. Solutions of $\mu$GA for structural optimization were very similar or superior to those of SGA, and faster convergence rate was obtained. From the results of examples, it is found that $\mu$GA is a suitable and very efficient optimization algorithm for structural design.

• 산업공학
• /
• 제16권3호
• /
• pp.280-290
• /
• 2003

Many firms are trying to optimize their production and distribution functions separately, but possible savings by this approach may be limited. Nowadays, it is more important to analyze these two functions simultaneously by trading off the costs associated with the whole. In this paper, I treat a production and distribution planning problem for single-period inventory products comprised of a single production facility and multiple customers, with the aim of optimally coordinating important and interrelated decisions of production sequencing and vehicle routing. Then, I propose a hybrid genetic algorithm incorporating several local optimization techniques, HGAP, for integrated production-distribution planning. Computational results on test problems show that HGAP is effective and generates substantial cost savings over Hurter and Buer's decoupled planning approach in which vehicle routing is first developed and a production sequence is consequently derived. Especially, HGAP performs better on the problems where customers are dispersed with multi-item demand than on the problems where customers are divided into several zones based on single-item demand.

• 경영과학
• /
• 제20권1호
• /
• pp.51-64
• /
• 2003

The JSSP (Job Shop Scheduling Problem) Is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on genetic algorithm to address JSSP. we design scheduling method based on SGA (Single Genetic Algorithm) and PGA (Parallel Genetic Algorithm). In the scheduling method, the representation, which encodes the job number, is made to be always feasible, initial population is generated through integrating representation and G&T algorithm, the new genetic operators and selection method are designed to better transmit the temporal relationships in the chromosome, and island model PGA are proposed. The scheduling method based on genetic algorithm are tested on five standard benchmark JSSPs. The results were compared with other proposed approaches. Compared to traditional genetic algorithm, the proposed approach yields significant improvement at a solution. The superior results indicate the successful Incorporation of generating method of initial population into the genetic operators.

• 정보처리학회논문지B
• /
• 제17B권2호
• /
• pp.157-162
• /
• 2010

본 논문에서는 분산된 거대한 네트워크상의 데이터에서 유용한 정보를 추출하는 새로운 마이그레이션 조절방법을 이용한 유전 알고리즘을 제안한다. 제안된 알고리즘의 주된 아이디어는 부분 개체군 사이에서 개체들의 이동에 필요한 파라미터들을 적응적으로 결정하는 것이다. 또 이동된 개체들이 새로운 부분 개체군에서 도태되지 않고 적응 할 수 있기 위한 방법을 제시한다. UCI 기계학습 관련 데이터 셋에서 중앙 집중적 단일 유전 알고리즘과 제안된 알고리즘을 비교하기 위해 여섯 개의 데이터를 사용했다. 결론적으로 분산 유전 알고리즘을 적용한 특징 부분 집합이 단일 유전 알고리즘을 적용한 것 보다 좋은 성능을 보였다.

• Industrial Engineering and Management Systems
• /
• 제10권4호
• /
• pp.247-254
• /
• 2011

In this paper, we study a single-machine scheduling problem with deteriorating processing time of jobs and multiple rate-modifying activities which reset deteriorated processing time to the original processing time. In this situation, the objective function is to minimize total completion time. First, we formulate an integer programming model. Since the model is difficult to solve as the size of real problem being very large, we design an improved genetic algorithm called adaptive genetic algorithm (AGA) with spontaneously adjusting crossover and mutation rate depending upon the status of current population. Finally, we conduct some computational experiments to evaluate the performance of AGA with the conventional GAs with various combinations of crossover and mutation rates.

• 대한전기학회논문지:전력기술부문A
• /
• 제49권10호
• /
• pp.479-485
• /
• 2000

This paper presents a analysis method for dynamic characteristics of power system using a Genetic-based Power System Stabilizer(PSS). The proposed PSS parameters are optimized using Genetic Algorithm(GA) in order to maintain optimal operation of generator under the various operating conditions. To decrease the computational time, real variable string is adopted. The results tested on a single machined infinite bus system verify that the proposed controller has better dynamic performance than conventional controller.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 하계종합학술대회논문집
• /
• pp.781-784
• /
• 1998

An image segmentation approach based on the fuzzy worm searching and MIN-MAx clusterng algorithm is proposed in this paper. This algorithm deals with fuzzy worm value and min-max node at a gross scene level, which investigates the edge information including fuzzy worm action. But current segmentation methods based edge extraction methods generally need the mask information for the algebraic model, and take long run times at mask operation, wheras the proposed algorithm has single operation ccording to active searching of fuzzy worms. In addition, we also genetic min-max clustering using genetic algorithm to complete clustering and fuzyz searching on grey-histogram of image for the optimum solution, which can automatically determine the size of rnages and has both strong robust and speedy calculation. The simulation results showed that the proposed algorithm adaptively divided the quantized images in histogram region and performed single searching methods, significantly alleviating the increase of the computational load and the memory requirements.

• 반도체디스플레이기술학회지
• /
• 제13권2호
• /
• pp.23-28
• /
• 2014

For the reconstruction of three-dimensional (3D) shape of microscopic objects through shape from focus (SFF) methods, usually a single focus measure operator is employed. However, it is difficult to compute accurate depth map using a single focus measure due to different textures, light conditions and arbitrary object surfaces. Moreover, real images with diverse types of illuminations and contrasts lead to the erroneous depth map estimation through a single focus measure. In order to get better focus measurements and depth map, we have combined focus measure operators by using genetic algorithm. The resultant focus measure is obtained by weighted sum of the output of various focus measure operators. Optimal weights are obtained using genetic algorithm. Finally, depth map is obtained from the refined focus volume. The performance of the developed method is then evaluated by using both the synthetic and real world image sequences. The experimental results show that the proposed method is more effective in computing accurate depth maps as compared to the existing SFF methods.