• 대한전기학회논문지:전력기술부문A
• /
• 제49권5호
• /
• pp.205-211
• /
• 2000

This paper presents an optimal design method for fuzzy logic controller (FLC) of HVDC using an Adaptive Evolutionary Algorithm(AEA). We have proposed the AEA which uses a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner in order to take merits of two different evolutionary algorithms. The AEA is used for tuning fuzzy membership functions and scaling constants. Simulation results show that disturbances are well damped and the dynamic performances of FLC have better responses than those of PD controller when AC system load changes suddenly.

• Journal of Mechanical Science and Technology
• /
• 제17권2호
• /
• pp.187-196
• /
• 2003

In this paper, a new methodology of evolutionary computations - An Adaptive Evolutionary Algorithm (AEA) is proposed. AEA uses a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner in order to take merits of two different evolutionary computations : global search capability of GA and local search capability of ES. In the reproduction procedure, the proportions of the population by GA and ES are adaptively modulated according to the fitness. AEA is used to. designing fuzzy logic controller (FLC) for a high-angle-of-attack flight system for a super-maneuverable version of F-18 aircraft. AEA is used to determine the membership functions and scaling factors of an FLC. The computer simulation results show that the FLC has met both robustness and performance requirements.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 추계학술대회 논문집 학회본부 A
• /
• pp.160-162
• /
• 1999

This paper presents an optimal design method for fuzzy controllers of HVDC system using adaptive evolutionary algorithm(AEA). We have proposed an adaptive evolutionary algorithm which uses a genetic algorithm and an evolution strategy in an adaptive manner in order to take merits of two different evolutionary computations. AEA is used for tuning fuzzy membership functions, scaling constants and PD gains. The simulation results show that the disturbances are well damped by both controllers and the dynamic performances of fuzzy controllers have better responses than those of PD controllers when mechanical torque changes suddenly.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.652-654
• /
• 1995

This paper proposes a design of self-tuning fuzzy controller based on evolutionary computation. Optimal membership functions are round by using evolutionary computation. Genetic algorithms and evolution strategy are used for tuning of fuzzy membership function. A arbitrarily speed trajectories is selected to show the performance of the proposed methods. Simulation results show the good performance in the DC motor control system with the self-tuning fuzzy controller based on evolutionary computation.

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

This paper proposes an efficient evolutionary programming algorithm for solving a generation expansion planning(GEP) problem known as a highly-nonlinear dynamic problem. Evolutionary programming(EP) is an optimization algorithm based on the simulated evolution (mutation, competition and selection). In this paper, new algorithm is presented to enhance the efficiency of the EP algorithm for solving the GEP problem. By a domain mapping procedure, yearly cumulative capacity vectors are transformed into one dummy vector, whose change can yield a kind of trend in the cost value. To validate the proposed approach, this algorithm is tested on two cases of expansion planning problems. Simulation results show that the proposed algorithm can provide successful results within a resonable computational time compared with conventional EP and dynamic programming.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 하계학술대회 논문집 B
• /
• pp.714-716
• /
• 1996

This paper presents an optimization method for optimal reactive power dispatch which minimizes real power loss and improves voltage profile of power systems using evolutionary computation such as genetic algorithms(GAs), evolutionary programming(EP). and evolution strategy(ES). Many conventional methods to this problem have been proposed in the past, but most these approaches have the common defect of being caught to a local minimum solution. Recently, global search methods such as GAs, EP, and ES are introduced. The proposed methods were applied to the IEEE 30-bus system. Each simulation result, compared with that obtained by using a conventional gradient-based optimization method, Sequential Quadratic Programming (SQP), shows the possibility of applications of evolutionary computation to large scale power systems.

• 한국군사과학기술학회지
• /
• 제10권3호
• /
• pp.148-153
• /
• 2007

In this paper, the evolutionary adaptive wavelet transform(EAWT) is applied to the scattering analysis of radar target. EAWT algorithm uses evolutionary programming for the time-frequency parameter extraction instead of FFT and the bisection search method used in the conventional adaptive wavelet transform(AWT). Therefore, the EAWT has a better performance than the conventional AWT. In the simulation using wire target(Airbus-like), the comparisons with the conventional AWT are presented to show the superiority of the EAWT algorithm in the analysis of scattering phenomenology. The EAWT can be effectively applied to the radar target recognition.

• 국제학술발표논문집
• /
• The 6th International Conference on Construction Engineering and Project Management
• /
• pp.656-657
• /
• 2015

Recently, Multi-Objective Optimization of design elements is an important issue in building design. Design variables that considering the specificities of the different environments should use the appropriate algorithm on optimization process. The purpose of this study is to compare and analyze the optimal solution using three evolutionary algorithms and energy modeling simulation. This paper consists of three steps: i)Developing three evolutionary algorithm model for optimization of design elements ; ii) Conducting Multi-Objective Optimization based on the developed model ; iii) Conducting comparative analysis of the optimal solution from each of the algorithms. Including Non-dominated Sorted Genetic Algorithm (NSGA-II), Multi-Objective Particle Swarm Optimization (MOPSO) and Random Search were used for optimization. Each algorithm showed similar range of result data. However, the execution speed of the optimization using the algorithm was shown a difference. NSGA-II showed the fastest execution speed. Moreover, the most optimal solution distribution is derived from NSGA-II.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권7호
• /
• pp.3501-3523
• /
• 2017

It is a classical integer optimization difficulty to design an optimal selection scheme in cooperative relay networks considering co-channel interference (CCI). In this paper, we solve single-objective and multi-objective relay selection problem. For the single-objective relay selection problem, in order to attain optimal system performance of cooperative relay network, a novel quantum differential evolutionary algorithm (QDEA) is proposed to resolve the optimization difficulty of optimal relay selection, and the proposed optimal relay selection scheme is called as optimal relay selection based on quantum differential evolutionary algorithm (QDEA). The proposed QDEA combines the advantages of quantum computing theory and differential evolutionary algorithm (DEA) to improve exploring and exploiting potency of DEA. So QDEA has the capability to find the optimal relay selection scheme in cooperative relay networks. For the multi-objective relay selection problem, we propose a novel non-dominated sorting quantum differential evolutionary algorithm (NSQDEA) to solve the relay selection problem which considers two objectives. Simulation results indicate that the proposed relay selection scheme based on QDEA is superior to other intelligent relay selection schemes based on differential evolutionary algorithm, artificial bee colony optimization and quantum bee colony optimization in terms of convergence speed and accuracy for the single-objective relay selection problem. Meanwhile, the simulation results also show that the proposed relay selection scheme based on NSQDEA has a good performance on multi-objective relay selection.

• 전기학회논문지
• /
• 제63권3호
• /
• pp.389-394
• /
• 2014

Two evolutionary gait generation methods for Cartesian and Joint coordinates space are compared to develop a fast locomotion for quadruped robots. GA(Genetic Algorithm) based approaches seek to optimize a pre-selected set of parameters for the locus of paw and initial position in cartesian coordinates space. GP(Genetic Programming) based technique generate few joint trajectories using symbolic regression in joint coordinates space as a form of polynomials. Optimization for two proposed methods are executed using Webots simulation for the quadruped robot which is built by Bioloid. Furthermore, simulation results for two proposed methods are analysed in terms of different coordinate spaces.