• Title/Summary/Keyword: 전역 최적치

Search Result 22, Processing Time 0.032 seconds

Non-Metric Multidimensional Scaling using Simulated Annealing (담금질을 사용한 비계량 다차원 척도법)

  • Lee, Chang-Yong;Lee, Dong-Ju
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.6
    • /
    • pp.648-653
    • /
    • 2010
  • The non-metric multidimensional scaling (nMDS) is a method for analyzing the relation among objects by mapping them onto the Euclidean space. The nMDS is useful when it is difficult to use the concept of distance between pairs of objects due to non-metric dissimilarities between objects. The nMDS can be regarded as an optimization problem in which there are many local optima. Since the conventional nMDS algorithm utilizes the steepest descent method, it has a drawback in that the method can hardly find a better solution once it falls into a local optimum. To remedy this problem, in this paper, we applied the simulated annealing to the nMDS and proposed a new optimization algorithm which could search for a global optimum more effectively. We examined the algorithm using benchmarking problems and found that improvement rate of the proposed algorithm against the conventional algorithm ranged from 0.7% to 3.2%. In addition, the statistical hypothesis test also showed that the proposed algorithm outperformed the conventional one.

Optimal Water Allocation Using Streamflow Network Model and Global Optimization Method (하천망 모형과 전역최적화기법을 이용한 저수지 용수의 최적 배분)

  • Kang, Min Goo;Park, Seung Woo
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2004.05b
    • /
    • pp.292-297
    • /
    • 2004
  • 본 연구에서는 단일목적 저수지와 다목적 댐의 최적운영을 위하여 전역최적해를 탐색하는 SCE-UA법을 사용하는 비선형계획법을 적용한 최적화 모형을 구성하고 과거 운영자료를 사용하여 모형의 적용성을 검토하고 분석하였다. 또한, 다목적댐의 운영수위 상승으로 인하여 발생하는 추가용수를 댐하류로 추가적으로 공급함에 따른 댐운영상의 문제점과 해결책을 제시했다. 관개용 단일 목적 저수지의 유입량은 하천망 모형인 SSARR 모형을 이용하여 추정하였다. 관개용 단일 목적저수지의 용수배분을 최적화한 결과, 실측치와 최적방류량간의 상대오차가 $-2.6\~10.5\%$ 범위를 나타냈으며, 비교적 실측방류량과 유사한 형태로 용수를 공급하는 길과를 나타냈다. 다목적 저수지의 최적운영을 위해 발전량, 저수량 및 필요수량의 관계를 목적함수로하는 최적화 모형을 구성하여 섬진강댐의 최적운영에 적용하였다. 섬진강댐의 댐하류 방류량 증가에 따른 운영상의 문제점을 해결하기 위하여 댐하류 유지용수량을 0.17, 0.50, 0.70, 1.0, 1.5, $3.0m^3/sec$ 방류하는 경우로 구분하여 최적운영한 길과, 댐하류 유지용수량이 $1.0m^3/sec$ 이하인 경우에 발전량이 실적평균발전량에 근접한 결과를 나타냈으며, 용수공급량도 계획공급량인 377.4 백만 $m^3$ 보다 $28.9\~100.7$ 백만 $m^3$ 만큼 많은 양을 공급하는 결과를 나타냈다.

  • PDF

Performance Improvement of Network Based Parallel Genetic Algorithm by Exploiting Server's Computing Power (서버의 계산능력을 활용한 네트워크기반 병렬유전자알고리즘의 성능향상)

  • 송봉기;김용성;성길영;우종호
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.41 no.4
    • /
    • pp.67-72
    • /
    • 2004
  • This paper proposes a method improving the convergence speed of optimal solution for parallel genetic algorithm in the network based client-server model. Unlike the existing methods of obtaining global elite only by evaluating local elites in server, the proposed method obtains it by evaluating local elites and improving its fitness by applying genetic algorithm during idle time of the server. By using the improved chromosome in server for the client's genetic algorithm processing, the convergence speed of the optimal solution is increased. The improvement of fitness at the server during the interval of chromosome migration is (equation omitted)(F$_{max}$(g)-F$_{max}$(g-1)), whole F$_{max}$(g) is a max fitness of the g-th generation and G is the number of improved generation by the server. As the number of clients increases and G decreases, the improvement of fitness goes down. However the improvement of fitness is better than existing methods..

