• Title/Summary/Keyword: Pareto

Search Result 593, Processing Time 0.027 seconds

A Bayesian Analysis of Return Level for Extreme Precipitation in Korea (한국지역 집중호우에 대한 반환주기의 베이지안 모형 분석)

  • Lee, Jeong Jin;Kim, Nam Hee;Kwon, Hye Ji;Kim, Yongku
    • The Korean Journal of Applied Statistics
    • /
    • v.27 no.6
    • /
    • pp.947-958
    • /
    • 2014
  • Understanding extreme precipitation events is very important for flood planning purposes. Especially, the r-year return level is a common measure of extreme events. In this paper, we present a spatial analysis of precipitation return level using hierarchical Bayesian modeling. For intensity, we model annual maximum daily precipitations and daily precipitation above a high threshold at 62 stations in Korea with generalized extreme value(GEV) and generalized Pareto distribution(GPD), respectively. The spatial dependence among return levels is incorporated to the model through a latent Gaussian process of the GEV and GPD model parameters. We apply the proposed model to precipitation data collected at 62 stations in Korea from 1973 to 2011.

Game Model Based Co-evolutionary Solution for Multiobjective Optimization Problems

  • Sim, Kwee-Bo;Kim, Ji-Yoon;Lee, Dong-Wook
    • International Journal of Control, Automation, and Systems
    • /
    • v.2 no.2
    • /
    • pp.247-255
    • /
    • 2004
  • The majority of real-world problems encountered by engineers involve simultaneous optimization of competing objectives. In this case instead of single optima, there is a set of alternative trade-offs, generally known as Pareto-optimal solutions. The use of evolutionary algorithms Pareto GA, which was first introduced by Goldberg in 1989, has now become a sort of standard in solving Multiobjective Optimization Problems (MOPs). Though this approach was further developed leading to numerous applications, these applications are based on Pareto ranking and employ the use of the fitness sharing function to maintain diversity. Another scheme for solving MOPs has been presented by J. Nash to solve MOPs originated from Game Theory and Economics. Sefrioui introduced the Nash Genetic Algorithm in 1998. This approach combines genetic algorithms with Nash's idea. Another central achievement of Game Theory is the introduction of an Evolutionary Stable Strategy, introduced by Maynard Smith in 1982. In this paper, we will try to find ESS as a solution of MOPs using our game model based co-evolutionary algorithm. First, we will investigate the validity of our co-evolutionary approach to solve MOPs. That is, we will demonstrate how the evolutionary game can be embodied using co-evolutionary algorithms and also confirm whether it can reach the optimal equilibrium point of a MOP. Second, we will evaluate the effectiveness of our approach, comparing it with other methods through rigorous experiments on several MOPs.

Genetic Algorithm based Methodology for Network Performance Optimization (유전자 알고리즘을 이용한 WDM 네트워크 최적화 방법)

  • Yang, Hyo-Sik
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.1
    • /
    • pp.39-45
    • /
    • 2008
  • This paper considers the multi-objective optimization of a multi-service arrayed waveguide grating-based single-hop WDM network with the two conflicting objectives of maximizing throughput while minimizing delay. This paper presents a genetic algorithm based methodology for finding the optimal throughput-delay tradeoff curve, the so-called Pareto-optimal frontier. Genetic algorithm based methodology provides the network architecture parameters and the Medium Access Control protocol parameters that achieve the Pareto-optima in a computationally efficient manner. The numerical results obtained with this methodology provide the Pareto-optimal network planning and operation solution for a wide range of traffic scenarios. The presented methodology is applicable to other networks with a similar throughput-delay tradeoff.

  • PDF

