Earticle

본 연구에서는 다중최적화기법을 이용하여 2가지 수문학적 과정을 통하여 유출량을 산정하는 수문모형의 모형 최적화를 시도하였으며, 수문모형으로는 융설량과 유출량을 동시에 산정할 수 있는 분포형 수문모형인 HL-RDHM을 이용하였다. 대상유역으로는 융설량 자료를 수집할 수 있는 미국 콜로라도의 Durango River 유역을 선정하였다. 다중최적화기법으로는 MOSCEM을 활용하였으며, 융설과 관련된 매개변수 5개와 유출에 관련된 매개변수 13개를 선정하여 매개변수 보정과 수문모형 최적화를 시도하였다. 모형 최적화를 위해 2004 – 2005년의 자료가 활용되었고, 2001 – 2004년 자료를 이용하여 검증하였다. 융설량과 유출량을 동시에 최적화함으로써 RMSE 기준으로, 3개의 SNOTEL 지점에서 초기해에 의한 모의치 보다 7% - 40%까지 RMSE 오차를 줄일 수 있었고, 유출구의 USGS 관측점에서 초기해에 비해 약 40% 값이 개선됨을 확인하였다.

In this study, the multi-objective optimization method is attemped to optimize the hydrological model to estimate the runoff through two hydrological processes. HL-RDHM, a distributed hydrological model that can simultaneously estimate the amount of snowfall and runoff, was used as the distributed hydrological model. The Durango River basin in Colorado, USA, was selected as the watershed. MOSCEM was used as a multi-objective optimization method and parameter calibration and hydrologic model optimization were tried by selecting 5 parameters related to snow melting and 13 parameters related to runoff. Data from 2004 to 2005 were used to optimize the model and verified using data from 2001 to 2004. By optimizing both the amount of snow and the amount of runoff, the RMSE error can be reduced from 7% to 40% of the simulation value based on the initial solution at three SNOTEL points based on the RMSE. The USGS observation point of the outflow is improved about 40%.

Freshwater is limited resource and it is shrinking rapidly due to the urbanization, contamination and climate change impacts. As a result, raising water demands and insufficient freshwater resources become the main reasons of water conflicts. Optimal water allocation model would be an effective method to achieve the optimal allocation of limited water resources, in terms of the conjunctive use planning and management. In this paper, a multi-objective optimal water resources allocation model is proposed and the social, economic and environmental benefits are regarded as the optimal objective functions. The presented model is applied to a case of planning water resources management in China. Furthermore, simulations and optimization modeling methods have been conducted to solve the allocation model. The Gray Model has been used to predict the fresh water demand and storage of different user parts in 2025 and the Genetic Algorithm technique has been employed to solve the multi-objective problem. The obtained results illustrate how to allocate the quantity of different water resource to different users while achieving maximum social, economic and environmental benefits, which is valuable and helpful to develop a water resources optimal allocation strategy.

Massive data storage is one of the great challenges for cloud computing service, and reliable storage of sensitive data directly affects quality of storage service. In this paper, based on analysis of data storage process in cloud environment, the cost of massive data storage is considered to be comprised of data storage price, data migration and communication; and the storage reliability consists of data transmission reliability and hardware dependability. A multi-objective optimization model for reliable massive storage is proposed, in which storage cost and reliability are the objectives. Then, a genetic algorithm for solving the model is designed. Finally, experimental results indicate that the proposed model is positive and effective.

With the wide application of intelligent household appliances, the optimization of electricity behavior has become an important component of home-based intelligent electricity. In this study, a multi-objective optimization model in an intelligent electricity environment is proposed based on economy and comfort. Firstly, the domestic consumer's load characteristics are analyzed, and the operating constraints of interruptible and transferable electrical appliances are defined. Then, constraints such as household electrical load, electricity habits, the correlation minimization electricity expenditure model of household appliances, and the comfort model of electricity use are integrated into multi-objective optimization. Finally, a continuous search multi-objective particle swarm algorithm is proposed to solve the optimization problem. The analysis of the corresponding example shows that the multi-objective optimization model can effectively reduce electricity costs and improve electricity use comfort.

In this study, a surrogate model is applied to multi-objective aerodynamic optimization design. For the balanced exploration and exploitation, each objective function is converted into the Expected Improvement (EI) and this value is used as fitness value in the multi-objective optimization instead of the objective function itself. Among the non-dominated solutions about EIs, additional sample points for the update of the Kriging model are selected. The present method was applied to a transonic airfoil design. Design results showed the validity of the present method. In order to obtain the information about design space, two data mining techniques are applied to design results: Analysis of Variance (ANOVA) and the Self-Organizing Map (SOM).