Successive Backward Sweep Method for Orbit Transfer Augmented with Homotopy Algorithm (호모토피 알고리즘을 이용한 Successive Backward Sweep 최적제어 알고리즘 설계 및 궤도전이 문제에의 적용)

  • Cho, Donghyurn;Kim, Seung Pil
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.44 no.7
    • /
    • pp.620-628
    • /
    • 2016
  • The homotopy algorithm provides a robust method for determining optimal control, in some cases the global minimum solution, as a continuation parameter is varied gradually to regulate the contributions of the nonlinear terms. In this paper, the Successive Backward Sweep (SBS) method, which is insensitive to initial guess, augmented with a homotopy algorithm is suggested. This approach is effective for highly nonlinear problems such as low-thrust trajectory optimization. Often, these highly nonlinear problems have multiple local minima. In this case, the SBS-homotopy method enables one to steadily seek a global minimum.

Study on Estimation of Optimal Parameters for Tank Model by Using SCE-UA (SCE-UA를 이용한 Tank 모형의 최적 매개변수 추정 방안)

  • Shin, Sang-Hoon;Jung, Il-Won;Bae, Deg-Hyo
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2010.05a
    • /
    • pp.1530-1535
    • /
    • 2010
  • 본 연구에서는 SCE-UA(Shuffled Complex Evolution-University Arizona) 매개변수 최적화 기법을 이용하여 TANK 모형의 매개변수를 추정할 경우 SCE-UA 기법의 적용성을 검토하고 실제 관측유량에 대해 적용하고자 한다. 이를 위해 임의매개변수를 4단 TANK 모형의 유출결과를 관측치로 가정하고 역으로 SCE-UA 기법을 이용하여 전역 최적해 추정 능력을 검증하였다. 또한 실제 유역에 대한 적용성 평가를 위해 소양강 댐 상류 유역을 대상유역으로 선정 하였으며 관측유량을 보정과 검정기간으로 나누어 추정된 매개변수의 정확도를 평가하였다. 향후 수문성분 분리 과정을 통해 각 유출 성분별 매개변수 최적화를 수행하고자 하며 이러한 결과는 유출 성분자료가 부족한 우리나라에서 보다 정확한 수자원 관리를 위한 기초자료로 활용될 수 있을 것으로 판단된다.

  • PDF

An Adaptive Thresholding of the Nonuniformly Contrasted Images by Using Local Contrast Enhancement and Bilinear Interpolation (국소 영역별 대비 개선과 쌍선형 보간에 의한 불균등 대비 영상의 효율적 적응 이진화)

  • Jeong, Dong-Hyun;Cho, Sang-Hyun;Choi, Heung-Moon
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.12
    • /
    • pp.51-57
    • /
    • 1999
  • In this paper, an adaptive thresholding of the nonuniformly contrasted images is proposed through using the contrast pre-enhancement of the local regions and the bilinear interpolation between the local threshold values. The nonuniformly contrasted image is decomposed into 9${\times}$9 sized local regions, and the contrast is enhanced by intensifying the gray level difference of each low contrasted or blurred region. Optimal threshold values are obtained by iterative method from the gray level distribution of each contrast-enhanced local region. Discontinuities are reduced at the region of interest or at the characters by using bilinear interpolation between the neighboring threshold surfaces. Character recognition experiments are conducted using backpropagation neural network on the characters extracted from the nonuniformly contrasted document, PCB, and wafer images binarized through using the proposed thresholding and the conventional thresholding methods, and the results prove the relative effectiveness of the proposed scheme.

  • PDF

Development of ensemble weighting technique for sequential forecasted rainfall to extend forecast precedence time (예측 선행시간 확장을 위한 순차적 예측강우 가중평균 앙상블 생성기법 개발)

  • Na, Wooyoung;Kang, Minseok;Kim, Gildo;Lee, Hyunwook;Yoo, Chulsang
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2019.05a
    • /
    • pp.59-59
    • /
    • 2019
  • 최근 기후변화로 인해 대류성 집중호우가 빈번하게 발생하고 있으며, 이러한 강우 특성은 산지지역에 위치한 소하천유역에 상당한 피해를 야기한다. 대류성 집중호우는 규모가 작고 속도가 빠르기 때문에 중규모 이상의 유역에서 부분적으로 상이한 강우특성을 보인다. 아울러 이러한 호우패턴의 변화는 일시적인 현상이 아닌 하나의 기상 특성으로 자리를 잡아가고 있기 때문에 이에 대한 대책마련이 더욱 필요한 실정이다. 돌발홍수 예경보시스템에 예측강우 자료는 예측 선행시간의 한계를 가진다. 즉, 예측강우 자료자체가 가지는 편의와 불확실성으로 인해 예측 선행시간이 3시간을 초과하면 신뢰도가 급격히 하락하게 된다. 이를 해결하기 위해 우리나라에서는 지상관측치와의 편의를 보정하거나 예측강우자료 자체의 품질을 개선하려는 노력을 지속하고 있다. 본 연구에서는 예측 선행시간을 확장하고자 순차적으로 생산되는 예측강우를 가중평균하여 앙상블 예측치를 모의하는 기법을 개발하였다. 각 선행시간별 예측강우자료를 앙상블 멤버로 인식하여 이들의 공분산 구조를 파악하고, 분산과 공분산 수치를 이용하여 가중치를 결정하였다. 1, 2, 3시간 예측 선행시간에 대한 확장 가능성을 확인하고자 하였고, 최적의 앙상블 멤버 개수를 결정하여 적용 및 평가하였다. 본 연구에서는 2016년과 2017년에 발생한 주요 호우사상을 선정하고, 우리나라 전역에 걸쳐 예측강우 앙상블 생성 방법론을 적용하였다. 그 결과, 가중평균 앙상블의 예측치가 예측강우장 1개, 단순평균 앙상블 예측치에 비해 좋은 품질의 예측 성능을 보였으며, 예측치의 분산 또한 감소하여 예측에 대한 불확실성이 줄어듦을 확인하였다.

  • PDF

