• 한국정보과학회논문지:소프트웨어및응용
• /
• 제32권4호
• /
• pp.247-257
• /
• 2005

일반적으로 네트워크 설계 문제는 네트워크의 크기가 늘어남에 따라 지수적으로 복잡도가 증가하여 전통적인 방법으로는 풀이하기 힘든 NP-hard 조합 최적화 문제 중의 하나로 분류될 수 있다. 본 논문에서는 네트워크 신뢰도 제약을 고려하면서 네트워크 구축비용을 효과적으로 최소화하는, 높은 신뢰도의 네트워크 토폴로지 설계 문제를 풀기 위해 스패닝 트리를 효율적으로 표현할 수 있는 Prufer수(PN) 기반의 진화 연산법과 2-연결성을 고려하는 휴리스틱 방법으로 구성된 두 단계의 효율적인 해법을 제안한다. 즉, 먼저 스패닝 트리를 찾아내기 위해 진화 연산법 중에 보편적으로 널리 알려져 있는 유전자 알고리즘(GA)을 이용하고 그 다음으로 첫 번째 단계에서 발견한 스패닝 트리에 대해 최적의 네트워크 토폴로지를 찾기 위해서 2-연결성을 고려한 휴리스틱 방법을 적용한다. 마지막으로 수치예의 결과를 통해 제안한 해법의 성능에 대해서 살펴보도록 한다.

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

This paper suggests a new methodology of evolutionary computations - an Adaptive Evolutionary Algorithm (AEA) for solving the Economic Load Dispatch (ELD) problem which has piecewise quadratic cost functions and prohibited operating zones with many local minima. 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, proportions of the population by GA and the population by ES are adaptively modulated according to the fitness. Case studies illustrate the superiority of the proposed methods to existing conventional methods in power generation cost and computation time. The results demonstrate that the AEA can be applied successfully in the solution of ELD with piecewise quadratic cost functions and prohibited operating zones

• Journal of Electrical Engineering and Technology
• /
• 제9권2호
• /
• pp.415-422
• /
• 2014

This paper presents a new approach to solve the multi area unit commitment problem (MAUCP) using an evolutionary programming based particle swarm optimization (EPPSO) method. The objective of this paper is to determine the optimal or near optimal commitment schedule for generating units located in multiple areas that are interconnected via tie lines. The evolutionary programming based particle swarm optimization method is used to solve multi area unit commitment problem, allocated generation for each area and find the operating cost of generation for each hour. Joint operation of generation resources can result in significant operational cost savings. Power transfer between the areas through the tie lines depends upon the operating cost of generation at each hour and tie line transfer limits. Case study of four areas with different load pattern each containing 7 units (NTPS) and 26 units connected via tie lines have been taken for analysis. Numerical results showed comparing the operating cost using evolutionary programming-based particle swarm optimization method with conventional dynamic programming (DP), evolutionary programming (EP), and particle swarm optimization (PSO) method. Experimental results show that the application of this evolutionary programming based particle swarm optimization method has the potential to solve multi area unit commitment problem with lesser computation time.

• 한국지능시스템학회논문지
• /
• 제12권3호
• /
• pp.231-238
• /
• 2002

진화퍼지모델링은 퍼지추론시스템과 진화연산의 장점을 결합한 모델링 방법으로써 전역근사최적화를 수행한다. 본 논문에서는 진화퍼지모델링의 가장 중요한 과정 중 하나인 퍼지규칙의 생성방법으로써 퍼지클러스터링을 제안한다. 퍼지클러스터링을 실험 혹은 시뮬레이션의 결과에 적용함으로써, 비선형성이 강하고 복잡한 설계문제를 적절하게 묘사할 수 있는 퍼지 규칙을 생성할 수 있다. 퍼지클러스터링의 결과로 얻어지는 클러스터에 대한 실험치의 소속정도를 활용하여 진화퍼지모델링의 효율을 향상시킬 수 있다. 제안된 방법의 유효성을 검증하기 위해 실제 자동차 내장재에 설계문제를 선정하여 전역근사화를 수행하였다. 클러스터 수와 퍼지규칙의 선택과 관련하여 여러 다양한 경우에 대해서 진화퍼지모델링을 수행하여 그 결과를 비교하였고 이를 통하여 제안된 방법이 시스템을 묘사하는 적절한 퍼지규칙을 생성하고 모델링의 오차를 만족할 만한 수준으로 유지하면서 계산시간을 줄일 수 있음을 확인하였다.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집B
• /
• pp.730-734
• /
• 2001

