• 한국지능시스템학회논문지
• /
• 제11권5호
• /
• pp.373-378
• /
• 2001

본 연구에서의 다봉성 함수의 최적화를 위한 향상된 유전알고리듬을 제안하였다. 이 방법은 2개의 주요 단계로 구성된다. 첫째 단계는 유전알고리듬과 함수인정기준을 이용한 전역탐색단계이다. 초기해 집단에 대한 개체군의 소속도를 함수인정기준에 따라 결정한다. 둘째 단계는 개체군과 탐색최적해 사이의 유사도를 결정하고, 재구성된 탐색공간에서 단일점 탐색법에 의해 최적해를 탐색한다. 4개의 시험함수를 이용한 수치 예에 대해 종래의 방법과의 비교를 통하여 제안된 알고리듬이 모든 전역최적해 뿐만 아니라 국부최적해도 탐색이 가능함을 확인하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2002년도 하계학술대회 논문집 A
• /
• pp.124-126
• /
• 2002

The general capacitor placement problem is a combinatorial optimization problem having an objective function composed of power losses and capacitor installation costs subject to bus voltage constraints. In this paper, the method employing the chaos search algorithm is proposed to solve optimal capacitor placement problem with reducing computational effort and enhancing optimality of the solution. Chaos method in optimization problem searches the global optimal solution on the regularity of chaotic motions and easily escapes from local or near optimal solution than stochastic optimization algorithms. The chaos optimization method is tested on 9 buses and 69 buses system to illustrate the effectiveness of the proposed method.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 C
• /
• pp.1195-1198
• /
• 1999

This paper presents optimal placement of minimal set of phasor measurement units(PMU's) and observability of measurement system with PMU. By using the incidence matrix symbolic method which directly assigns measurement and pseudo-measurement to incidence matrix, it is much simpler and easier to analyze observability. The optimal PMU set is found through the simulated-annealing(SA) and the direct combinational method. The cooling schedule parameter which is suitable to the property of problem to solve is specified and optimal placement is proven by presented direct combinational method. Search spaces are limited within reasonable feasible solution region to reduce a unnecessary one in the SA implementation based on global search. The proposed method presents to save CPU time and estimate state vectors based on optimal PMU set.

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

In recent years there have been increasing interests in real-time object tracking with image information. Since image information is affected by illumination, this paper presents the real-time object tracking method based on neural networks that have robust characteristics under various illuminations. This paper proposes three steps to track the object and the fast tracking method. In the first step the object color is extracted using neural networks. In the second step we detect the object feature information based on invariant moment. Finally the object is tracked through a shape recognition using neural networks. To achieve the fast tracking performance, we have a global search for entire image and then have tracking the object through local search when the object is recognized.

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

The evolution strategy is a good evolutionary algorithm to find the global optimum of a real-valued function. Since many engineering problems can be formulated as real valued function optimization, the evolution strategy is frequently employed in engineering fields. However, in many engineering optimization problems, an optimization parameter is often restricted in the bounded region between two specified values, the minimum and the maximum limit, respectively. Since an offspring individual is generated randomly around a parent individual during mutation process of the evolution strategy, an individual outside the search region can be generated even if the parent is inside the search region. This paper proposes two new boundary-handling techniques for evolution strategies. One is the ...

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 추계학술대회논문집A
• /
• pp.698-702
• /
• 2001

This paper presents a combinatorial method to compute the solutions of optimization problem. The present hybrid algorithm is the synthesis of an artificial life algorithm and the random tabu search method. The hybrid algorithm is not only faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. And the enhanced artificial life algorithm is applied to optimum design of high-speed, short journal bearings and the usefuless is verified through this example.

• Journal of Mechanical Science and Technology
• /
• 제15권2호
• /
• pp.217-224
• /
• 2001

In this paper, the relocation of a mobile robot is considered such that it enables the robot to determine its position with respect to a global reference frame without any $\alpha$ priori position information. The robot acquires sonar range data from a two-dimensional model composed of planes, corners, edges, and cylinders. Considering individual range as data features, the robot searches the best position where the data features of a position matches the environmental model using a constraint-based search method. To increase the search efficiency, a hypothesize and-verify technique is employed in which the position of the robot is calculated from all possible combinations of two range returns that satisfy the sonar sensing model. Accurate relocation is demonstrated with the results from sets of experiments using sparse sonar data in the presence of unmodeled objects.

• 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.

• 콘크리트학회논문집
• /
• 제12권4호
• /
• pp.91-101
• /
• 2000

As the computer related technology evolves a study for a practical use of real structure as well as its hteory for optimum design has been greatly advanced. But the study on optimum design of pre-stressed concrete beam(PSC-beam) bridge for the construction of national roads and highways in Korea is not sufficient. Since a standard section for the PSC-beam is proposed, it is practically used in designing the PSC-beam. It is noticed that the section using the current standard PSC-beam design to be an over-designed with its surplus safety factor. Therefore, it is necessary to consider economical PSC-beam section which automatically satisfies all requirement of design specifications. Thus, in this study, the optimum design methods of PSC-beam are carried out using the gradient-based search method and global search method. As a result of the optimum design method, it was confirmed that the design of PSC-beam has a serious properties to non-linearity and discontinuity. And the section that in economical and efficinet design methods than the current standard design method is proposed.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.653-668
• /
• 2011

This paper presents a new hybrid method for solving nonlinear complementarity problems with $P_0$-functions. It can be regarded as a combination of smoothing trust region method with ODE-based method and line search technique. A feature of the proposed method is that at each iteration, a linear system is only solved once to obtain a trial step, thus avoiding solving a trust region subproblem. Another is that when a trial step is not accepted, the method does not resolve the linear system but generates an iterative point whose step-length is defined by a line search. Under some conditions, the method is proven to be globally and superlinearly convergent. Preliminary numerical results indicate that the proposed method is promising.