• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.135-148
• /
• 2000

In this paper, we present a linear scheduling method for homogeneous multiprocessor systems using genetic algorithms. In general, genetic algorithms randomly generate initial strings, which leads to long operation time and slow convergence due to an inappropriate initialization. The proposed algorithm considers communication costs among processors and generates initial strings such that successive nodes are grouped into the same cluster. In the crossover and mutation operations, the algorithm maintains linearity in scheduling by associating a node with its immediate successor or predecessor. Linear scheduling can fully utilize the inherent parallelism of a given program and has been proven to be superior to nonlinear scheduling on a coarse grain DAG (directed acyclic graph). This paper emphasizes the usability of the genetic algorithm for real-time applications. Simulation results show that the proposed algorithm rapidly converges within 50 generations in most DAGs.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.21 no.6
• /
• pp.954-960
• /
• 2012

Nowadays, rapidly changing and unstable global economic environments request a lot of roles to engineers. In this situation, product should be designed to make more profit by cost down and to satisfy distinguished performance comparing to other competitive ones. In this research, the optimization design of the industrial robot casting will be done. The weight and deflection have to be reduced as objective functions and stress has to be constrained under some constant value. To reduce time cost, CCD (Central Composite Design) will be used to make experimental design. And RSM (Response Surface Methodology) will be taken to make regression model for objective functions and constraint function. Finally, optimization will be done with Genetic Algorithm. In this problem, the objective functions are multiple, so NSGA-II which is brilliant and efficient for such a problem will be used. For the solution quality check, the diversity between Pareto solutions will be also checked.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.2B
• /
• pp.137-144
• /
• 2002

In this paper, we optimize the base station placement and transmission power using genetic approach. A new representation describing base station placement and transmit power with real number is proposed, and new genetic operators are introduced. This new representation can describe the locations, powers, and number of base stations, Considering coverage, power and economy efficiency, we also suggest a weighted objective function. Our algorithm is applied to an obvious optimization problem, and then it is verified. Moreover, our approach is tried in inhomogeneous traffic distribution. Simulation result proves that the algorithm enables to fad near optimal solution according to the weighted objective function.

• Journal of KIISE:Software and Applications
• /
• v.31 no.3
• /
• pp.293-307
• /
• 2004

We consider the problem of scheduling tasks of a precedence constrained task graph, where each task has its execution time and deadline, onto a set of identical processors in a way that simultaneously minimizes the number of processors required and the total tardiness of tasks. Most existing approaches tend to focus on the minimization of the total tardiness of tasks. In another methods, solutions to this problem are usually computed by combining the two objectives into a simple criterion to be optimized. In this paper, the minimization is carried out using a multiobjective genetic algorithm (GA) that independently considers both criteria by using a vector-valued cost function. We present various GA components that are well suited to the problem of task scheduling, such as a non-trivial encoding strategy. a domination-based selection operator, and a heuristic crossover operator We also provide three local improvement heuristics that facilitate the fast convergence of GA's. The experimental results showed that when compared to five methods used previously, such as list-scheduling algorithms and a specific genetic algorithm, the Performance of our algorithm was comparable or better for 178 out of 180 randomly generated task graphs.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.39 no.7
• /
• pp.673-679
• /
• 2015

In this study, the nondominated sorting genetic algorithm (NSGA-II) is used to obtain the optimized proportional-integral-derivative (PID) gain value that can quickly recover the motion of a quadcopter after a disturbance. Prior to PID control, the four-rotor quadcopter interval was defined using computational fluid dynamics (CFD). Through the definition of this model, the PID control algorithm was generated. To construct a response surface model, D-optimal programming was used for the generation of experimental points. For this purpose, a gain value that satisfies both the roll and altitude PID gain values is obtained. Using the NSGA-II, the gain value of shorten time of the quadcopter motion control can be optimized.

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

This paper is focused on the optimum design for decreasing volume and increasing reliability of multi-stage gear drive. For the optimization on volume and reliability, multi-objective optimization is used. The genetic algorithm is introduced to multi-objective optimization method and it is used to develop the optimum design program using exterior penalty function method to solve the complicated subject conditions. A 5 staged gear drive(geared motor) is chosen to compare the result of developed optimum design method with the existing design. Each of the volume objective, reliability objective, and volume-reliability multi-objectives are performed and compared with existing design. As a result, optimum solutions are produced, which decrease volume and increase reliability. It is shown that the developed design method is good for multi-stage gear drive design.

