• Journal of Ubiquitous Convergence Technology
• /
• v.2 no.1
• /
• pp.40-50
• /
• 2008

The problem of assigning customers to satellite channels is a difficult combinatorial optimization problem and is NP-complete. For this combinatorial optimization problem, standard optimization methods take a large computation time and so genetic algorithms (GA) and ant colony optimization (ACO) can be used to obtain the best and/or optimal assignment of customers to satellite channels. In this paper, we present a comparative study of GA and ACO to this problem. Various issues related to genetic algorithms approach to this problem, such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. We also discuss an ACO for this problem. In ACO methodology, three strategies, ACO with only ranking, ACO with only max-min ant system (MMAS), and ACO with both ranking and MMAS, are considered. A comparison of these two approaches (i,e., GA and ACO) with the standard optimization method is presented to show the advantages of these approaches in terms of computation time.

• Management Science and Financial Engineering
• /
• v.13 no.1
• /
• pp.35-53
• /
• 2007

We consider a(worst-case) robust optimization version of the Economic Order Quantity(EOQ) model. Order setup costs and inventory carrying costs are assumed to have uncertainty in their values, and the uncertainty description of the two parameters is supposed to be given by an ellipsoidal representation. A genetic algorithm combined with Monte Carlo simulation is proposed to approximate the ellipsoidal representation. The objective function of the model under ellipsoidal uncertainty description is derived, and the resulting problem is solved by another genetic algorithm. Computational test results are presented to show the performance of the proposed method.

• Journal of Mechanical Science and Technology
• /
• v.17 no.12
• /
• pp.1938-1948
• /
• 2003

This paper represents that an enhanced genetic algorithm (EGA) is applied to optimal design of a squeeze film damper (SFD) to minimize the maximum transmitted load between the bearing and foundation in the operational speed range. A general genetic algorithm (GA) is well known as a useful global optimization technique for complex and nonlinear optimization problems. The EGA consists of the GA to optimize multi-modal functions and the simplex method to search intensively the candidate solutions by the GA for optimal solutions. The performance of the EGA with a benchmark function is compared to them by the IGA (Immune-Genetic Algorithm) and SQP (Sequential Quadratic Programming). The radius, length and radial clearance of the SFD are defined as the design parameters. The objective function is the minimization of a maximum transmitted load of a flexible rotor system with the nonlinear SFDs in the operating speed range. The effectiveness of the EGA for the optimal design of the SFD is discussed from a numerical example.

• International Journal of Korean Welding Society
• /
• v.3 no.2
• /
• pp.15-23
• /
• 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. This method searches for optimal settings of welding parameters through systematic experiments without a model between input and output variables. It has an advantage of being able to find optimal conditions with a fewer number of experiments than conventional full factorial design. A genetic algorithm was applied to optimization of weld bead geometry. In the optimization problem, the input variables were wire feed rate, welding voltage, and welding speed, root opening and the output variables were bead height, bead width, penetration and back bead width. The number of level for each input variable is 8, 16, 8 and 3, respectively. Therefore, according to the conventional full factorial design, in order to find the optimal welding conditions, 3,072 experiments must be performed. The genetic algorithm, however, found the near optimal welding conditions from less than 48 experiments.

• Journal of Welding and Joining
• /
• v.18 no.5
• /
• pp.63-69
• /
• 2000

A genetic algorithm was applied to an arc welding process to determine near optimal settings of welding process parameters which produce good weld quality. This method searches for optimal settings of welding parameters through systematic experiments without a model between input and output variables. It has an advantage of being able to find optimal conditions with a fewer number of experiments than conventional full factorial design. A genetic algorithm was applied to optimization of weld bead geometry. In the optimization problem, the input variables was wire feed rate, welding voltage, and welding speed and the output variables were bead height, bead width, and penetration. The number of level for each input variable is 16, 16, and 8, respectively. Therefore, according to the conventional full factorial design, in order to find the optimal welding conditions, 2048 experiments must be performed. The genetic algorithm, however, found the near optimal welding conditions from less than 40 experiments.

• International Journal of Korean Welding Society
• /
• v.1 no.1
• /
• pp.44-50
• /
• 2001

A genetic algorithm was applied to the arc welding process as to determine the near-optimal settings of welding process parameters that produce the good weld quality. This method searches for optimal settings of welding parameters through the systematic experiments without the need for a model between the input and output variables. It has an advantage of being capable to find the optimal conditions with a fewer number of experiments rather than conventional full factorial designs. A genetic algorithm was applied to the optimization of the weld bead geometry. In the optimization problem, the input variables were wire feed rate, welding voltage, and welding speed. The output variables were the bead height bead width, and penetration. The number of levels for each input variable is 16, 16, and 8, respectively. Therefore, according to the conventional full factorial design, in order to find the optimal welding conditions,2048 experiments must be performed. The genetic algorithm, however, found the near optimal welding conditions in less than 40 experiments.

• 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 Korean Society for Precision Engineering
• /
• v.19 no.10
• /
• pp.66-76
• /
• 2002

Automated welding and soldering are an important manufacturing issue in order to lower the cost, increase the quality, and avoid labor problems. An off-line programming, OLP, is one of the powerful methods to solve this kind of diversity problem. Unless an OLP system is ready for the path optimization in welding and soldering, the waste of time and cost is unavoidable due to inefficient paths in welding and soldering processes. Therefore, this study attempts to obtain path optimization using a genetic algorithm based on artificial intelligences. The problem of welding path optimization is defined as a conventional TSP (traveling salesman problem), but still paths have to go through welding lines. An improved genetic algorithm was suggested and the problem was formulated as a TSP problem considering the both end points of each welding line read from database files, and then the transit problem of welding line was solved using the improved suggested genetic algorithm.

• Proceedings of the KSME Conference
• /
• 2001.06b
• /
• pp.584-589
• /
• 2001

This paper presents the dynamic parameter design optimization of a suspension seat system using the genetic algorithm. At first, an equivalent 1-D.O.F. mass-spring-damper model of a suspension seat system was constructed for the purpose of its vibration analysis. Vertical vibration response and transmissibility of the equivalent model due to base excitations, which are defined in the ISO's seat vibration test codes, were computed. Furthermore, seat vibration test, that is ISO's damping test, was carried out in order to investigate the validity of the equivalent suspension seat model. Both analytical and experimental results showed good agreement each other. For the design optimization, the acceleration transmissibility of the suspension seat model was adopted as an object function. A simple genetic algorithm was used to search the optimum values of the design variables, suspension stiffness and damping coefficient. Finally, vibration ride performance test results showed that the optimum suspension parameters gives the lowest vibration transmissibility. Accordingly the genetic algorithm and the equivalent suspension seat modelling can be successfully adopted in the vibration ride quality optimization of a suspension seat system.

• Korean Management Science Review
• /
• v.13 no.1
• /
• pp.97-109
• /
• 1996

Genetic Algorithms have been successfully applied to various problems (for example, engineering design problems with a mix of continuous, integer and discrete design variables) that could not have been readily solved with traditional computational techniques. But, several problems for which conventional Genetic Algorithms are ill defined are premature convergence of solution and application of exterior penalty function. Therefore, we developed an Improved Genetic Algorithms (IGAs) to solve above two problems. As a case study, IGAs is applied to several nonlinear optimization problems and it is proved that this algorithm is very useful and efficient in comparison with traditional methods and conventional Genetic Algorithm.