• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.117-131
• /
• 2015

Conventional data envelopment analysis (DEA) models require that inputs and outputs are given as crisp values. Very often, however, some of inputs and outputs are given as imprecise data where they are only known to lie within bounded intervals. While a typical approach to addressing this situation for optimization models such as DEA is to conduct sensitivity analysis, it provides only a limited ex-post measure against the data imprecision. Robust optimization provides a more effective ex-ante measure where the data imprecision is directly incorporated into the model. This study aims to apply robust optimization approach to DEA models with imprecise data. Based upon a recently developed robust optimization framework which allows a flexible adjustment of the level of conservatism, we propose two robust optimization DEA model formulations with imprecise data; multiplier and envelopment models. We demonstrate that the two models consider different risks regarding imprecise efficiency scores, and that the existing DEA models with imprecise data are special cases of the proposed models. We show that the robust optimization for the multiplier DEA model considers the risk that estimated efficiency scores exceed true values, while the one for the envelopment DEA model deals with the risk that estimated efficiency scores fall short of true values. We also show that efficiency scores stratified in terms of probabilistic bounds of constraint violations can be obtained from the proposed models. We finally illustrate the proposed approach using a sample data set and show how the results can be used for ranking DMUs.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.10
• /
• pp.5013-5034
• /
• 2019

In the Peer-to-Peer (P2P) streaming systems, peers randomly form a network overlay to share video resources with a data scheduling scheme. A data scheduling scheme can have a great impact on system performance, which should achieve two optimal objectives at the same time ideally. The two optimization objectives are to improve the perceived video quality and maximize the network throughput, respectively. Maximizing network throughput means improving the utilization of peer's upload bandwidth. However, maximizing network throughput will result in a reduction in the perceived video quality, and vice versa. Therefore, to achieve the above two objects simultaneously, we proposed a new data scheduling scheme based on multi-objective particle swarm optimization data scheduling scheme, called MOPSO-DS scheme. To design the MOPSO-DS scheme, we first formulated the data scheduling optimization problem as a multi-objective optimization problem. Then, a multi-objective particle swarm optimization algorithm is proposed by encoding the neighbors of peers as the position vector of the particles. Through extensive simulations, we demonstrated the MOPSO-DS scheme could improve the system performance effectively.

• International Journal of Safety
• /
• v.10 no.1
• /
• pp.5-9
• /
• 2011

Two popular activity coefficient models, Wilson and NRTL equations have been used to correlate the published flash point data on the n-propanol + propionic acid and n-butanol + propionic acid systems through the optimization method. The results of these correlation were compared with the results calculated by Raoult's law. The optimization method were found to be better than those based on the Raoult's law. The optimization method based on the Wilson equation described the published data more effectively than was the case when the optimization method was based upon the NRTL equation.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.2
• /
• pp.911-917
• /
• 2017

There are generally three folds when developing neural network classifiers. They are as follows: 1) discriminant function; 2) lots of parameters in the design of classifier; and 3) high dimensional training data. Along with this viewpoint, we propose space search optimized polynomial neural network classifier (PNNC) with the aid of data preprocessing technique and simultaneous tuning strategy, which is a balance optimization strategy used in the design of PNNC when running space search optimization. Unlike the conventional probabilistic neural network classifier, the proposed neural network classifier adopts two type of polynomials for developing discriminant functions. The overall optimization of PNNC is realized with the aid of so-called structure optimization and parameter optimization with the use of simultaneous tuning strategy. Space search optimization algorithm is considered as a optimize vehicle to help the implement both structure and parameter optimization in the construction of PNNC. Furthermore, principal component analysis and linear discriminate analysis are selected as the data preprocessing techniques for PNNC. Experimental results show that the proposed neural network classifier obtains better performance in comparison with some other well-known classifiers in terms of accuracy classification rate.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.24 no.3
• /
• pp.295-301
• /
• 2018

This study compares optimization algorithms for efficient estimations of ship's hydrodynamic coefficients. Two constrained algorithms, the interior point and the sequential quadratic programming, are compared for the estimation. Mathematical optimization is designed to get optimal hydrodynamic coefficients for modelling a ship, and benchmark data are collected from sea trials of a training ship. A calibration for environmental influence and a sensitivity analysis for efficiency are carried out prior to implementing the optimization. The optimization is composed of three steps considering correlation between coefficients and manoeuvre characteristics. Manoeuvre characteristics of simulation results for both sets of optimized coefficients are close to each other, and they are also fit to the benchmark data. However, this similarity interferes with the comparison, and it is supposed that optimization conditions, such as designed variables and constraints, are not sufficient to compare them strictly. An enhanced optimization with additional sea trial measurement data should be carried out in future studies.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.12
• /
• pp.75-82
• /
• 2015

