• Proceedings of the KWS Conference
• /
• 2003.05a
• /
• pp.172-175
• /
• 2003

A genetic algorithm was applied to an arc welding process to determine near optimal settings of welding process parameters which produce good weld quality. It has an advantage of being able to find optimal conditions with a fewer number of experiments than conventional full factorial design. According to the conventional full factorial design, in order to find the optimal welding conditions, 16,384 experiments must be performed. The genetic algorithm however, found the near optimal welding conditions from less than 60 experiments.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.22 no.1
• /
• pp.61-73
• /
• 2012

The paper presents the novel approach to solve some problems occurred in application of the genetic algorithm to the determination of the optimal tire pattern sequence in order to reduce the tire air-pumping noise which is generated by the repeated compression and expansion of the air cavity between tire pattern and road surface. The genetic algorithm has been used to find the optimal tire pattern sequence having a low level of tire air-pumping noise using the image based air-pumping model. In the genetic algorithm used in the previous researches, there are some problems in the encoding structure and the selection of objective function. The paper proposed single encoding element with five integers, divergent objective function based on evolutionary process and the optimal evolutionary rate based on Shannon entropy to solve the problems. The results of the proposed genetic algorithm with evolutionary process are compared with those of the randomized algorithm without evolutionary process on the two-dimensional normal distribution. It is confirmed that the genetic algorithm is more effective to reduce the peak value of the predicted tire air-pumping noise and the consistency and cohesion of the obtained simulation results are also improved in terms of probability.

• Industrial Engineering and Management Systems
• /
• v.7 no.3
• /
• pp.204-213
• /
• 2008

Companies that produce capital goods need to schedule the production of products that have complex product structures with components that require many operations on different machines. A feasible schedule must satisfy operation and assembly precedence constraints. It is also important to avoid deadlock situations. In this paper a Genetic Algorithm (GA) has been developed that includes a new repair process that rectifies infeasible schedules that are produced during the evolution process. The algorithm was designed to minimise the combination of earliness and tardiness penalties and took into account finite capacity constraints. Three different sized problems were obtained from a collaborating capital goods company. A design of experimental approach was used to systematically identify that the best genetic operators and GA parameters for each size of problem.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.16 no.4
• /
• pp.29-35
• /
• 2007

The main objective of this paper is to propose the optimal design method of forging process using genetic algorithm. Design optimization of forging process was doing about one stage and multi stage. The objective function is considered the filling of die. The chosen design variables are die geometry in multi stage and initial billet shape in one stage. We performed FE analysis to simulated forging process. The optimized preform and initial billet shape was obtained by genetic algorithm and FE analysis. To show the efficiency of GA method in forging problem are solved and compared with published results.

• Journal of Intelligence and Information Systems
• /
• v.4 no.1
• /
• pp.1-10
• /
• 1998

Process planning is a very complex task and requires the dynamic informatioon of shop foor and market situations. Process plan selection is one of the main problems in the process planning. In this paper, we propose a new process plan selection model considering operation flexibility for the computer aided process planing. The model is formulated as a 0-1 integer programming considering realistic shop factors such as production volume, machining time, machine capacity, transportation time and capacity of tractors such as production volume, machining time, machine capacity, transportation time capacity of transfer device. The objective of the model is to minimize the sum of the processing and transportation time for all parts. A genetic algorithm a, pp.oach is developed to solve the model. The efficiency of the proposed a, pp.oach is verified with numerical examples.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.42 no.4
• /
• pp.183-193
• /
• 2019

Process mining is an analytical technique aimed at obtaining useful information about a process by extracting a process model from events log. However, most existing process models are deterministic because they do not include stochastic elements such as the occurrence probabilities or execution times of activities. Therefore, available information is limited, resulting in the limitations on analyzing and understanding the process. Furthermore, it is also important to develop an efficient methodology to discover the process model. Although genetic process mining algorithm is one of the methods that can handle data with noises, it has a limitation of large computation time when it is applied to data with large capacity. To resolve these issues, in this paper, we define a stochastic process tree and propose a tabu search-genetic process mining (TS-GPM) algorithm for a stochastic process tree. Specifically, we define a two-dimensional array as a chromosome to represent a stochastic process tree, fitness function, a procedure for generating stochastic process tree and a model trace as a string of activities generated from the process tree. Furthermore, by storing and comparing model traces with low fitness values in the tabu list, we can prevent duplicated searches for process trees with low fitness value being performed. In order to verify the performance of the proposed algorithm, we performed a numerical experiment by using two kinds of event log data used in the previous research. The results showed that the suggested TS-GPM algorithm outperformed the GPM algorithm in terms of fitness and computation time.