A Development of Multi-site Rainfall Simulation Model Using Piecewise Generalize Pareto Distribution (불연속 분포를 이용한 다지점 강수모의발생 기법 개발)

  • So, Byung-Jin;Kwon, Hyun-Han
    • Proceedings of the Korea Water Resources Association Conference
    • /
    • 2012.05a
    • /
    • pp.123-123
    • /
    • 2012
  • 일강수량은 수공구조물 설계 및 수자원계획을 수립하기 위한 입력 자료로 이용된다. 일반적으로 수자원계획은 장기적인 목적을 가지고 수행되어지며, 장기간의 일강수량 자료를 필요로 한다. 하지만 장기간의 일강수량 자료의 획득의 어려움으로 단기간의 일강수량자료를 이용하여 모의한 장기간 강수자료를 이용하게 된다. 이처럼 수자원계획의 수립에 있어서 일강수량 모의기법의 성능은 수자원계획의 신뢰성 및 결과에 큰 영향을 준다. 일강수량 모의기법은 국내외적으로 매우 활발하게 이루어지고 있으며, 수자원계획 및 수공구조물 설계 외에도 매우 다양한 목적으로 활용되어 지고 있다. 일강수량을 모의기법 중 강수계열의 단기간의 기억(memory)을 활용한 Markov Chain 모형이 가장 일반적이지만, 기존 Markov Chain 모형을 통한 일강수량 모의는 극치강수량을 재현하기 어렵다는 문제점이 있다. 또한, 일강수량 모의 기법의 목적인 수자원계획 및 수공구조물 설계 등의 입력자료로 활용되어지기 위해서는 모의 결과가 유역내 지점별 공간 상관성을 재현함으로써 모형의 우수성과 자료결과의 신뢰성을 확보할 수 있어야 하겠다. 이러한 점에서 본 연구에서는 내삽에서 우수한 재현능력을 갖는 핵 밀도함수와 극치강수량 재현에 유리한 GPD분포의 특징을 함께 고려할 수 있는 불연속 Kernel-Pareto Distribution 기반에 공간상관성 재현 알고리즘을 결합한 일강수량모의기법을 개발하였다. 한강유역의 18개 강수지점에 대해서 기존 Gamma분포를 사용한 Markov Chain 모형과 본 연구에서 제안한 방법을 적용하여 모형을 평가해 보고자 한다. Gamma 분포기반 Markov Chain 모형의 경우 일강수량 모의 시 1차모멘트인 평균과 2-3차 모멘트 모두 효과적으로 재현하지 못하는 문제점이 나타났다. 그러나 본 연구에서 적용한 다지점 불연속 Kernel-Pareto 분포 모형은 강수계열의 평균적인 특성뿐만 아니라 표준편차 및 왜곡도의 경우에도 관측치의 통계특성을 매우 효과적으로 재현하며, 100년빈도 강수량 모의결과 기존 모의모형의 문제점을 보완할 수 있는 개선된 결과를 보여주었다. 본 연구에서 제시한 방법론은 유역내의 공간상관성을 재현하며, 평균 및 중간값 등 낮은 차수의 모멘트 등 일강수량 분포특성을 더욱 효과적으로 모의할 수 장점을 확인하였다.

  • PDF

An Algorithm for Searching Pareto Optimal Paths of HAZMAT Transportation: Efficient Vector Labeling Approach (위험물 수송 최적경로 탐색 알고리즘 개발: Efficient Vector Labeling 방법으로)

  • Park, Dong-Joo;Chung, Sung-Bong;Oh, Jeong-Taek
    • Journal of the Korean Society of Hazard Mitigation
    • /
    • v.11 no.3
    • /
    • pp.49-56
    • /
    • 2011
  • This paper deals with a methodology for searching optimal route of hazard material (hazmat) vehicles. When we make a decision of hazmat optimal paths, there is a conflict between the public aspect which wants to minimize risk and the private aspect which has a goal of minimizing travel time. This paper presents Efficient Vector Labeling algorithm as a methodology for searching optimal path of hazmat transportation, which is intrinsically one of the multi-criteria decision making problems. The output of the presented algorithm is a set of Pareto optimal paths considering both risk and travel time at a time. Also, the proposed algorithm is able to identify non-dominated paths which are significantly different from each other in terms of links used. The proposed Efficient Vector Labeling algorithm are applied to test bed network and compared with the existing k-shortest path algorithm. Analysis of result shows that the proposed algorithm is more efficient and advantageous in searching reasonable alternative routes than the existing one.

Frequency analysis of storm surge using Poisson-Generalized Pareto distribution (Poisson-Generalized Pareto 분포를 이용한 폭풍해일 빈도해석)

  • Kim, Tae-Jeong;Kwon, Hyun-Han;Shin, Young-Seok
    • Journal of Korea Water Resources Association
    • /
    • v.52 no.3
    • /
    • pp.173-185
    • /
    • 2019
  • The Korean Peninsula is considered as one of the most typhoon related disaster prone areas. In particular, the potential risk of flooding in coastal areas would be greater when storm surge and heavy rainfall occurred at the same time. In this context, understanding the mechanism of the interactions between them and estimating the risk associated with the concurrent occurrence are of particular interests especially in low-lying coastal areas. In this study, we developed a Poisson-Generalized Pareto (Poisson-GP) distribution based storm surge frequency analysis model to combine the occurrence of the exceedance of a threshold, that is the peaks over threshold (POT), within a Bayesian framework. The storm surge frequency analysis technique developed through this study might contribute to the improvement of disaster prevention technology related to storm surge in the coastal area.

