• 한국수자원학회논문집
• /
• 제55권spc1호
• /
• pp.1271-1282
• /
• 2022

상수관망 최적설계는 사용자가 설정한 목적에 따라 다양하게 사용된다. 상수관망 최적설계는 비용의 최소화 및 관의 제작 시 발생하는 에너지 최소화 등 목적이 다양하게 존재한다. 본 연구에서는 Modified Hybrid Vision Correction Algorithm (MHVCA)을 기반으로 다양한 상수관망에 대한 비용 최적설계를 진행하였다. 또한 새로운 평가지표인 Best Rate (BR)를 제안하였다. BR은 K-mean Clustering Algorithm을 기반으로 개발된 평가지표이다. BR을 통해 상수관망 최적설계에 사용된 각 알고리즘의 최적 설계안 탐색 가능성에 대한 비교를 하였다. 다양한 관망에 대한 MHVCA의 최적설계 결과를 Vision Correction Algorithm (VCA) 및 Hybrid Vision Correction Algorithm (HVCA)과 비교하였다. MHVCA는 VCA 및 HVCA보다 낮은 비용의 설계안을 탐색하였다. 또한 MHVCA는 낮은 비용의 설계안을 탐색할 확률이 VCA 및 HVCA보다 높았다. MHVCA는 본 연구에서 적용한 비용 최소화를 위한 상수관망 최적설계 뿐만이 아닌 다양한 목적을 위한 상수관망 최적설계에 적용할 경우 좋은 결과를 나타낼 수 있을 것이다.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제14권4호
• /
• pp.256-267
• /
• 2014

An automatic switch among ensembles of clustering algorithms is proposed as a part of the bibliographic big data retrieval system by utilizing a fuzzy inference engine as a decision support tool to select the fastest performing clustering algorithm between fuzzy C-means (FCM) clustering, Newman-Girvan clustering, and the combination of both. It aims to realize the best clustering performance with the reduction of computational complexity from O($n^3$) to O(n). The automatic switch is developed by using fuzzy logic controller written in Java and accepts 3 inputs from each clustering result, i.e., number of clusters, number of vertices, and time taken to complete the clustering process. The experimental results on PC (Intel Core i5-3210M at 2.50 GHz) demonstrates that the combination of both clustering algorithms is selected as the best performing algorithm in 20 out of 27 cases with the highest percentage of 83.99%, completed in 161 seconds. The self-adapted FCM is selected as the best performing algorithm in 4 cases and the Newman-Girvan is selected in 3 cases.The automatic switch is to be incorporated into the bibliographic big data retrieval system that focuses on visualization of fuzzy relationship using hybrid approach combining FCM and Newman-Girvan algorithm, and is planning to be released to the public through the Internet.

• 산업경영시스템학회지
• /
• 제32권1호
• /
• pp.79-84
• /
• 2009

In this paper, a best-first branch and bound algorithm based upon the bottom-up approach for the unweighted unconstrained two-dimensional cutting problem is proposed to find the optimal solution to the problem. The algorithm uses simple and effective methods to prevent constructing duplicated patterns and reduces the searching space by dividing the branched node set. It also uses a efficient bounding strategy to fathom the set of patterns. Computational results are compared with veil-known exact algorithms and demonstrate the efficiency of the proposed algorithm.

• 전기학회논문지
• /
• 제63권1호
• /
• pp.115-122
• /
• 2014

Mobile robot has been studied for long time due to its simple structure and easy modeling. Regarding path planning of the mobile robot, we suggest real-time hybrid path planning algorithm which is the combination of optimal path planning and real-time path planning in this paper. Real-time hybrid path planning algorithm modifies, finds best route, and saves calculating time. It firstly plan the route with real-time path planning then robot starts to move according to the planned route. While robot is moving, update the route as the best outcome which found by optimal path planning algorithm. Verifying the performance of the proposed method through the comparing real-time hybrid path planning with optimal path planning will be done.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• 제5권1호
• /
• pp.52-58
• /
• 2005

We have developed a Group Method of Data Handling (GMDH) type algorithm for designing multi-layered neural networks. The algorithm is general enough that it will accept any number of inputs and any sized training set. Each neuron of the resulting network is a function of two of the inputs to the layer. The equation for each of the neurons is a quadratic polynomial. Several forms of the equation are tested for each neuron to make sure that only the best equation of two inputs is kept. All possible combinations of two inputs to each layer are also tested. By carefully testing each resulting neuron, we have developed an algorithm to keep only the best neurons at each level. The algorithm's goal is to create as accurate a network as possible while minimizing the size of the network. Software was developed to train and simulate networks using our algorithm. Several applications were modeled using our software, and the result was that our algorithm succeeded in developing small, accurate, multi-layer networks.

• Journal of Electrical Engineering and Technology
• /
• 제12권2호
• /
• pp.643-653
• /
• 2017

