• Journal of computational fluids engineering
• /
• v.11 no.2 s.33
• /
• pp.19-24
• /
• 2006

A research to evaluate the efficiency of design optimization was carried out for aerodynamic design optimization problem in distributed computing environment. The aerodynamic analyses which take most of computational work during design optimization were divided into several jobs and allocated to associated PC clients through network. This is not a parallel process based on domain decomposition in a single analysis rather than a simultaneous distributed-analyses using network-distributed computers. GBOM(gradient-based optimization method), SAO(Sequential Approximate Optimization) and RSM(Response Surface Method) were implemented to perform design optimization of transonic airfoils and evaluate their efficiencies. dimensional minimization followed by direction search involved in the GBOM was found an obstacle against improving efficiency of the design process in the present distributed computing system. The SAO was found fairly suitable for the distributed computing environment even it has a handicap of local search. The RSM is apparently the most efficient algorithm in the present distributed computing environment, but additional trial and error works needed to enhance the reliability of the approximation model deteriorate its efficiency from the practical point of view.

• Journal of Korean Institute of Industrial Engineers
• /
• v.37 no.2
• /
• pp.124-131
• /
• 2011

In this research report, we propose a heuristic algorithm with some primal recovery strategies for capacitated facility location problems (CFLP), which is a well-known combinatorial optimization problem with applications in distribution, transportation and production planning. Many algorithms employ the branch-and-bound technique in order to solve the CFLP. There are also some different approaches which can recover primal solutions while exploiting the primal and dual structure simultaneously. One of them is a MVCD (Mean Value Cross Decomposition) ensuring convergence without solving a master problem. The MVCD was designed to handle LP-problems, but it was applied in mixed integer problems. However the MVCD has been applied to only uncapacitated facility location problems (UFLP), because it was very difficult to obtain "Integrality" property of Lagrangian dual subproblems sustaining the feasibility to primal problems. We present some heuristic strategies to recover primal feasible integer solutions, handling the accumulated primal solutions of the dual subproblem, which are used as input to the primal subproblem in the mean value cross decomposition technique, without requiring solutions to a master problem. Computational results for a set of various problem instances are reported.

• 한국전산유체공학회:학술대회논문집
• /
• 2006.05a
• /
• pp.263-267
• /
• 2006

The path of a flapping airfoil during upstroke and down-stroke is optimized for maximum thrust and propulsive efficiency. The periodic flapping motion in combined pitch and plunge is described using Non-Uniform B-Splines(NURBS). A gradient based algorithm is employed for optimization of the NURBS parameters. Unsteady, low speed laminar flows are computed using a Navier-Stokes solver in a parallel computing environment based on domain decomposition. It is shown that the thrust generation is significantly improved in comparison to the sinusoidal flapping motion. For a high thrust generation, the airfoil stays at a high effective angle of attack for short durations.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.56 no.10
• /
• pp.1721-1730
• /
• 2007

SThis paper proposes a new dispatch scheduling algorithm in interconnected regional system operations. The dispatch scheduling formulated as mixed integer non-linear programming (MINLP) problem can efficiently be computed by generalized Benders decomposition (GBD) algorithm. GBD guarantees adequate computation speed and solution convergency since it decomposes a primal problem into a master problem and subproblems for simplicity. In addition, the inter-temporal optimal power flow (OPF) subproblem of the dispatch scheduling problem is comprised of various variables and constraints considering time-continuity and it makes the inter-temporal OPF complex due to increased dimensions of the optimization problem. In this paper, regional decomposition technique based on auxiliary problem principle (APP) algorithm is introduced to obtain efficient inter-temporal OPF solution through the parallel implementation. In addition, it can find the most economic dispatch schedule incorporating power transaction without private information open. Therefore, it can be expanded as an efficient dispatch scheduling model for interconnected system operation.

• Korean Management Science Review
• /
• v.5 no.1
• /
• pp.56-70
• /
• 1988

In this study, We reviewed the solution methods (for the heuristic and optimization method) for the single-item dynamic lot-sizing problem, and improved the efficiency (speed and optimality) of the conventional heuristic method by utilizing the inventory decomposition property. The iventory decomposition property decomposes the given original problem into several independent subproblems without violating the optimality conditions. Then we solve each decomposed subproblems by using the conventional heuristics such as LTC, LUC, Silver-Meal etc. For testing the efficiency of the proposed decomposition method, we adopted the data sets given in Kaimann, Berry and Silver-Meal. The computational results show that the suggested problem solving framework results in some promising effects on the computation time and the degree of optimality.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.01a
• /
• pp.7-12
• /
• 2009