Many real-world problems involve simultaneous optimization of several incommensurable and often competing objectives. In the search for solutions to multi-objective optimization problems (MOPs), we find that there is no single optimum but rather a set of optimums known as the "Pareto optimal set". Co-evolutionary algorithms are well suited to optimization problems which involve several often competing objectives. Co-evolutionary algorithms are aimed at evolving individuals through individuals competing in an objective space. In order to approximate the ideal Pareto optimal set, the search capability of diverse individuals in an objective space can be used to determine the performance of evolutionary algorithms. Non-dominated memory and Euclidean distance selection mechanisms for co-evolutionary algorithms have the goal of overcoming the limited search capability of diverse individuals in the population space. In this paper, we propose a method for maintaining population diversity in game model-based co-evolutionary algorithms, and we evaluate the effectiveness of our approach by comparing it with other methods through rigorous experiments on several MOPs.

A Multi-Skilled Project Scheduling Problem (MSPSP) that is an extension of a Multi-Mode Resource-Constrained Project Scheduling Problem (MM-RCPSP) has been generally addressed to schedule a project with staff members as resources. In MSPSP, each activity requires different specialties and each staff member has a known skill level in performing an activity. This causes to encounter a huge number of modes while performing activities of a project. This research focuses on a special type of MSPSP known as Multi-Objective Multi-Skilled Project Scheduling Problem (MOMSPSP) which incorporates some new objectives in the MSPSP and develops a multi-objective mixed-integer nonlinear programming (MINLP) model. The model is exactly solved for small-sized instances using CPLEX solver. To solve such a NP-hard problem for medium and large-sized instances, two efficient meta-heuristic algorithms based on Differential Evolution (DE) and Particle Swarm Optimization (PSO) are proposed. To evaluate the efficiency of the proposed algorithms, the results are compared with each other as well as to the optimal ones obtained by the CPLEX solver for small instances. Finally, the designed DE algorithm is identified as the superior proposed algorithm for solving the propounded MOMSPSP in terms of some performance metrics.

Recently, there are an increased the number of reports on the misuse or malicious use of an UAS. Thus, many researchers are studying on defense schemes for UAS by developing or improving C-UAS sensor technology. However, the wrong placement of sensors may lead to a defense failure since the proper placement of sensors is critical for UAS defense. In this study, a multi-object optimization model for C-UAS sensor placement in an air base is proposed. To address the issue, we define two objective functions: the intersection ratio of interested area and the minimum detection range and try to find the optimized placement of sensors that maximizes the two functions. C-UAS placement model is designed using a NSGA-II algorithm, and through experiments and analyses the possibility of its optimization is verified.

본 연구에서는 개념적인 강우-유출모형인 Tank 모형에 대하여 유역의 다양한 유출특성을 잘 반영할 수 있는 매개변수를 산정하는 데에 그 목적을 두었다. 이를 위한 최적화 알고리즘은 다목적 유전자 알고리즘인 NSGA-II를 선정하여 Tank 모형과 결합하였으며, 4가지의 목적함수를 대상으로 다양한 함수값을 나타내는 비지배관계의 최적군을 생산하였다. 수 백개로 나타나는 최적군의 다양한 해들 중, 특정 목적함수에 대하여서만 정도가 높거나 낮은 편협한 해들을 배제하고 두루 정도가 높은 값을 나타내는 소수의 비지배해들을 추출하기 위하여 선호적 순서화 기법이 적용되었다. 그 결과 많은 해들 중 단 4개의 해가 최우선해의 위치를 갖는 것으로 나타났으며, 이러한 방법론으로 최적화된 해의 적합성을 살펴보고자 국부최적화 기법인 Powell 방법과 기존에 널리 쓰여온 유전자 알고리즘인 SGA(Simple Generic Algoritm)의 결과와 비교 검정을 수행하였다. 비교한 결과 NSGA-II를 적용하여 산정된 매개변수가 4가지 목적함수 및 관측유량과의 통계치에서 두루 양호한 결과를 나타내었다. 또한 관측유량과 함께 도식하여 살펴본 결과, NSGA-II의 최우선해가 타 자동보정 기법에 비하여 상대적으로 관측치에 보다 잘 부합되는 모의유량을 계산하는 것으로 나타났다.

The ammunition allocation problem is a Multi-objective optimization(MOO) problem, maximizing fill-rate of multiple user troops and minimizing transportation time. Recent studies attempted to solve this problem by the prior preference articulation approach such as goal programming. They require that all the preference information of decision makers(DM) should be extracted prior to solving the problem. However, the prior preference information is difficult to implement properly in a rapidly changing state of war. Moreover they have some limitations such as heavy cognitive effort required to DM. This paper proposes a new ammunition allocation model based on more reasonable assumptions and uses an interactive MOO method to the ammunition allocation problem to overcome the limitations mentioned above. In particular, this article uses the GDF procedure, one of the well-known interactive optimization methods in the MOO liter-ature, in solving the ammunition allocation problem.