• Proceedings of the Korea Water Resources Association Conference
• /
• 2010.05a
• /
• pp.292-296
• /
• 2010

본 연구에서는 상대적으로 소규모 홍수저감시설인 천변저류지의 설치를 통하여 대규모 유역 하도 전체에서의 홍수위 저감효과를 평가하고 그 효율을 극대화 하는 방안을 제시하였다. 본 연구에 적용한 다목적 최적화 기법(Multi-objective Optimization)으로는 NSGA-II(Non-dominated Sorting Genetic Algorithm II) 알고리즘을 적용하였으며 천변저류지 설치에 따른 수위 영향구간 분석 및 유역 전체 하도구간에서 전반적으로 발생하는 수리, 수문학적인 변화 평가 및 천변저류지 최적 조합을 선정하기 위하여 천변저류지의 용량을 최소화하면서 하도 전 구간에서의 수위 저감량을 최대화할 수 있도록 최적화 알고리즘의 목적함수를 설정하였다. 천변저류지 설치에 따른 홍수량의 변화를 해석하기 위하여 안성천 유역에 대하여 동역학적 홍수추적을 수행하였으며 저류형 구조물의 설치에 따른 홍수량 저감효과 및 그에 따른 홍수위의 변화를 동시에 해석하기 위하여 UNET 모형을 기반으로 한 HEC-RAS 부정류 해석을 실시하였다. 천변저류지 조합별로 다양한 경우의 수가 존재하므로 HEC-RAS 구동 모듈인 HECRAS Controller를 Visual Basic으로 코딩된 최적화 알고리즘 프로그램과 연동함으로써 각 경우의 수별로 동역학적 홍수추적 및 부정류 해석을 실시함으로써 천변저류지 조합별 각 측점에서의 홍수량 및 홍수위를 산정하여 저류지 용량을 최소화하면서 각 하도 측점별 수위저감량을 최대화 하는 최적해 집단(Pareto Front)을 산정하여 제시하였다.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2022.05a
• /
• pp.181-181
• /
• 2022

상수도 관망은 비정상상황에서도 안전한 물을 안정적으로 공급하는 것을 목표로 한다. 따라서 상수도 관망의 최적 설계는 수리학적 제약조건 (i.e., 절점의 압력, 관의 유속)을 만족하는 설계안을 제시한다. 하지만 점차 커지는 도시 규모에 따라 수질적으로 안전한 물을 공급하지 못하는 문제가 발생하고 있다. 또한, 상수도시스템의 형식 (i.e., 수지상식, 혼합식, 순환식)에 따라 용수의 체류 시간, 절점의 압력 등이 상이하다. 따라서, 본 연구에서는 도시 규모 및 형식과 잔류염소 농도를 고려한 상수도시스템 최적 설계를 진행하였다. 절점의 개수에 따라 도시의 규모를 분류하였으며, BI(BI; Branch Index) 지수를 통해 상수도시스템의 형식을 분류하였다. 또한, 수리학적 제약조건(i.e., 절점의 압력)과 수질적 제약조건 (i.e., 잔류염소 농도)을 설정하여 수리-수질을 동시에 만족하는 최적 설계안을 도출하였다. 비상시에도 물을 안정하게 공급하기 위하여 시스템의 탄력성과 설계비용을 목적함수로 설정하여 다목적 최적 설계를 진행하였다. 이러한 연구는 압력만을 고려한 기존 설계단계에서 수질적 측면을 동시에 고려하여 수질 측면의 안전성을 향상할 수 있다. 또한, 시스템의 탄력성을 고려하여 비정상상황에서도 물을 공급하여 사용성을 향상하는 설계안을 도출하여 수리학적 안정성을 만족하며, 경제적 측면도 향상할 수 있다.

• Journal of Korean Society of Forest Science
• /
• v.90 no.2
• /
• pp.176-183
• /
• 2001

Loblolly pine (Pinus taeda L.) is the most economically important timber producing species in the southern United States. Much attention has been given to predicting diameter distributions for the solution of multiple-product yield estimates. The three-parameter Weibull diameter distribution yield prediction systems were developed for loblolly pine plantations. A parameter recovery procedure for the Weibull distribution function based on four percentile equations was applied to develop diameter distribution yield prediction models. Four percentiles (0th, 25th, 50th, 95th) of the cumulative diameter distribution were predicted as a function of quadratic mean diameter. Individual tree height prediction equations were developed for the calculation of yields by diameter class. By using individual tree content prediction equations, expected yield by diameter class can be computed. To reduce rounding-off errors, the Weibull cumulative upper bound limit difference procedure applied in this study shows slightly better results compared with upper and lower bound procedure applied in the past studies. To evaluate this system, the predicted diameter distributions were tested against the observed diameter distributions using the Kolmogorov-Smirnov two sample test at the ${\alpha}$=0.05 level to check if any significant differences existed. Statistically, no significant differences were detected based on the data from 516 evaluation data sets. This diameter distribution yield prediction system will be useful in loblolly pine stand structure modeling, in updating forest inventories, and in evaluating investment opportunities.

• Journal of Korea Water Resources Association
• /
• v.41 no.1
• /
• pp.1-15
• /
• 2008

The purpose of this study is to propose a procedure that will be able to find the most efficient sets of weight coefficients for the Geum-River basin in Korea. The result obtained from multi-objective optimization model is inherently sensitive to the weight coefficient on each objective. In multi-objective reservoir operation problems, the coefficient setting may be more complicated because of the natural variation of inflow. Therefore, for multi-objective reservoir operation problems, it may be important for modelers to provide reservoir operators with appropriate sets of weight coefficients considering the inflow variation. This study presents a procedure to find an appropriate set of weight coefficients under the situation that has inflow variation. The proposed procedure uses GA-CoMOM to provide a set of weight coefficient sets. A DEA-window analysis and a cross efficiency analysis are then performed in order to evaluate and rank the sets of weight coefficients for various inflow scenarios. This proposed procedure might be able to find the most efficient sets of weight coefficients for the Geum-River basin in Korea.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.1
• /
• pp.46-51
• /
• 2014