In JPEG2000, the Cohen-Daubechies-Feauveau (CDF) 9/7-tap wavelet filter adopted in lossy compression is implemented by the lifting scheme or by the convolution scheme while the LeGall 5/3-tap wavelet filter adopted in lossless compression is implemented just by the lifting scheme. However, these filters are not optimal in terms of Peak Signal-to-Noise Ratio (PSNR) values, and irrational coefficients of wavelet filters are complicated. In this paper, we proposed a method to optimize image quality based on wavelet filter design and on wavelet decomposition. First, we propose a design of wavelet filters by selecting the most appropriate rational coefficients of wavelet filters. These filters are shown to have better performance than previous wavelet ones. Then, we choose the most appropriate wavelet decomposition to get the optimal PSNR values of images.

• Industrial Engineering and Management Systems
• /
• v.1 no.1
• /
• pp.73-78
• /
• 2002

In this paper, we propose a constrained optimization model for conjoint analysis (a preference decomposition technique) to improve parameter estimation by restricting the relative importance of the attributes to an extent as decided by the respondents. Quite simply, respondents are asked to provide some pairwise attribute comparisons that are then incorporated as additional constraints in a linear programming model that estimates the partial preference values. This data collection method is typical in the analytic hierarchy process. Results of a simulation study show the new model can improve the predictive accuracy in partial value estimation by ordinal east squares (OLS) regression.

• Advances in aircraft and spacecraft science
• /
• v.4 no.4
• /
• pp.467-486
• /
• 2017

A method for decoupling reliability based design optimization problem into a set of deterministic optimization and performing a reliability analysis is described. The inner reliability analysis and the outer optimization are performed separately in a sequential manner. Since the outer optimizer must perform a large number of iterations to find the optimized shape and size of structure, the computational cost is very high. Therefore, during the course of this research, new multilevel reliability optimization methods are developed that divide the design domain into two sub-spaces to be employed in an iterative procedure: one of the shape design variables, and the other of the size design variables. In each iteration, the probability constraints are converted into equivalent deterministic constraints using reliability analysis and then implemented in the deterministic optimization problem. The framework is first tested on a short column with cross-sectional properties as design variables, the applied loads and the yield stress as random variables. In addition, two cases of curvilinearly stiffened panels subjected to uniform shear and compression in-plane loads, and two cases of curvilinearly stiffened panels subjected to shear and compression loads that vary in linear and quadratic manner are presented.

• International Journal of Contents
• /
• v.12 no.3
• /
• pp.22-28
• /
• 2016

Tensor with missing or incomplete values is a ubiquitous problem in various fields such as biomedical signal processing, image processing, and social network analysis. In this paper, we considered how to reconstruct a dataset with missing values by using tensor form which is called tensor completion process. We applied Tucker factorization to solve tensor completion which was built base on optimization problem. We formulated the optimization objective function using components of Tucker model after decomposing. The weighted least square matric contained only known values of the tensor with low rank in its modes. A first order optimization method, namely Nonlinear Conjugated Gradient, was applied to solve the optimization problem. We demonstrated the effectiveness of the proposed method in EEG signals with about 70% missing entries compared to other algorithms. The relative error was proposed to compare the difference between original tensor and the process output.

• International Journal of Aeronautical and Space Sciences
• /
• v.8 no.1
• /
• pp.66-78
• /
• 2007

A multi-point aerodynamic shape optimization technique has been developed for helicopter rotor blades in hover based on a continuous adjoint method on unstructured meshes. The Euler flow solver and the continuous adjoint sensitivity analysis were formulated on the rotating frame of reference. The 'objective function and the sensitivity were obtained as a weighted sum of the values at each design point. The blade section contour was modified by using the Hicks-Henne shape functions. The mesh movement due to the blade geometry change was achieved by using a spring analogy. In order to handle the repeated evaluation of the design cycle efficiently, the flow and adjoint solvers were parallelized based on a domain decomposition strategy. A solution-adaptive mesh refinement technique was adopted for the accurate capturing of the wake. Applications were made to the aerodynamic shape optimization of the Caradonna-Tung rotor blades and the UH-60 rotor blades in hover.