Objective Bayesian Estimation of Two-Parameter Pareto Distribution (2-모수 파레토분포의 객관적 베이지안 추정)

  • Son, Young Sook
    • The Korean Journal of Applied Statistics
    • /
    • v.26 no.5
    • /
    • pp.713-723
    • /
    • 2013
  • An objective Bayesian estimation procedure of the two-parameter Pareto distribution is presented under the reference prior and the noninformative prior. Bayesian estimators are obtained by Gibbs sampling. The steps to generate parameters in the Gibbs sampler are from the shape parameter of the gamma distribution and then the scale parameter by the adaptive rejection sampling algorism. A numerical study shows that the proposed objective Bayesian estimation outperforms other estimations in simulated bias and mean squared error.

Multi-objective Optimization of a Laidback Fan Shaped Film-Cooling Hole Using Evolutionary Algorithm

  • Lee, Ki-Don;Husain, Afzal;Kim, Kwang-Yong
    • International Journal of Fluid Machinery and Systems
    • /
    • v.3 no.2
    • /
    • pp.150-159
    • /
    • 2010
  • Laidback fan shaped film-cooling hole is formulated numerically and optimized with the help of three-dimensional numerical analysis, surrogate methods, and the multi-objective evolutionary algorithm. As Pareto optimal front produces a set of optimal solutions, the trends of objective functions with design variables are predicted by hybrid multi-objective evolutionary algorithm. The problem is defined by four geometric design variables, the injection angle of the hole, the lateral expansion angle of the diffuser, the forward expansion angle of the hole, and the ratio of the length to the diameter of the hole, to maximize the film-cooling effectiveness compromising with the aerodynamic loss. The objective function values are numerically evaluated through Reynolds- averaged Navier-Stokes analysis at the designs that are selected through the Latin hypercube sampling method. Using these numerical simulation results, the Response Surface Approximation model are constructed for each objective function and a hybrid multi-objective evolutionary algorithm is applied to obtain the Pareto optimal front. The clustered points from Pareto optimal front were evaluated by flow analysis. These designs give enhanced objective function values in comparison with the experimental designs.

Fuzzy Group Decision Making for Multiple Decision Maker-Multiple Objective Programming Problems

  • Yano, Hitoshi
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2003.09a
    • /
    • pp.380-383
    • /
    • 2003
  • In this paper, we propose a fuzzy group decision making method for multiple decision maker-multiple objective programming problems to obtain the agreeable solution. In the proposed method, considering the vague nature of human subjective judgement it is assumed that each of multiple decision makers has a fuzzy goal for each of his/her own objective functions. After eliciting the membership functions from the decision makers for their fuzzy goals, total M-Pareto optimal solution concept is defined in membership spaces in order to deal with multiple decision maker-multiple objective programming problems. For generating a candidate of the agreeable solution which is total M-Pareto optimal, the extended weighted minimax problem is formulated and solved for some weighting vector which is specified by the decision makers in their subjective manner, Given the total M-Pareto optimal solution, each of the derision makers must either be satisfied with the current values of the membership functions, or update his/her weighting vector, However, in general, it seems to be very difficult to find the agreeable solution with which all of the decision makers are satisfied perfectly because of the conflicts between their membership functions. In the proposed method, each of the decision makers is requested to estimate the degree of satisfaction for the candidate of the agreeable solution. Using the estimated values or satisfaction of each of the decision makers, the core concept is desnfied, which is a set of undominated candidates. The interactive algorithm is developed to obtain the agreeable solution which satisfies core conditions.

  • PDF

A Study on the optimization design of ATM network Using Internet Traffic Characteristics (인터넷 트래픽 특성을 이용한 ATM 망의 최적설계에 관한 연구)

  • 최삼길;김동일
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.4
    • /
    • pp.574-581
    • /
    • 2002
  • Traditional queueing analyses are very useful for designing a network's capacity and predicting their performances, however most of the predicted results from the queueing analyses are quite different from the realistic measured performance. And recent empirical studies on LAN, WAN, and VBR traffic characteristic have indicated that the models used in the traditional Poisson assumption cannot properly predict the real traffic properties due to underestimation of the long-range dependence of network traffics and self-similar properties. In this paper, It is also shown that the self-similar traffic reflects real Ethernet traffic characteristics by comparing Pareto-like ON/OFF source model which is exactly self-similar model to the traditional Poisson model. It is also performed optimization design and performance analysis of ATM network using Internet traffic characteristics.