• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.215-218
• /
• 1996

In work scheduling problems, scheduling constraints are not absolutely rigid; they may be changed depending on the scheduling aspect effected. In order to cope with changes in scheduling constraints and assignment strategies and to optimize scheduling results quickly, this paper will propose a new scheduling method which combines knowledge engineering and mathematical programming techniques.

• Journal of applied mathematics & informatics
• /
• v.8 no.2
• /
• pp.439-448
• /
• 2001

In this paper a fuzzy linear programming problem is presented. Then using the concept of comparison of fuzzy numbers, by the aid of the Mellin transform, we introduce a method for solving this problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.156-161
• /
• 1994

In this paper, we consider an optimal control problem of a nonlinear stochastic system. Dynamic programming approach is employed for the formulation of a stochastic optimal control problem. As an optimality condition, dynamic programming equation so called the Bellman equation is obtained, which seldom yields an analytical solution, even very difficult to solve numerically. We obtain the numerical solution of the Bellman equation using an algorithm based on the finite difference approximation and the contraction mapping method. Optimal controls are constructed through the solution process of the Bellman equation. We also construct a test case in order to investigate the actual performance of the algorithm.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.34C no.8
• /
• pp.64-70
• /
• 1997

This paper presents a parameter optimization method using evolutionary programming in voltage reference circuit because the designer must select appropriate parameter values of the circuit taking into consideration both powr voltage and temperature variation. In this paper, evolutionary programming is suggested as an approach for finding good parameters with which the reference voltage variation is small with respect to temperature variation. Simulation results. Simulation results show that this method is effective in circuit design.

• Journal of applied mathematics & informatics
• /
• v.22 no.1_2
• /
• pp.133-148
• /
• 2006

This paper proposes a smoothing method for symmetric conic linear programming (SCLP). We first characterize the central path conditions for SCLP problems with the help of Chen-Harker-Kanzow-Smale smoothing function. A smoothing-type algorithm is constructed based on this characterization and the global convergence and locally quadratic convergence for the proposed algorithm are demonstrated.

• Proceedings of the KSR Conference
• /
• 2002.10a
• /
• pp.349-356
• /
• 2002

This paper describes a mathematical programming model for constructing the rolling stock assignment plan. This plan is a schedule which assigns daily routings, maintenance activities, and other tasks to trainsets. A generalized set partitioning model which is a kind of integer programming model is suggested as a model for constructing the assignment plan. And a column generation method are suggested as a solution method.

• Computers and Concrete
• /
• v.2 no.5
• /
• pp.411-421
• /
• 2005

A linear programming problem of the optimal proportioning of concrete aggregates is discussed; and a self-adaptive genetic algorithm is developed to solve this problem. The proposed method is based on changing a range of variables for capturing the feasible region of the optimum solution. A computational verification of this method is compared with the results of the linear programming.

• Korean Journal of Computational Design and Engineering
• /
• v.13 no.4
• /
• pp.296-304
• /
• 2008

Recently, various attempts are being done to apply off-line programming system to field of paint robot. But most commercial simulation softwares have problems that are slow simulation speed and not support various painting paramenters on simulation. This paper proposes enhanced paint simulation method for off-line programming system. For these, this method used the mathematical model of flux field from a previous research. The flux field has the flux distribution function, which reflects on the feature of paint spray. A previous research derived this flux distribution function for an integral function and calculated paint thickness function for an integral function. But if flux distribution function is defined as an integral function, it is inadequate to use for real-time simulation because a number of calculation is needed for estimation of paint thickness distribution. Therefore, we defined the flux distribution function by numerical method for reducing a mount of calculation for estimation of paint thickness. We derived the equation of paint thickness function analytically for reducing a mount of calculation from the paint distribution function defined by numerical method. In order to prove proposed paint simulation method this paper compares the simulated and measured thickness. From this comparison this paper show that paint thickness distribution is predicted precisely by proposed spray paint simulation process.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.7 no.4
• /
• pp.690-696
• /
• 2006

This study applies the methods proposed in this issue[1] to the 11 rainfall gauging stations of the Pyongchang area. Also, this study analyzes the error range of each interpolation method, and considers spatial distribution according to the number of gauging station. As the results, the linear programming methods shows the best minimum error. However, this method might be difficult to apply in the field because of need for programming. Comparatively, the inverse distance method shows more simple and accurate results than the linear programming one. The result of this study could contribute to the increase of accuracy for the filling of missing rainfall data.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.1
• /
• pp.27-38
• /
• 1999

In this paper, Primal-Interior Dual-Simplex method(PIDS) and Dual-Interior Primal-Simplex method(DIPS) are developed for the general bounded linear programming. Two methods were implemented and compared with other pricing techniques for the Netlib. linear programming problems. For the PIDS, it shows superior performance to both most nagative rule and dual steepest-edge method since it practically reduces degenerate iterations and has property to reduce the problem. For the DIPS, pt requires less iterations and computational time than least reduced cost method. but it shows inferior performance to the dynamic primal steepest-edge method.