Model Structure and its Solution of Analytical Research on Transit Network Design (대중교통 노선망 설계에 관한 해석적 연구의 모형 구조와 풀이)

  • Park, Jun-Sik;Gwon, Yong-Seok
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.6
    • /
    • pp.129-140
    • /
    • 2007
  • The planning procedure of a transit operation consists of design, operation, and evaluation according to the research characteristics. There are some review studies on the operation and evaluation procedure, but the research on the design procedure has not yet been organized systematically. In this study, the research on transit system design was reviewed and the model structure and its solution method were arranged. The decision variables of the design procedure are network structure, line spacing or position, stop spacing, dispatching headway, and fleet size. In the analytical research on design procedure, system total cost is generally used as the objective function. System total cost is comprised of user cost, which is the sum of user access, waiting, and travel cost, and operating cost. Total cost of the transit system, used as the objective function, has the unique minimum because it is differentiable. There is a certain decision variable that makes the derivative of the objective function equal to zero and the second derivative of the objective function is positive. Therefore the decision variable that makes the first derivative of the objective function zero is the optimum that minimizes the objective function, and each of the cost components of the objective function become the same. This study is expected to help understanding about the research on the design procedure of transit operation planning and to help be a catalyst for relevant research.

A Feature Selection for the Recognition of Handwritten Characters based on Two-Dimensional Wavelet Packet (2차원 웨이브렛 패킷에 기반한 필기체 문자인식의 특징선택방법)

  • Kim, Min-Soo;Back, Jang-Sun;Lee, Guee-Sang;Kim, Soo-Hyung
    • Journal of KIISE:Software and Applications
    • /
    • v.29 no.8
    • /
    • pp.521-528
    • /
    • 2002
  • We propose a new approach to the feature selection for the classification of handwritten characters using two-dimensional(2D) wavelet packet bases. To extract key features of an image data, for the dimension reduction Principal Component Analysis(PCA) has been most frequently used. However PCA relies on the eigenvalue system, it is not only sensitive to outliers and perturbations, but has a tendency to select only global features. Since the important features for the image data are often characterized by local information such as edges and spikes, PCA does not provide good solutions to such problems. Also solving an eigenvalue system usually requires high cost in its computation. In this paper, the original data is transformed with 2D wavelet packet bases and the best discriminant basis is searched, from which relevant features are selected. In contrast to PCA solutions, the fast selection of detailed features as well as global features is possible by virtue of the good properties of wavelets. Experiment results on the recognition rates of PCA and our approach are compared to show the performance of the proposed method.

Vertical Sectorization Techniques in MISO Downlink Active Antenna Systems (MISO 하향 능동 안테나 시스템에서의 수직 섹터분할 기법)

  • Ahn, Minki;Eom, Subin;Lee, Inkyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.40 no.6
    • /
    • pp.997-1004
    • /
    • 2015
  • In this paper, we study vertical sectorization techniques in multiple-input single-output (MISO) downlink active antenna systems (AAS). In the AAS, antenna beam patterns can be adjusted in each sector and multiple vertical beams can form the vertical sectorization. Since an exhaustive search based vertical sectorization algorithm requires high computational complexity to find the optimal tilt angles, we propose two vertical sectorization algorithms to reduce the complexity. First, we provide an asymptotic sum rate based algorithm which utilizes a large system approximation of the average sum rate based on the random matrix theory. Next, by using the result in the single sector transmission, the single sector based algorithm is proposed. In the simulation results, we confirm that the proposed algorithms are close to the performance of the exhaustive search algorithm with much reduced complexity.