Generally, the optimal solution of assignment problem can be obtained by Hungarian algorithm of two-sided optimization with time complexity $O(n^4)$. This paper suggests one-sided optimal assignment and swap optimization algorithm with time complexity $O(n^2)$ can be achieve the goal of two-sided optimization. This algorithm selects the minimum cost for each row, and reassigns over-assigned to under-assigned cell. Next, that verifies the existence of swap optimization candidates, and swap optimizes with ${\kappa}-opt({\kappa}=2,3)$. For 27 experimental data, the swap-optimization performs only 22% of data, and 78% of data can be get the two-sided optimal result through one-sided optimal result. Also, that can be improves on the solution of best known solution for partial problems.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.36-39
• /
• 1996

In chemical processes, measurement errors reduce the credibility of information and cause inconsistency in material and energy balances. Because multicomposition flows and temperature measurements make material and energy balances nonlinear equations, data reconciliation becomes a nonlinear constrained optimization problem. In multicomposition processes, if we follow general optimization procedure, the number of measurement variables is so large that data reconciliation requires much computation time. We propose the decomposition procedure to reduce the computation time without the decrease of accuracy of data reconciliation. Decomposition procedure finds global variables, that can reduce the nonlinearity of constraints, and divides two sub-optimization problems. Once we optimize the global variables at upper level, we can easily optimize the remain variables at tower level, We can obtain the short computational time and the same accuracy as SQP optimization method.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2008.04a
• /
• pp.216-221
• /
• 2008

Shape design optimization for linear elasticity problem is performed using isogeometric analysis method. In many design optimization problems for real engineering models, initial raw data usually comes from CAD modeler. Then designer should convert this CAD data into finite element mesh data because conventional design optimization tools are generally based on finite element analysis. During this conversion there is some numerical error due to a geometry approximation, which causes accuracy problems in not only response analysis but also design sensitivity analysis. As a remedy of this phenomenon, the isogeometric analysis method is one of the promising approaches of shape design optimization. The main idea of isogeometric analysis is that the basis functions used in analysis is exactly same as ones which represent the geometry, and this geometrically exact model can be used shape sensitivity analysis and design optimization as well. In shape design sensitivity point of view, precise shape sensitivity is very essential for gradient-based optimization. In conventional finite element based optimization, higher order information such as normal vector and curvature term is inaccurate or even missing due to the use of linear interpolation functions. On the other hands, B-spline basis functions have sufficient continuity and their derivatives are smooth enough. Therefore normal vector and curvature terms can be exactly evaluated, which eventually yields precise optimal shapes. In this article, isogeometric analysis method is utilized for the shape design optimization. By virtue of B-spline basis function, an exact geometry can be handled without finite element meshes. Moreover, initial CAD data are used throughout the optimization process, including response analysis, shape sensitivity analysis, design parameterization and shape optimization, without subsequent communication with CAD description.

• Korean System Dynamics Review
• /
• v.13 no.2
• /
• pp.47-71
• /
• 2012

The purpose of this research is the examination of validity of data as well as simulation model, i.e. to simulate the real data in the SD model with the least error using the adjustments for the faithful reflection of real data to the simulation. In general, SD programs (e.g. VENSIM) utilize the Euler or Runge-Kutta method as an algorithm. It is possible to reflect the trend of real data via these two estimation methods however can cause the validity problem in case of the simulation requiring the accuracy as they have endogenous errors. In this article, the future population estimated by the Korea National Statistical Office (KNSO) to 2050 is simulated by the aging chain model, dividing the population into three cohorts, 0-14, 15-64, 65 and over cohorts by age and offering the adjustments to them. Adjustments are calculated by optimization with three different methods, optimization in EXCEL, manual optimization with iterative calculation, and optimization in VENSIM DSS, the results are compared, and at last the optimal adjustment set with the least error are found among them. The simulation results with the pre-determined optimal adjustment set are validated by methods proposed by Barlas (1996) and other alternative methods. It is concluded that the result of simulation model in this research has no significant difference from the real data and reflects the real trend faithfully.

• Korean Management Science Review
• /
• v.17 no.1
• /
• pp.55-64
• /
• 2000

By managing not only geographical information but also various kinds of attribute data. GIS presents useful information for decision-makings. Most of decision-making problems using GIS can be formulated into network-optimization problems. In this study we deal with the implementation of network optimization system that extracts data from the database in GIS. solves a network optimization problem and present optimal solutions through GIS' graphical user interface. We design a nitwork optimization system and present some implementation techniques by showing a prototype of the network optimization system. Our network optimization system consists of three components : the interface module for user and GIS the basic network the program module the advanced network optimization program module. To handle large-scale networks the program module including various techniques for large sparse networks is also considered, For the implementation of the network optimization system we consider two approaches : the method using script languages supported by GIS and the method using client tools of GIS. Finally some execution results displayed by the prototype version of network optimization system are given.