• 대한기계학회:학술대회논문집
• /
• 대한기계학회 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.

• Computers and Concrete
• /
• 제27권1호
• /
• pp.63-71
• /
• 2021

In this study, a new stopping criterion, called "backward controlled stopping criterion" (BCSC), was proposed to be used in Genetic Algorithms. In the study, the available stopping citeria; adaptive stopping citerion, evolution time, fitness threshold, fitness convergence, population convergence, gene convergence, and developed stopping criterion were applied to the following four comparison problems; high strength concrete mix design, pre-stressed precast concrete beam, travelling salesman and reinforced concrete deep beam problems. When completed the analysis, the developed stopping criterion was found to be more accomplished than available criteria, and was able to research a much larger area in the space design supplying higher fitness values.

• Journal of Electrical Engineering and Technology
• /
• 제1권4호
• /
• pp.435-447
• /
• 2006

This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of the service restoration in electric power distribution systems, which is a discrete optimization problem. The main objective of service restoration is, when a fault or overload occurs, to restore as much load as possible by transferring the de-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints. This problem has many constraints and it is very difficult to find the optimal solution because of its numerous local minima. In this investigation, a parallel AEA was developed for the service restoration of the distribution systems. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of the GA and the local search capability of the ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC cluster system consisting of 8 PCs was developed. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based fast Ethernet. To show the validity of the proposed method, the developed algorithm has been tested with a practical distribution system in Korea. From the simulation results, the proposed method found the optimal service restoration strategy. The obtained results were the same as that of the explicit exhaustive search method. Also, it is found that the proposed algorithm is efficient and robust for service restoration of distribution systems in terms of solution quality, speedup, efficiency, and computation time.

• KIEE International Transactions on Power Engineering
• /
• 제5A권3호
• /
• pp.269-279
• /
• 2005

This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of a reconfiguration in distribution systems. The aim of the reconfiguration is to determine the appropriate switch position to be opened for loss minimization in radial distribution systems, which is a discrete optimization problem. This problem has many constraints and it is very difficult to find the optimal switch position because of its numerous local minima. In this investigation, a parallel AEA was developed for the reconfiguration of the distribution system. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of GA and the local search capability of ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC-cluster system consisting of 8 PCs·was developed. Each PC employs the 2 GHz Pentium IV CPU, and is connected with others through switch based fast Ethernet. The new developed algorithm has been tested and is compared to distribution systems in the reference paper to verify the usefulness of the proposed method. From the simulation results, it is found that the proposed algorithm is efficient and robust for distribution system reconfiguration in terms of the solution quality, speedup, efficiency, and computation time.

• International Journal of Control, Automation, and Systems
• /
• 제6권6호
• /
• pp.809-817
• /
• 2008

Program plagiarism is widespread due to intelligent software and the global Internet environment. Consequently the detection of plagiarized source code and software is becoming important especially in academic field. Though numerous studies have been reported for detecting plagiarized pairs of codes, we cannot find any profound work on understanding the underlying mechanisms of plagiarism. In this paper, we study the evolutionary process of source codes regarding that the plagiarism procedure can be considered as evolutionary steps of source codes. The final goal of our paper is to reconstruct a tree depicting the evolution process in the source code. To this end, we extend the well-known bioinformatics approach, a local alignment approach, to detect a region of similar code with an adaptive scoring matrix. The asymmetric code similarity based on the local alignment can be considered as one of the main contribution of this paper. The phylogenetic tree or evolution tree of source codes can be reconstructed using this asymmetric measure. To show the effectiveness and efficiency of the phylogeny construction algorithm, we conducted experiments with more than 100 real source codes which were obtained from East-Asia ICPC(International Collegiate Programming Contest). Our experiments showed that the proposed algorithm is quite successful in reconstructing the evolutionary direction, which enables us to identify plagiarized codes more accurately and reliably. Also, the phylogeny construction algorithm is successfully implemented on top of the plagiarism detection system of an automatic program evaluation system.

• 한국지능시스템학회논문지
• /
• 제14권5호
• /
• pp.593-597
• /
• 2004