The paper presents controller optimization algorithm for a 12-pulse voltage source converter (VSC) based high voltage direct current (HVDC) system. To get an optimum algorithm, three methods namely conventional-Zeigler-Nichols, linear-golden section search (GSS) and stochastic-particle swarm optimization (PSO) are applied to control of 12 pulse VSC based HVDC system and simulation results are presented to show the best among the three. The performance results are obtained under various dynamic conditions such as load perturbation, non-linear load condition, and voltage sag, tapped load fault at points-of-common coupling (PCC) and single-line-to ground (SLG) fault at input AC mains. The conventional GSS and PSO algorithm are modified to enhance their performances under dynamic conditions. The results of this study show that modified particle swarm optimization provides the best results in terms of quick response to the dynamic conditions as compared to other optimization methods.

• 한국생산제조학회지
• /
• 제23권3호
• /
• pp.213-217
• /
• 2014

A hybrid search method based on the artificial bee colony algorithm (ABCA) with harmony search (HS) is suggested for finding a global solution in the field of optimization. Three cases of the suggested algorithm were examined for improving the accuracy and convergence rate. The results showed that the case in which the harmony search was implemented with the onlooker phase in ABCA was the best among the three cases. Although the total computation time of the best case is a little bit longer than the original ABCA under the prescribed conditions, the global solution improved and the convergence rate was slightly faster than those of the ABCA. It is concluded that the suggested algorithm improves the accuracy and convergence rate, and it is expected that it can effectively be applied to optimization problems with many design variables and local solutions.

• 전기전자학회논문지
• /
• 제1권1호
• /
• pp.31-46
• /
• 1997

본 논문에서는 다층 연결 구조(Multistage Interconnection Network, MIN)를 기반으로 하는 병렬 컴퓨터 환경에서 효과적으로 운용할 수 있는 병렬 Optimal Best-First search Branch-and-Bound 알고리즘(pobs)을 제안하고, 성능을 분석하였다. 제안된 알고리즘은 먼저 해를 얻고자 하는 문제를 임의의 G개 부 문제로 분할하고 소수 프로세서로 구성된 프로세서 그룹들에 할당하여 각각의 지역 해를 산출하도록 하였다. 따라서 N개의 프로세서를 갖는 시스템은 G개 프로세서 그룹으로 구분되고 각 프로세서 그룹은 P(=N/G)개 프로세서를 보유하게 된다. 각 프로세서 그룹은 할당된 부 문제의 지역 해를 얻는 과정에 병렬 sub-Global Best-First B&B 알고리즘을 수행한다. 프로세서 그룹들이 산출한 지역 해들 가운데 최선의 값을 갖는 지역 해가 문제의 전역 해로 결정되는데, 이를 위하여 각 프로세서 그룹의 대표 프로세서는 할당된 부 문제의 지역 해를 다른 그룹들에게 전파하도록 하였다. 지역 해 전파는 프로세서 그룹들의 지역 해 비교를 통한 전역해 선정 기능과 함께 프로세서 그룹간 작업 불균형 문제를 상당 부분 해소하는 효과를 제공한다. 알고리즘 설계에 이어 성능 평가를 위한 분석 모형을 제시하였다. 제안한 모형은 B&B 알고리즘 수행에 따른 연산 소요시간과 통신 소요시간을 분리하여 처리함으로 병렬 처리 환경에서 보다 실질적인 알고리즘 성능 평가가 가능하게 함과 동시에, 다양한 컴퓨터 연결 구조에서의 알고리즘 성능 예측을 용이하게 하였다. B&B 알고리즘의 확률 특성을 토대로 작성된 성능 분석 연구의 실효성 검토를 위하여 MIN 기반 시스템을 대상으로 병행된 시뮬레이션 결과는 상호 미세한 오차 범위 내에서 일치하는 결과를 보여 제시한 성능 분석 기법의 타당성을 입증하였다. 또한, 본 논문에서 제안한 병렬 알고리즘을 MIN 기반 시스템에 적용하여 기존 알고리즘의 성능과 비교 평가 결과 제안한 pobs가 문제 해결 과정에서 전개되는 부 문제 수를 줄이고 프로세서간의 효율적인 작업 분배 효과를 제공하는 한편 프로세서간의 주된 통신 활동 범위를 국부적으로 제한하여 성능면에서 우수함을 입증하였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 G
• /
• pp.3095-3097
• /
• 1999

A New path planning using modified DT(distance transform) algorithm for a remote mobile robot is proposed. The weakness of DT algorithm is that the generated path is not the best path of all possible paths. Modified DT algorithm proposed can compensate for the weakness of DT algorithm, but the operating time of the proposed is longer than that of DT algorithm.

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

Millimeter-wave networking is composed of narrow beam link. it is very substantial that beam connecting point to point is fixed in right direction. It is major requirement in the beam network to keep the beam in best direction. In this paper, We propose the method to find a best suited direction of the antenna's beam using the Genetic Algorithm (GA) in point-to-point link. Proposed method presume that each station knows his direction ${\theta}_1$ , ${\theta}_2$ at every step of GA, then it can be expected that GA is possible to search the ideal solution. Intensity of the received signal is evaluated by the multiplication of lengths to the point which the lobe meets with the horizontal line.