In this study in order to confirm the algorithms that are suggested from paper (I) as the experimental result, as the applied results of the hydraulic servo system are very strong a non-linearity of the fluid in the computer simulation, the real-time adaptive learning control algorithms is validated. The evolutionary strategy has characteristics that are automatically. adjusted in search regions with natural competition among many individuals. The error that is generated from the dynamic system is applied to the mutation equation. Competitive individuals are reduced with automatic adjustments of the search region in accord with the error. In this paper, the individual parents and offspring can be reduced in order to apply evolutionary algorithms in real-time as the description of the paper (I). The possibility of a new approaching algorithm that is suggested from the computer simulation of the paper (I) would be proved as the verification of a real-time test and the consideration its influence from the actual experiment.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1513-1516
• /
• 2003

Genetic algorithm is well known as a stochastic searching method. In this paper, a modified genetic algorithm using 'Suppor Vector Machines (SVM)' is proposed. SVM is used to reduce the number of calling the objective function which in turn accelerate the searching speed compared to the conventional GA.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.33.1-33
• /
• 2001

We address a novel approach to identify a nonlinear dynamic system for Wiener models, which are composed of a linear dynamic system part followed by a nonlinear static part. The aim of system identification here is to provide the optimal mathematical model of both the linear dynamic and the nonlinear static parts in some appropriate sense. Assuming the nonlinear static part is invertible, we approximate the inverse function by a piecewise linear function. We estimate the piecewise linear inverse function by using the evolutionary computation approach such as genetic algorithm (GA) and evolution strategies (ES), while we estimate the linear dynamic system part by the least squares method. The results of numerical simulation studies indicate the usefulness of proposed approach to the Wiener model identification.

• 경영과학
• /
• 제18권2호
• /
• pp.117-124
• /
• 2001

This paper presents a machining parameter selection approach using an evolutionary computation (EC). In order to perform a successful material cutting process, the engineer is to select suitable machining parameters. Until now, it has been mostly done by the handbook look-up or solving optimization equations which is inconvenient when not in handy. The main thrust of the paper is to provide a handy machining parameter selection approach. The EC is applied to rapidly find optimal machining parameters for the user\\`s specific machining conditions. The EC is basically a combination of genetic a1gorithm and microcanonical stochastic simulated annealing method. The approach is described in detail with an application example. The paper concludes with a discussion on the potential of the proposed approach.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 B
• /
• pp.404-406
• /
• 1998

In this paper, we propose a scaling factor tuning method to improve the performance of fuzzy controller. Tuning rules and reasoning are utilized on-line to determine the scaling factors based on absolute value of the error and its difference. A adaptive evolutionary computation (AEC) is used to search for the optimal tuning rules that will maximize the fitness function. Finally, the proposed fuzzy controller is applied to the angular stabilization of an inverted pendulum.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 C
• /
• pp.844-846
• /
• 1998

In this study, an adaptive evolutionary computation(AEC), which uses adaptively a genetic algorithm having global searching capability and an evolution strategy having local searching capability with different methodologies, is suggested. This paper develops AEC for solving ELD problem with piecewise quadratic cost function. Numerical results show that the proposed AEC can provide accurate dispatch solutions within reasonable time for the ELD problem with piecewise quadratic cost function.