본 논문은 비선형 시스템의 새로운 퍼지 제어기 설계 기법을 제안한다. 기존의 퍼지 제어기 설계 방법들은 안정도 조건을 만족시키는 제어 이득을 얻기 위해 수학적인 접근을 통해 해를 찾는 방법들이 많이 연구되었다 하지만 플랜트와 제어 방법에 따라 이러한 수학적인 접근이 힘든 경우가 있다 본 논문에서는 이를 해결하기 위해 깊은 수학적인 접근이 아닌 지능적인 접근 방법을 사용하여 안정화된 퍼지 제어기의 설계하는 기법을 제안한다. 제안된 기법은 퍼지 제어기의 안정화 조건을 만족시키는 제어 이득을 전략 기반 유전 알고리즘을 사용하여 동정한다 전략 기반 유전 알고리즘은 제어기의 안정화 조건을 만족시키는 해를 찾기 위해 전략적으로 교차와 돌연변이를 변화시킨다. 전력 기반 유전 알고리즘은 제어기의 안정화 조건을 만족시키는 해를 찾기 위해 전략적으로 교차와 돌연변이 영역을 변화시킴으로서 빠르게 해를 찾는다. 최종적으로 모의 실험을 통해 제안된 기법의 우수성을 확인하였다.

• Journal of the Korean Data and Information Science Society
• /
• 제28권6호
• /
• pp.1447-1456
• /
• 2017

강우현상을 구조적으로 모형화한 확률적 강우모의모형의 활용성이 증대되는 상황에서 확률적 강우모의모형의 모수에 대한 정확한 추정은 매우 중요하다. 본 연구에서는 확률적 강우모의모형 (Neyman-Scott rectangular pulse model, NSRPM)의 모수를 DFP (Davidon-Fletcher-Powell), GA (genetic algorithm), Nelder-Mead, DE (differential evolution) 기법으로 추정하고 추정된 모수의 적합성을 분석하고 지역특성에 적합한 모수 추정 기법을 제시하였다. 낙동강 유역의 20개 강우 관측 지점을 대상으로 1973년-2017년 기간 동안의 여름철 1시간 강수자료 이용하여 산정된 모형 모수를 분석한 결과, 전반적으로 DE, Nelder-Mead기법이 가장 좋은 결과를 보였으며 DFP, GA기법은 상대적으로 낮은 적합도를 보였다.

• 한국자기학회지
• /
• 제7권2호
• /
• pp.103-108
• /
• 1997

본 논문에서는 퍼지결정법을 적용한 유도전동기의 최적설계 방법을 제시하였다. 이 방법은 설계자의 경험, 관점, 판단을 반영할 수 있을 뿐만 아니라 다목적 최적설계에 쉽게 적용가능하다. 특성 해석방법은 등가 자기회로법이며, 설계방법은 기존 설계법 중의 하나인 D$^{2}$L 법에 퍼지 결정법과 최적화 루틴을 결합하였다. 사용한 최적화 알고리즘은 확률론적 최적화기법인 (1+1) Evolution Strategy(ES)를 이용하였다. 제안된 알고리즘은 유도전동기의 무게최소화와 동시에 주요 동작점에서의 효율, 역률을 최대화 설계하는 다중목적 최적설계에 적용되었다.

• Journal of Electrical Engineering and Technology
• /
• 제10권2호
• /
• pp.653-658
• /
• 2015

This paper deals with an efficient optimization design method of a compact ultra wideband (UWB) filter which can improve the characteristics of the filter. The Evolution Strategy (ES) algorithm is adopted for the optimization and modified to suppress the ripple by inserting an additional step to the ES scheme. The algorithm has the ability to control the ripple of an insertion loss in a passband as a modified approach. During the modified ES, a structure of initial shape is changed a lot, while includes the stepped impedance (SI) and the composite right/left handed transmission line (CRLH-TL). And an optimized filter satisfies the UWB specifications on the stopband and passband with an acceptable insertion loss. The filter achieves a much developed shape, the size of $15{\times}14mm$, the 3dB bandwidth from 2.7 to 10.8GHz, the flat insertion-loss less than 1dB, the wide stopband with 12~20GHz, and an acceptable return loss.

• Advances in Computational Design
• /
• 제2권4호
• /
• pp.313-331
• /
• 2017

In this study, teaching-learning based optimization (TLBO) is improved by incorporating model of multiple teachers, adaptive teaching factor, self-motivated learning, and learning through tutorial. Modified TLBO (MTLBO) is applied for simultaneous topology, shape, and size optimization of space and planar trusses to study its effectiveness. All the benchmark problems are subjected to stress, displacement, and kinematic stability constraints while design variables are discrete and continuous. Analyses of unacceptable and singular topologies are prohibited by seeing element connectivity through Grubler's criterion and the positive definiteness. Performance of MTLBO is compared to TLBO and state-of-the-art algorithms available in literature, such as a genetic algorithm (GA), improved GA, force method and GA, ant colony optimization, adaptive multi-population differential evolution, a firefly algorithm, group search optimization (GSO), improved GSO, and intelligent garbage can decision-making model evolution algorithm. It is observed that MTLBO has performed better or found nearly the same optimum solutions.