• Magazine of the Korean Society of Agricultural Engineers
• /
• v.39 no.2
• /
• pp.1-8
• /
• 1997

Abstract The need for integrated reservoir system operation become more intense as the demands from the system increase. A deterministic, three-dimensional discrete incremental dynamic programming approach is presented to derive reservoirs system operational planning strategies. The developed H3DP model optimizes the monthly operation of the Hwachon and Soyang Projects on the North Han river and Chungju Main Project on the South Han river. By using the H3DP model, Hwachon project was reevaluated as a component of the upstream multipurpose storage reservoirs in the basin based on 1993 hydrology. This case study demonstrates the practical use of the developed model for the basin multi-reservoir system operation in an integrated, multipurpose fashion.

• 한국전산유체공학회:학술대회논문집
• /
• 2000.05a
• /
• pp.60-65
• /
• 2000

An aerodynamic design method has been developed by using a three-dimensional unstructured Euler code and an adjoint code with a discrete approach. The resulting adjoint code is applied to a wing design problem of super-sonic transport with a wing-body-nacelle configuration. Hicks-Henne shape functions are adopted far the surface geometry perturbation, and the elliptic equation method is employed fer the interior grid modification during the design process. Interior grid sensitivities are neglected except those for design parameters associated with nacelle translation. The Sequential Quadratic Programming method is used to minimize the drag with constraints on the lift and airfoil thickness. Successful design results confirm validity and efficiency of the present design method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.2
• /
• pp.175-183
• /
• 1998

When a product is designed, tolerances must be given to the product so that required functions are guaranteed and production costs are minimized. In this research, a model is suggested which allocates tolerances to components optimally according to the STA(Statistical Tolerance Allocation) method. Taking into account the concept that dimensional errors have characteristics of statistical distributions, this model presents the discrete pseudo-boolean approach for the tolerance optimization by minimizing the tolerance cost and the quality loss cost. In this approach, two methods are proposed for the reduction of the problem scale; 1) a method for converting the minimization model for casts into the maximization model for cost savings, and 2) procedures to reduce the number of constraints and variables.

• Proceedings of the KIEE Conference
• /
• 2006.07a
• /
• pp.216-217
• /
• 2006

This paper presents development of program for generator maintenance scheduling. The maintenance scheduling of generating units is a dynamic discrete combinatorial optimization problem with constraints to determine the optimal maintenance periods of each generating units for a given planning periods. The developed program is designed so as to provide the maintenance schedule satisfying the operating reserve margin levelization and the procurement of proper reliability. In order to verify the effectiveness of the developed program, the numerical study has been performed with the practical data in 2005.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.31 no.3
• /
• pp.17-23
• /
• 2008

In this research article, scheduling a casting sequence in a job-shop type foundry involving a variety of casts made of an identical alloy but with different shapes and II weights, has been investigated. The objective is to produce the assigned mixed orders satisfying due dates and obtaining the highest ingot efficiency simultaneously. Implementing simple integer programming instead of complicated genetic algorithms accompanying rigorous calculations proves that it can provide a feasible solution with a high accuracy for a complex, multi-variable and multi-constraint optimization problem. Enhancing the ingot efficiency under the constraint of discrete ingot sizes is accomplished by using a simple and intelligible algorithm in a standard integer programming. Employing this simple methodology, a job-shop type foundry is able to maximize the furnace utilization and minimize ingot waste.

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

This paper proposes a heuristic algorithm for performing the line balancing of PCB assembly fine including multiple surface mounters efficiently. We consider a PCB assembly line including the multiple surface mounters arranged serially as a target system. We assume that the number of heads of surface mounters can be changed. Also, the conveyor is assumed to move at a constant speed and have no buffer. Considering the minimum number of machines required for the desired production rate is a discrete nonincreasing function which is inversely proportional to the cycle time, we propose an optimization algorithm for line balancing by using the binary search method. Also we propose an head-changing algorithm. The algorithms are validated through the computer simulation.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.10a
• /
• pp.171-178
• /
• 2004

The purpose of optimum design for structures is to minimize the cost and to obtain the reasonable structural systems. This design algorithm have many objective functions including discrete variables as sections, weight, stiffness and shapes. Simulated annealing, Genetic algorithm and TABU algorithm are used search for these optimum values in the structural design. TABU algorithm is applied to many types structures to search for section and distribution optimization and compared with the results of Genetic algorithm for evaluating the efficiency of this algorithm. In this paper, the plane truss of 10 elements and the space truss of 25 element having 10 nodes, star dome and cable dome are analyzed as analytical models.

• Transactions of Materials Processing
• /
• v.13 no.4
• /
• pp.334-341
• /
• 2004

In this study, a remeshing algorithm adapted to the mesh density map using the Delaunay mesh generation method is developed. In the finite element simulation of forging process, the numerical error increases as the process goes on because of discrete property of the finite elements and distortion of elements. Especially, in the region where stresses and strains are concentrated, the numerical error will be highly increased. However, it is not desirable to use a uniformly fine mesh in the whole domain. Therefore, it is necessary to reduce the analysis error by constructing locally refined mesh at the region where the error is concentrated such as at the die corner. In this paper, the point insertion algorithm is used and the mesh size is controlled by using a mesh density map constructed with a posteriori error estimation. An optimized smoothing technique is adopted to have smooth distribution of the mesh and improve the mesh element quality.

• Journal of the Korean Geotechnical Society
• /
• v.19 no.6
• /
• pp.99-106
• /
• 2003

In this paper, a new optimized design methodology is proposed. It integrates the discrete element method (DEM) and real-coded genetic algorithm for the design of landfill lining system subjected to equipment loadings. In applying the design method to a tapered lining system, the effect of the taperness, which means the change of shape for cover soil, is examined. The optimization problem to maximize the capacity of a waste-containment facility is solved using real coded genetic algorithm. Numerical example analysis is carried out for a typical landfill slope structure.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.4
• /
• pp.289-292
• /
• 2001

This paper concerns with a receding horizon estimator (RHE) for discrete-time linear systems subject to constraints on the estimate. In solving the optimization for every horizons, the past all measurement data outside the horizon is discarded and thus the arrival cost is not considered. The RHE in the current work is a finite impulse response (FIR) structure which has some good inherent properties. The proposed RHE can be represented in the simple matrix form for the unconstrained case. Various numerical examples demonstrate how including constraints in the RHE can improve estimation performance. Especially, in the application to the unknown input estimation, it will be shown how the FIR structure in the RHE can improve the estimation speed.