• Journal of the Korean Society for Precision Engineering
• /
• v.32 no.9
• /
• pp.815-824
• /
• 2015

In this study, we conducted the approximate multi-objective optimization of gap sizes of pressurized-water reactor (PWR) annular fuels. To determine the contacting tendency of the inner-outer gaps between the annular fuel pellets and cladding, thermoelastic-plastic-creep (TEPC)analysis of PWR annular fuels was performed, using in-house FE code. For the efficient heat transfer at certain levels of stress, we investigated the tensile, compressive hoop stress and temperature, and optimized the gap sizes using the non-dominant sorting genetic algorithm (NSGA-II). For this, response surface models of objective and constraint functions were generated, using central composite (CCD) and D-optimal design. The accuracy of approximate models was evaluated through $R^2$ value. The obtained optimal solutions by NSGA-II were verified through the TEPC analysis, and we compared the obtained optimum solutions and generated errors from the CCD and D-optimal design. We observed that optimum solutions differ, according to design of experiments (DOE) method.

• Proceedings of the KIEE Conference
• /
• 1994.07a
• /
• pp.165-167
• /
• 1994

This paper presents a new method for multiobjective optimization using Genetic Algorithm-Sexual Reproduction Model(SR model). In SR model, each individual consists of chromosome pairs. Sex cells(gametes) are produced through artificial meiosis in which crossover and mutation occur, The proposed method has two selection operators, one, individual selection which selects the individual to fertilize, and the other, gamete selection which makes zygote for offspring production, The two selection schemes are repectively conducted according to different fitness(or objective) function and consequently give a solution which is unbiased to any objectives. We apply the proposed method to optimization of the design parameters of Linear Induction Motor(LIM) and show its effectiveness.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.8
• /
• pp.1765-1772
• /
• 2015

In the underwater acoustic communication channels, multipath reflection become the cause of obstacle. Generally, equalizer has been applied to overcome these problems. In this paper, the method was proposed to optimize tap-length of decision feedback equalizer using genetic algorithm. After inputting feed-forward filter length and feed-back filter length as genetic information of the genetic algorithm, it optimize tap-length using BER(bit error rate) calculation in accordance with object function. The object function consist of decision feedback equalizer and BER calculation. For the purpose of BER calculation in the object function, the method was proposed to optimize the tap-length of decision feedback equalizer with genetic algorithm using preamble signals. As a result of experiments, the optimized BER is 0.0355 for signals which were received through a 25m receiver and which were applied to calculate BER merely using preamble signals in object function. When all data were used to calculate BER in object function, the optimized BER is 0.0215.

• Journal of Korean Society of Transportation
• /
• v.18 no.6
• /
• pp.89-99
• /
• 2000

To cope with the limits of conventional O-D trip matrix collecting methods, several approaches have been developed. One of them is bilevel Programming method Proposed by Yang(1995), which uses Sensitivity Analysis Based(SAB) algorithm to solve Generalized Least Square(GLS) problem. However, the SAB a1gorithm has revealed two critical short-comings. The first is that when there exists a significant difference between target O-D matrix and true O-D matrix, SAB algorithm may not produce correct solution. This stems from the heavy dependance on the historical O-D information, in special when gravel Patterns are dramatically changed. The second is the assumption of iterative linear approximation to original Problem. Because of the approximation, SAB algorithm has difficulty in converging to Perfect Stackelberg game condition. So as to avoid the Problems. we need a more robust and stable solution method. The main purpose of this Paper is to show the problem of the dependency of Previous models and to Propose an alternative solution method to handle it. The Problem of O-D matrix estimation is intrinsically nonlinear and nonconvex. thus it has multiple solutions. Therefore it is necessary to require a method for searching globa1 solution. In this paper, we develop a solution algorithm combined with genetic algorithm(GA) , which is widely used as probabilistic global searching method To compare the efficiency of the algorithm, SAB algorithm suggested by Yang et al. (1992,1995) is used. From the results of numerical example, the Proposed algorithm is superior to SAB algorithm irrespective of travel patterns.