• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 추계학술대회 논문집 학회본부A
• /
• pp.332-334
• /
• 1998

Maintenance scheduling is one of mid-term scheduling problems of power systems. There have been many methods for this problem, but there is no effective way to treat all the generators simultaneously except evolutionary algorithms. In this paper, we apply GA to the maintenance scheduling problem. And we proposed new crossover operator(BOX type crossover) to improve searching ability of GA. Satisfactory results are obtained by GA with proposed crossover operator.

• Journal of international Conference on Electrical Machines and Systems
• /
• 제1권1호
• /
• pp.135-142
• /
• 2012

In this paper, optimal selection of the unified power flow controller (UPFC) damping controller parameters in order to improve the power system dynamic response and its stability based on two modified intelligent algorithms have been proposed. These algorithms are based on a modified intelligent particle swarm optimization (PSO) and continuous genetic algorithm (GA). After extraction of UPFC dynamic model, intelligent PSO and genetic algorithms are used to select the effective feedback signal of the damping controller; then, to compare the performance of the proposed UPFC controller in damping the critical modes of a single-machine infinite-bus (SMIB) power system, the simulation results are presented. The comparison shows the good performance of both presented PSO and genetic algorithms in an optimal selection of UPFC damping controller parameters and damping oscillations.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 D
• /
• pp.2146-2148
• /
• 2002

In this paper, PID control method using genetic algorithm to control the nonlinear multivariable system is presented. Genetic algorithms are global search techniques for nonlinear optimization. For experiment, the x-y rod balancing system with driver circuit board is fabricated. Experiments such as angle and position control for system are performed. The validity and control performance of the GA-based PID controller are confirmed by experimental results.

• 한국지능시스템학회논문지
• /
• 제11권6호
• /
• pp.538-542
• /
• 2001

DNA computing 은 Adleman 실험 이후에 많은 여러 가지 최적화 문제에 적용되어 왔다. DNA computing의 장점은 스트링의 길이가 가변적이고 4가지 염기를 이용하기 때문에 복잡한 문제에 전역 최적점을 찾는데 기존의 다른 방법보다는 효율적이라는것이다. 본 논문에서는 이진 스트링의 개체 지단 위에서 모의진화를 일으켜 효율적으로 최적 해를 탐색하는 GA(Genetic Algorithms)와 생체 분자와 DNA를 계산의 도구 및 정보 저장도구로 사용하여 A(Adenine). C(Cytosine), G(Guanine), T(Thymine)등의 4가지 염기를 사용하는 DNA 코딩방법을 이용하여multi-modal 함수의 전역 최적점을 탐색하는 문제에서의 각각의 성능을 조사하였다. Selection, crossover, mutation등의 GA연산자를 DNA를 코딩에 동일하게 적용하였으며 최적의 해를 탐색하는데 걸리는 시간과 찾아낸 최적해의 값을 평가한다.을 평가한다.

• Earthquakes and Structures
• /
• 제14권3호
• /
• pp.215-227
• /
• 2018

Supplemental passive control devices are widely considered as an important tool to mitigate the dynamic response of a building under seismic excitation. Nevertheless, a systematic method for strategically placing dampers in the buildings is not prescribed in building codes and guidelines. Many deterministic and stochastic methods have been proposed by previous researchers to investigate the optimum distribution of the viscous dampers in the steel frames. However, the seismic performances of the retrofitted buildings that are under large earthquake intensity levels or near collapse state have not been evaluated by any seismic research. Recent years, an increasing number of studies utilize genetic algorithms (GA) to explore the complex engineering optimization problems. GA interfaced with nonlinear response history (NRH) analysis is considered as one of the most powerful and popular stochastic methods to deal with the nonlinear optimization problem of damper distribution. In this paper, the effectiveness and the efficiency of GA on optimizing damper distribution are first evaluated by strong ground motions associated with the collapse failure. A practical optimization framework using GA and NRH analysis is proposed for optimizing the distribution of the fluid viscous dampers within the moment resisting frames (MRF) regarding the improvements of large drifts under intensive seismic context. Both a 10-storey and a 20-storey building are involved to explore higher mode effect. A far-fault and a near-fault earthquake environment are also considered for the frames under different seismic intensity levels. To evaluate the improvements obtained from the GA optimization regarding the collapse performance of the buildings, Incremental Dynamic Analysis (IDA) is conducted and comparisons are made between the GA damper distribution and stiffness proportional damping distribution on the collapse probability of the retrofitted frames.

• Journal of Multimedia Information System
• /
• 제4권2호
• /
• pp.89-92
• /
• 2017

This paper investigates simple gray level image enhancement technique based on Genetic Algorithms and Local Statistics. The task of GA is to adapt the parameters of local sliding masks over pixels, finding out the best parameters preserving the brightness and possibly preventing the creation of intensity artifacts in the local area of images. The algorithm is controlled by GA as to enhance the contrast and details in the images automatically according to an object fitness criterion. Results obtained in terms of subjective and objective evaluations, show the plausibility of the method suggested here.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집A
• /
• pp.939-944
• /
• 2001

Genetic algorithm is modelled on natural evolution and simulated annealing is based on the simulation of thermal annealing. Both genetic algorithm and simulated annealing are stochastic method. So they can find global optimum values. For compare efficiency of SA and GA's, some function value was maximized. In the result, that was a little better than GA's.

• 한국산업정보학회:학술대회논문집
• /
• 한국산업정보학회 2008년도 추계 공동 국제학술대회
• /
• pp.463-467
• /
• 2008

Heuristic optimization using hybrid algorithms have provided a robust and efficient approach for solving many optimization problems. In this paper, a new hybrid algorithm using adaptive genetic algorithm (aGA) and particle swarm optimization (PSO) is proposed. The proposed hybrid algorithm is applied to solve numerical optimization functions. The results are compared with those of GA and other conventional PSOs. Finally, the proposed hybrid algorithm outperforms others.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 추계학술대회 학술발표 논문집
• /
• pp.361-367
• /
• 1998

The main two applications of the Genetic Algorithms(GA) are the optimization and the machine learning. Machine Learning has two objectives that make the complex system learn its environment and produce the proper output of a system. The machine learning using the Genetic Algorithms is called GA machine learning or genetic-based machine learning (GBML). The machine learning is different from the optimization problems in finding the rule set. In optimization problems, the population of GA should converge into the best individual because optimization problems, the population of GA should converge into the best individual because their objective is the production of the individual near the optimal solution. On the contrary, the machine learning systems need to find the set of cooperative rules. There are two methods in GBML, Michigan method and Pittsburgh method. The former is that each rule is expressed with a string, the latter is that the set of rules is coded into a string. Th classifier system of Holland is the representative model of the Michigan method. The classifier systems arrange the strength of classifiers of classifier list using the message list. In this method, the real time process and on-line learning is possible because a set of rule is adjusted on-line. A classifier system has three major components: Performance system, apportionment of credit system, rule discovery system. In this paper, we solve the food search problem with the learning and evolution of an artificial ant using the learning classifier system.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.418-418
• /
• 2000

This paper proposes a path planning algorithm for mobile robot. To generate an optimal path and minimum time path for a mobile robot, we use the Genetic Algorithm(GA) and Visibility Graph. After finding a minimum-distance between start and goal point, the path is revised to find the minimum time path by path-smoothing algorithm. Simulation results show that the proposed algorithms are more effective.