• Journal of Welding and Joining
• /
• v.30 no.6
• /
• pp.126-132
• /
• 2012

The GMA welding process involves large number of interdependent variables which may affect product quality, productivity and cost effectiveness. The relationships between process parameters for a fillet joint and bead geometry are complex because a number of process parameters are involved. To make the automated GMA welding, a method that predicts bead geometry and accomplishes the desired mechanical properties of the weldment should be developed. The developed method should also cover a wide range of material thicknesses and be applicable for all welding position. For the automatic welding system, the data must be available in the form of mathematical equations. In this study a new intelligent model with genetic algorithm has been proposed to investigate interrelationships between welding parameters and bead geometry for the automated GMA welding process. Through the developed model, the correlation between process parameters and bead geometry obtained from the actual experimental results, predicts that data did not show much of a difference, which means that it is quite suitable for the developed genetic algorithm. Progress to be able to control the process parameters in order to obtain the desired bead shape, as well as the systematic study of the genetic algorithm was developed on the basis of the data obtained through the experiments in this study can be applied. In addition, the developed genetic algorithm has the ability to predict the bead shape of the experimental results with satisfactory accuracy.

• Journal of Physiology & Pathology in Korean Medicine
• /
• v.22 no.6
• /
• pp.1557-1561
• /
• 2008

Red ginseng possibly has new ingredients converted during steaming and dry process from fresh ginseng. Kujeungkupo method which means 9 repetitive steamings and dryings process was used for the production of red ginseng from 6-year old ginseng roots. Saponin was extracted from each red ginseng produced at the 1st, 3rd, 5th, 7th, and 9th during the steaming and drying treatment, and we analyzed saponin content with TLC. Minor saponins, such as ginsenoside-Rg3, -Rh2, compound K, and F2, increased as the process time of steaming and drying, but major saponins (ginsenoside-Rb1, -Rb2, -Rc, -Rd, -Re, -Rf, -Rg1) were decreased. Major saponins were yet observed almost at the 1st process, then degraded as the increasing time of steaming and drying process. Especially, ginsenoside-Re and -Rg were observed as considerable amount after the 1st treatment, but there were no trace of them after the 9th treatment. Ginsenoside-Rg1, -Rb2, and -Rb1 were also reduced remarkedly by 96.6%, 96%, and 92.3%, respectively. Minor saponins were increased significantly, especially for ginsenoside-Rg3 and ginsenoside-F2. These results suggest that Kujeungkupo method is the very useful method for the production of minor ginsenoside-Rg3 and -Rh2.

• Journal of the Korean Society for Precision Engineering
• /
• v.24 no.4 s.193
• /
• pp.84-92
• /
• 2007

Dynamic process planning requires not only more flexible capabilities of a CAPP system but also higher utility of the generated process plans. In order to meet the requirements, this paper develops an algorithm that can select machines for the machining operations by calculating the machine loads. The developed algorithm is based on the multi-objective genetic algorithm that gives rise to a set of optimal solutions (in general, known as the Pareto-optimal solutions). The objective is to satisfy both the minimization number of part movements and the maximization of machine utilization. The algorithm is characterized by a new and efficient method for nondominated sorting through K-means algorithm, which can speed up the running time, as well as a method of two stages for genetic operations, which can maintain a diverse set of solutions. The performance of the algorithm is evaluated by comparing with another multiple objective genetic algorithm, called NSGA-II and branch and bound algorithm.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.6 no.1
• /
• pp.33-38
• /
• 2006

In this paper, we propose a new architecture of Fuzzy Polynomial Neural Networks(FPNN) by means of genetically optimized Fuzzy Polynomial Neuron(FPN) and discuss its comprehensive design methodology involving mechanisms of genetic optimization, especially Genetic Algorithms(GAs). The conventional FPNN developed so far are based on mechanisms of self-organization and evolutionary optimization. The design of the network exploits the extended Group Method of Data Handling(GMDH) with some essential parameters of the network being provided by the designer and kept fixed throughout the overall development process. This restriction may hamper a possibility of producing an optimal architecture of the model. The proposed FPNN gives rise to a structurally optimized network and comes with a substantial level of flexibility in comparison to the one we encounter in conventional FPNNs. It is shown that the proposed advanced genetic algorithms based Fuzzy Polynomial Neural Networks is more useful and effective than the existing models for nonlinear process. We experimented with Medical Imaging System(MIS) dataset to evaluate the performance of the proposed model.