The most important process of engineering system optimal design is to identify the relationship between the design variables and system response. In case of the system optimization, Response Surface Method (RSM) is widely used. The optimization process of RSM generates the design space using the typical alternative candidates and finds the optimal design point in the generated design space. By changing the optimal point depending on the configuration of the design space, it is important to generate the design space. Therefor in this study, the design space is generated by using the relationship between design variables and system response based on Neuro-Response Surface Method (NRSM). And I try to construct the framework for optimal shape design based on NRSM that the optimum shape can be predicted using the Non-dominated Sorting Genetic Algorithm-II (NSGA-II) within the generated design space. In order to verify the usefulness of the constructed framework, we applied the nonlinear mathematical function problem. In this study, we can solve the constraints of time in the optimization process for the engineering problem and effective to determine the optimal design was possible. by using the generated framework for optimal shape design based on NRSM. In the future research, we try to apply the optimization problem for Naval Architectural & Ocean Engineering based on the results of this study.

• Journal of Intelligence and Information Systems
• /
• v.12 no.2
• /
• pp.125-144
• /
• 2006

The development of mobile applications is fast in recent years. However, nearly all applications are for messaging, financial, locating services based on simple interactions with mobile users because of the limited screen size, narrow network bandwidth, and low computing power. Processing an algorithm for supporting a group decision process on mobile devices becomes impossible. In this paper, we introduce the mobile-oriented simple interactive procedure for support a group decision making process. The interactive procedure is developed for multiple objective linear programming problems to help the group select a compromising solution in the mobile Internet environment. Our procedure lessens the burden of group decision makers, which is one of necessary conditions of the mobile environment. Only the partial weak order preferences of variables and objectives from group decision makers are enough for searching the best compromising solution. The methodology is designed to avoid any assumption about the shape or existence of the decision makers' utility function. For the purpose of the experimental study of the procedure, we developed a group decision support system in the mobile Internet environment, MOBIGSS and applied to an allocation problem of investor assets.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.28 no.1D
• /
• pp.107-117
• /
• 2008

Private financing is playing an increasing role in public infrastructure construction projects worldwide. However, private investors/operators are exposed to the financial risk of low profitability due to the inaccurate estimation of facility demand, operation income, maintenance costs, etc. From the operator's perspective, a sound and thorough financial feasibility study is required to establish the appropriate capital structure of a project. Operators tend to reduce the equity amount to minimize the level of risk exposure, while creditors persist to raise it, in an attempt to secure a sufficient level of financial involvement from the operators. Therefore, it is important for creditors and operators to reach an agreement for a balanced capital structure that synthetically considers both profitability and repayment capacity. This paper presents an optimal capital structure model for successful private infrastructure investment. This model finds the optimized point where the profitability is balanced with the repayment capacity, with the use of the concept of utility function and multi-objective GA (Generic Algorithm)-based optimization. A case study is presented to show the validity of the model and its verification. The research conclusions provide a proper capital structure for privately-financed infrastructure projects through a proposed multi-objective model.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.48 no.6
• /
• pp.411-418
• /
• 2020

In this paper, approximation and optimization methods are proposed for the structural performance of the composite fan blade. Using these methods, we perform the optimal design of the stacking sequence to maximize stiffnesses without changing the mass and the geometric shape of the composite fan blade. In this study, the lamination parameters are introduced to reduce the design variables and space. From the characteristics of lamination parameters, we generate response surface model having a high fitness value. Considering the requirements of the optimal stacking sequence, the multi-objective optimization problem is formulated. We apply the two-step optimization method that combines gradient-based method and genetic algorithm for efficient search of an optimal solution. Finally, the finite element analysis results of the initial and the optimized model are compared to validate the approximation and optimization methods based on the lamination parameters.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2000-2007
• /
• 1999

Recently, DDS (Distributed Database System) has been often implemented on VAN (Value Added Network) as we know the amazing expansion of information network. DDS can yield significant cost and response time advantages over centrailzed systems for geographically distributed organizations. However, inappropriate design can result in high cost and poor response time. In a DDS design, the main problem is 1) how to select proper computer, and 2) how to allocate data fragment into proper nodes. This paper addresses DDS design problem of selecting the proper class of computers and the allocating data files on VAN. Also, the formulated model includes tow objectives, the operating and investment cost. GA (Genetic Algorithm) is developed to solve this mathematical formulation. A numerical experiment shows that the proposed method arrives at a good solution.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.375-381
• /
• 2005

Usually genetic algorithms are used to design optimal system. However the performance of the algorithm is determined by the fitness function and the system environment. It is expected that a co-evolutionary algorithm, two populations are constantly interact and co-evolve, is one of the solution to overcome these problems. In this paper we propose three types of co-evolutionary algorithm to solve GA-Hard problem. The first model is a competitive co-evolutionary algorithm that solution and environment are competitively co-evolve. This model can prevent the solution from falling in local optima because the environment are also evolve according to the evolution of the solution. The second algorithm is schema co-evolutionary algorithm that has host population and parasite (schema) population. Schema population supply good schema to host population in this algorithm. The third is game model-based co-evolutionary algorithm that two populations are co-evolve through game. Each algorithm is applied to visual servoing, robot navigation, and multi-objective optimization problem to verify the effectiveness of the proposed algorithms.