• 산업공학
• /
• 제20권4호
• /
• pp.504-514
• /
• 2007

The multicast routing problem lies in the composition of a multicast routing tree including a source node and multiple destinations. There is a trade-off relationship between cost and delay, and the multicast routing problem of optimizing these two conditions at the same time is a difficult problem to solve and it belongs to a multi-objective optimization problem (MOOP). A multi-objective genetic algorithm (MOGA) is efficient to solve MOOP. A micro-genetic algorithm(${\mu}GA$) is a genetic algorithm with a very small population and a reinitialization process, and it is faster than a simple genetic algorithm (SGA). We propose a multi-objective micro-genetic algorithm (MO${\mu}GA$) that combines a MOGA and a ${\mu}GA$ to find optimal solutions (Pareto optimal solutions) of multicast routing problems. Computational results of a MO${\mu}GA$ show fast convergence and give better solutions for the same amount of computation than a MOGA.

• 한국게임학회 논문지
• /
• 제17권5호
• /
• pp.123-132
• /
• 2017

경로 탐색 알고리즘은 이동 가능한 에이전트가 게임 내의 가상 월드에서 현재 위치로부터 목적지까지 가는 경로를 탐색하는 알고리즘을 뜻한다. 기존의 경로 탐색 알고리즘은 A*, Dijkstra와 같이 비용기반으로 그래프 탐색을 수행한다. A*와 Dijkstra는 월드 맵에서 이동 가능한 노드와 에지 정보들을 필요로 해서 맵의 정보가 다양하고 많은 온라인 게임에 적용하기 힘들다. 본 논문에서는 가변환경이나 맵의 데이터가 방대한 게임에서 적용 가능한 경로 탐색 알고리즘을 개발하기 위해 맵의 정보 없이 교배, 교차, 돌연변이, 진화 연산을 통해 해를 찾는 유전 알고리즘(Genetic Algorithm, GA)을 활용한 Heuristic-based Genetic Algorithm Path-finding(HGAP)를 제안한다. 제안하는 알고리즘은 Binary-Coded Genetic Algorithm을 기반으로 하며 목적지에 더 빨리 도달하기 위해 목적지로 가는 경로를 추정하는 휴리스틱 연산을 수행하여 경로를 탐색한다.

• 한국정보시스템학회지:정보시스템연구
• /
• 제12권2호
• /
• pp.1-20
• /
• 2003

This paper deals with the application of the genetic algorithm to the technical trading rule of the stock market. MACD(Moving Average Convergence & Divergence) and the Stochastic techniques are widely used technical trading rules in the financial markets. But, it is necessary to determine the parameters of these trading rules in order to use the trading rules. We use the genetic algorithm to obtain the appropriate values of the parameters. We use the daily KOSPI data of eight years during January 1995 and October 2002 as the experimental data. We divide the total experimental period into learning period and testing period. The genetic algorithm determines the values of parameters for the trading rules during the teaming period and we test the performance of the algorithm during the testing period with the determined parameters. Also, we compare the return of the genetic algorithm with the returns of buy-hold strategy and risk-free asset. From the experiment, we can see that the genetic algorithm outperforms the other strategies. Thus, we can conclude that genetic algorithm can be used successfully to the technical trading rule.

• 대한전기학회논문지:전력기술부문A
• /
• 제50권2호
• /
• pp.76-82
• /
• 2001

This paper presents a approach for a service restoration and optimal reconfiguration of distribution network using Genetic algorithm(GA) and Tabu search(TS) method. Restoration and reconfiguration problems in distribution network are difficult to solve in short times, because distribution network supplies power for customers combined with many tie-line switches and sectionalizing switches. Furthermore, the solutions of these problems have to satisfy radial operation conditions and reliability indices. To overcome these time consuming and sub-optimal problem characteristics, this paper applied Genetic-Tabu algorithm. The Genetic-Tabu algorithm is a Tabu search combined with Genetic algorithm to complement the weak points of each algorithm. The case studies with 7 bus distribution network showed that not the loss reduction but also the reliability cost should be considered to achieve the economic service restoration and reconfiguration in the distribution network. The results of suggested Genetic-Tabu algorithm and simple Genetic algorithm are compared in the case study also.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.297-300
• /
• 1997

This paper uses genetic algorithm (GA) for optimal control. GA can find optimal control profile, but the profile may be oscillating feature. To make profile smooth, fuzzy genetic algorithm (FGA) is proposed. GA with fuzzy logic techniques for optimal control can make optimal control profile smooth. We describe the Fuzzy Genetic Algorithm that uses a fuzzy knowledge based system to control GA search. Result from the simulation example shows that GA can find optimal control profile and FGA makes a performance improvement over a simple GA.

• 한국지하수토양환경학회:학술대회논문집
• /
• 한국지하수토양환경학회 2002년도 추계학술발표회
• /
• pp.24-27
• /
• 2002

The optimal designs of groundwater problems of contaminant containment and cleanup using linear programming and genetic algorithm are provided. In the containment problem, genetic algorithm shows the superior feature to linear programming. In cleanup problem, genetic algorithm makes reasonable optimal design. Un this study, it is demonstrated through numerical experiments that genetic algorithm can be applied to remedial designs of groundwater problems.

• 한국공작기계학회논문집
• /
• 제13권3호
• /
• pp.126-132
• /
• 2004

This paper proposed trajectory tracking control based on genetic algorithm. Trajectory tracking control scheme are real coding genetic algorithm(RCGA) and back-propagation algorithm(BPA). Control scheme ability experience proposed simulation. Stable tracking control problem of mobile robots have been studied in recent years. These studies have guaranteed stability of controller, but the performance of transient state has not been guaranteed. In some situations, constant gain controller shows overshoots and oscillations. So we introduce better control scheme using real coding genetic algorithm and neural network. Using RCGA, we can find proper gains in several situations and these gains are generalized by neural network. The generalization power of neural network will give proper gain in untrained situation. Performance of proposed controller will verity numerical simulations and the results show better performance than constant gain controller.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2004년도 추계학술대회 논문집
• /
• pp.198-202
• /
• 2004

This study proposes a new optimization algorithm which is combined with genetic algorithm and ANOM. This improved genetic algorithm is not only faster than the simple genetic algorithm, but also gives a more accurate solution. The optimizing ability and convergence rate of a new optimization algorithm is identified by using a test function which have several local optimum and an optimum design of rocker arm shaft. The calculation results are compared with the simple genetic algorithm.

• 대한기계학회논문집A
• /
• 제29권6호
• /
• pp.835-841
• /
• 2005

This study proposes a new optimization algorithm which is combined with genetic algorithm and ANOM. This improved genetic algorithm is not only faster than the simple genetic algorithm, but also gives a more accurate solution. The optimizing ability and convergence rate of a new optimization algorithm is identified by using a evaluation function which have several local optimum and an optimum design of rocker arm shaft. The calculation results are compared with the simple genetic algorithm.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2001년도 추계학술대회논문집 II
• /
• pp.805-809
• /
• 2001

This paper is presented to determine the optimal parameters of squeeze film damper using an enhanced genetic algorithm (EGA). The damper design parameters are the radius, length and radial clearance of the damper. The objective function is minimization of a transmitted load between bearing and foundation at the operating and critical speeds of a flexible rotor. The present algorithm was the synthesis of a genetic algorithm with simplex method for a local concentrate search. This hybrid algorithm is not only faster than the standard genetic algorithm, but also gives a more accurate solution and can find both the global and local optimum solution. The numerical example is presented that illustrated the effectiveness of enhanced genetic algorithm for the optimal design of the squeeze film damper for reducing transmitted load.