• IE interfaces
• /
• v.24 no.3
• /
• pp.173-186
• /
• 2011

In this paper, we evaluate life annuity plans for Korean pre-retired single and married couple participating Korea National Pension (KNP) and find optimal life annuity strategy by using utility-based measurements called AEW (Annuity Equivalent Wealth). Specifically, we extend a previous study to obtain a detailed optimal combination of annuitizing age and wealth in terms of percentage of net wealth at the time of retirement. A nonlinear optimization model is formulated with the objective of maximizing utility on consumption and bequest, and the dynamic programming (DP) technique is used to solve this problem. We find that there exist consistent patterns in optimal combinations of annuitizing age and wealth. Also, for all cases the optimal combination is significantly better than several other combinations. The results indicate that using the optimal approach can be beneficial to practitioners in insurance industry and prospective purchasers of life annuity. We conclude the paper with some discussions and suggestions.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.2
• /
• pp.69-83
• /
• 2001

The problem of minimizing total tardiness on a batch processing machine with incompatible job families when there are sequence independent setup times between families is studied where all jobs of the same family have identical processing times and jobs of different families cannot be processed together. A batch processing machine can process a number of jobs, within a maximal batch size, simultaneously as a batch. The processing time required of each batch is equal to the one of jobs. A dynamic programming algorithm which gives the optimal solution, and several heuristics are presented. Performance of simple dispatching rules based on due dates are compared, and the best of them is used as an initial solution for the decomposition algorithm, which is shown to give good schedules in relatively short computational time.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.81-98
• /
• 1997

Given a rooted tree T with profits and node demands, the capacitated subtree of a tree problem (GSTP) consists of finding a rooted subtree of maximum profit, subject to having total demand no larger than the given capacity H. We first define the so-called critical item for CSTP and find an upper bound on the optimal value of CSTP in O(n$^{2}$) time, where n is the number of nodes in T. We then present our branch and bound algorithm for solving CSTP and illustrate the algiruthm by using an example. Finally, we implement our branch-and-bound algorithm and compare the computational results with those for both CPLEX and a dynamic programming algorithm. The comparison shows that our branch-and-bound algorithm performs much better than both CPLEX and the dynamic programming algorithm, where n and H are the range of [50, 500] and [5000, 10000], respectively.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.28 no.4
• /
• pp.105-114
• /
• 2003

This paper considers a single facility scheduling problem for the fabrication of components supporting the subsequent assembly into products. Each product consists of two types of components, one is common to all products and the other is unique to itself. The unique components are processed individually and the common components are processed in batches, and a distinct setup is incurred for the production of a batch of common components. Under the so-called “batch availability” environment, we propose an efficient dynamic programming(DP) procedure for the optimal sequencing and batching schedule with minimum total completion times of products in the situation that each product is said to be complete if both common and unique components of the product are finished. Computational results show that the proposed DB procedure is more efficient than the previous work which has considered the same problem as this paper.

• Korean Management Science Review
• /
• v.33 no.3
• /
• pp.89-103
• /
• 2016

In this paper, we design sampling inspections and service capacities simultaneously for multi-products. Products are supplied in batches after rectifying inspections, that is, rejected lot is subject to total inspection and defective products are reworked to good ones. When supplied, all defective products are uncovered and returned to service. Particularly, we extend Kim [1] by introducing the fixed costs of providing services and show that the cost function of a product is no longer linear or convex in terms of the level of service provision. We develop a framework for a product to deal with this joint design problem and a dynamic programming algorithm for multi-products which allocates the given number of the total service capacities among products with the considerably smaller computations than the total number of possible allocations.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.747-749
• /
• 2000

In this paper, we proposed color stereo matching algorithm using dynamic programming. The conventional gray stereo matching algorithms show blur at depth discontinuities and non-existence of matching pixel in occlusion lesions. Also it accompanies matching error by lack of matching information in the untextured region. This paper defines new cost function makes up for the problems happening in conventional gray stereo matching algorithm. New cost function contain the following properties. I) Edge points are corresponded to edge points. ii) Non-edge points are corresponded to non-edge points. iii) In case of exiting the amount of edges, the cost function has some weight in proportion to path distance. Proposed algorithm was applied in various images obtained by parallel camera model. As the result, proposed algorithm showed improved performance in the aspect of matching error and processing in the occlusion region compared to conventional gray stereo matching algorithms.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.184-186
• /
• 2006

We propose a new method for shortest path planning of mobile robots. The topological information of the graph is obtained by thinning method to generate the collision-free path of robot. And the travelling path is determined through hierarchical planning stages. The first stage generates an initial path by use of Dijkstra's algorithm. The second stage then generates the final path by use of dynamic programming (DP). The DP adjusts the intial path to reduce the total travelling distance of robot. Simulation results are presented to verify the performance of the proposed method.

• Journal of Welding and Joining
• /
• v.14 no.2
• /
• pp.96-105
• /
• 1996

Robot systems are widely utilized in the shipbuilding industry to enhance the productivity by automating the welding process. In order to increase productivity, it is necessary to reduce the time used for robot teaching. In this work, the automatic teaching system is developed for the subassembly process in the shipbuilding industry. A alser/vision sensor is designed to detect the weld seam and the image of the fillet joint is processed using the arm method. Positions of weld seams defined in the CAD database are transformed into the robot coordinate, and the dynamic programming technique is applied to find the sub-optimum weld path. Experiments are carried out to verify the system performance. The results show that the proposed automatic teaching system performs successfully and can be applied to the robot system in the subassembly process.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.1
• /
• pp.83-97
• /
• 1990

We consider an insured who wishes to determine his optimal reporting strategy over a given planning horizon, when he has option of reporting of not reporting his at-fault accidents. Assuming that the premium in future period is continually adjusted by the insured's loss experience, the insured would not report every loss incurred. Rather, considering the benefits and costs of each decision, the insured may want to seek a way of optimizing his interests over the planning horizon. The situation is modeled as a dynamic programming problem. We consider an insured's discounted expected cost minimization problem, where the premium increase in future period is affected by the size of the current claim. More specifically, we examine two cases ; (1) the premium increase in the next is a linear function (a constant fraction) of the current claim size; (2) the premium increase in the next period is a concave function of the current claim size. In each case, we derive the insured's optimal reporting strategy.

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

An integrated Robot control system for SCARA robot is developed. The system consists of an off-line programming(OLP), software and a robot controller using four digital signal processor(TMS32OC50). The OLP has functions of teaching task, dynamic simulator, three dimensional animation, and trajectory planning. To develop robust dynamic control algorithm, a new sliding mode control algorithm for the robot is proposed. The trajectory tracking performance of these algorithm is evaluated by implementing to SCARA robot(SM5 type) using DSP controller which has conventional PI-FF control algorithm. To make SCARA robot operate according to off-line teaching, an interface between OLP and robot controller in the integrated system is designed. To demonstrate performance of the integrated system, the proposed control algorithm is applied to the system.