• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.2
• /
• pp.97-109
• /
• 2002

Manufacturing environments in the real world are subject to many sources of change and uncertainty, such as new job releases, job cancellations, a chance in the processing time or start time of some operation. Thus, the realistic scheduling method should Properly reflect these dynamic environment. Based on the release times of jobs, JSSP (Job Shoe Scheduling Problem) can be classified as static and dynamic scheduling problem. In this research, we mainly consider the dynamic JSSP with continually arriving jobs. The goal of this research is to develop an efficient scheduling method based on GA (Genetic Algorithm) to address dynamic JSSP. we designed scheduling method based on SGA (Sing1e Genetic Algorithm) and PGA (Parallel Genetic Algorithm) The scheduling method based on GA is extended to address dynamic JSSP. Then, This algorithms are tested for scheduling and rescheduling in dynamic JSSP. The results is compared with dispatching rule. In comparison to dispatching rule, the GA approach produces better scheduling performance.

• Journal of Information Processing Systems
• /
• v.20 no.2
• /
• pp.263-272
• /
• 2024

A model based on genetic algorithm optimization, GA-SVM, is proposed to warn university students of their status. This model improves the predictive effect of support vector machines. The genetic optimization algorithm is used to train the hyperparameters and adjust the kernel parameters, kernel penalty factor C, and gamma to optimize the support vector machine model, which can rapidly achieve convergence to obtain the optimal solution. The experimental model was trained on open-source datasets and validated through comparisons with random forest, backpropagation neural network, and GA-SVM models. The test results show that the genetic algorithm-optimized radial basis kernel support vector machine model GA-SVM can obtain higher accuracy rates when used for early warning in university learning.

• Journal of the Ergonomics Society of Korea
• /
• v.20 no.1
• /
• pp.45-62
• /
• 2001

This study suggests a genetic algorithm-based partial least squares (GA-based PLS) method to select the design variables for building a usability model. The GA-based PLS uses a genetic algorithm to minimize the root-mean-squared error of a partial least square regression model. A multiple linear regression method is applied to build a usability model that contains the variables seleded by the GA-based PLS. The performance of the usability model turned out to be generally better than that of the previous usability models using other variable selection methods such as expert rating, principal component analysis, cluster analysis, and partial least squares. Furthermore, the model performance was drastically improved by supplementing the category type variables selected by the GA-based PLS in the usability model. It is recommended that the GA-based PLS be applied to the variable selection for developing a usability model.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.5
• /
• pp.93-99
• /
• 2000

In many dynamic structural optimization problems, the goal is to reduce the total weight of the structure without causing the resonance. Up to now, gradient informations(i.e., design sensitivity) have been used to achieve the goal. For some class of dynamic problems, especially coalescent eigenvalue Problems with multiobjective optimization, the design sensitivity analysis is too much complicated mathematically and numerically. Therefore, this article proposes a new technique fur structural dynamic modification using a mode modification method with Genetic Algorithm(GA). In GA formulation, fitness is defined based on penalty function approach. Design variables are iteratively improved by using genetic algorithm. Two numerical examples are shown, (ⅰ) a cantilevered plate, and (ⅱ) H-shaped structure. The results demonstrate that the proposed method is highly efficient.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.331-334
• /
• 1996

It is a well-known problem that the adaptive control has a poor transient response. In order to improve this problem, the scheme that model-reference adaptive control (MRAC) uses the genetic algorithm (GA) in the search for parameters is proposed. Use genetic algorithm (GA) in the searching for controller's parameters set and conventional gradient method for fine tuning. And show the reduction of the oscillations in transient response comparing with the conventional MRAC.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2002.12a
• /
• pp.379-382
• /
• 2002

GA(Genetic Algorithm)는 자연계 진화를 모방한 계산 알고리즘으로서 단순하고 응용이 쉽기 때문에 여러 분야에 사용되고 있다. 하지만 GA의 단점은 일반적인 소프트웨어로 동작시켰을 때는 실행속도가 느리다는 것이다. 특히 chromosome이 길 경우 연속적인 교차, 돌연변이를 수행해야한다. GA Processor(GAP)는 GA를 수행하기위한 전용 Processor로서 GA의 동작을 빨리 수행할 수 있게 한다. 본 논문에서는 pipeline 구조의 GAP를 설계하여 GA를 수행함에 있어 소프트웨어와 하드웨어의 성능을 비교한다.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2001.04a
• /
• pp.223-232
• /
• 2001

This paper describes Genetic Algorithm-Based Relay Search Method, RS-GA, which is developed in this study to search the multiple design variables in the design space. The RS-GA based on Simple-GA consists of some functions to search many variables from some wide variable space. It repeats a Simple-GA, that is the convergence process of the Simple-GA, which makes many time reiteration itself. From the results of the numerical studies, it was actually found that RS-GA can search all peak-variable from the 2D functions including 5 peaks. Finally, RS-GA applied for design-strengthening problems in composite plate girder bridges using the external prestressing technique is also verified.

• Journal of the military operations research society of Korea
• /
• v.35 no.3
• /
• pp.47-59
• /
• 2009

A hybrid Genetic Algorithm is applied to military resource allocation problem. Since military uses many resources in order to maximize its ability, optimization technique has been widely used for analysing resource allocation problem. However, most of the military resource allocation problems are too complicate to solve through the traditional operations research solution tools. Recent innovation in computer technology from the academy makes it possible to apply heuristic approach such as Genetic Algorithm(GA), Simulated Annealing(SA) and Tabu Search(TS) to combinatorial problems which were not addressed by previous operations research tools. In this study, a hybrid Genetic Algorithm which reinforces GA by applying local search algorithm is introduced in order to address military optimization problem. The computational result of hybrid Genetic Algorithm on Missile Interceptor Allocation problem demonstrates its efficiency by comparing its result with that of a simple Genetic Algorithm.

• Computational Structural Engineering
• /
• v.8 no.2
• /
• pp.123-132
• /
• 1995

Genetic Algorithms(GA), which are based on the theory of natural evolution, have been evaluated highly for their robust performances. Traditional GA has mostly used binary code for representing design variable. The binary code GA has many difficulties to solve optimization problems with continuous design variables because of its large computer core memory size, inefficiency of its computing time, and its bad performance on local search. In this paper, a real code GA is proposed for dealing with the above problems. So, new crossover and mutation processes of GA are developed to use continuous design variables directly. The results of read code GA are compared with those of binary code GA for several single and multiple objective optimization problems. As a result of comparisons, it is found that the performance of the real code GA is better than that of the binary code GA, and concluded that the real code GA developed here can be used for the general optimization problem.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.323-335
• /
• 1999

In this paper, we propose a new hybrid model of artificial neural networks(ANNs) and genetic algorithm (GA) to optimal feature transformation and feature weighting. Previous research proposed several variants of hybrid ANNs and GA models including feature weighting, feature subset selection and network structure optimization. Among the vast majority of these studies, however, ANNs did not learn the patterns of data well, because they employed GA for simple use. In this study, we incorporate GA in a simultaneous manner to improve the learning and generalization ability of ANNs. In this study, GA plays role to optimize feature weighting and feature transformation simultaneously. Globally optimized feature weighting overcome the well-known limitations of gradient descent algorithm and globally optimized feature transformation also reduce the dimensionality of the feature space and eliminate irrelevant factors in modeling ANNs. By this procedure, we can improve the performance and enhance the generalisability of ANNs.