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

We consider the problem of determining the spare inventory level for a multiechelon repairable-item inventory system. Our model extends the previous results to the system which has an inventory at the central depot as well as bases. We develop an optimal algorithm to find spare inventory leveis, which minimize the total expected cost and simultaneously satisfy a specified minimum service rate. The algorithm is tested using problems of various sizes to verify the efficiency and accuracy.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.852-854
• /
• 2005

This paper proposes a new Interior Point Method algorithm to improve the computation speed and solution stability, which have been challenging problems for employing the nonlinear Optimal Power Flow. The proposed algorithm is different from the traditional Interior Point Methods in that it adopts the Predictor-Corrector Method. It also accommodates the five minute dispatch, which is highly recommended in modern electricity market. Finally, the efficiency and applicability of the proposed algorithm is demonstrated with a case study.

• Journal of the military operations research society of Korea
• /
• v.9 no.1
• /
• pp.75-85
• /
• 1983

This study is concerned with the problem of routing vehicles stationed at a central depot to supply customers with known demands, in such a way as to minimize the total distance travelled. The problem is referred to as the vehicle routing problem and is a generalization of the multiple traveling salesmen problem that has many practical applications. A branch-and-bound algorithm for the exact solution of the vehicle routing problem is presented. The algorithm finds the optimal number of vehicles as well as the minimum distance routes. A numerical example is given.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.24-28
• /
• 2008

In RFID System, when multiple tags respond simultaneously, a collision can occur. A method that solves this collision is referred to anti-collision algorithm. Among the existing anti-collision algorithms, static framed slot allocation algorithm is very simple. But when the number of tags is variable, its performance degrades because of the fixed frame size. This paper proposes an optimal frame size allocation scheme that determines the frame size. The proposed scheme is based on the number of collision slots at every frame. According to the simulation results, the tag identification time is faster that of SFSA.

• Proceedings of the KIEE Conference
• /
• 2000.11a
• /
• pp.107-109
• /
• 2000

This paper presents an algorithm for reducing congestion cost using decoupled optimal power flow. The main idea of this algorithm is to reduce the reactive power flows on the congested lines in reactive power optimization. New objective function for reducing congestion cost is proposed in the reactive formulation by introducing the shadow prices for congested lines. The proposed algorithm is tested for IEEE 14-bus sample system, and the results are presented and discussed.

• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.496-501
• /
• 1992

In this paper, the optimal regulating algorithm are developed by adjusting the scaling - factor and estimating the linguistic control rule according to the results which are attaining from the first defined parameters, and the fuzzy level controller is realized usign the algorithm. The proposed controller apply to the fuzzied level control process, the cement grinding plant. The results shows that the control performance is greatly improved.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.22
• /
• pp.35-42
• /
• 1990

This paper deals with a single machine scheduling problem with a quadratic penalty function of completion times. The objective is to find a optimal sequence which minimizes the total penalty. A new type of node elimination procedure and precedence relation is developed that determines the ordering between adjacent jobs and is incorporated into a branch and bound algorithm. In addition, modified penalty function is considered and numerical examples are provided to test the effectiveness of the optimum algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.52-56
• /
• 1990

An algorithm is proposed to determine the optimal contact forces of robotic hands, where the soft finger contact as well as the frictional point contact are considered. Especially, the algorithm can be efficiently applied to the case of multi-point contact by inner-link as well as fingertip. To show the validities of the algorithm, several numerical exampies are presented by employing a robotics hand with three fingers each of which has four joints.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06d
• /
• pp.232-233
• /
• 2011

We propose a randomized distributed scheduling algorithm which can achieve the optimal throughput under the general interference model. The proposed algorithm is analyzed to show an attractive performance in that it can return a maximal schedule with high probability and has a low time-complexity. We also provide the simulation results to validate performance analysis of our algorithm.

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.941-943
• /
• 1995

The convergence of adaptive algorithm depends mainly on the proper choice of the design factor called the covergence factor. In the paper, an optimal convergence factor involved in TRLMS algorithm, which is used to predict the coefficients of the ARMA predictor in ADPCM is presented. It is shown that such an optimal value can be generated by system signals such that the adaptive filter becomes self optimizing in terms of the convergence factor. This algorithm is applied to real image.