• East Asian mathematical journal
• /
• v.38 no.1
• /
• pp.21-31
• /
• 2022

This paper is concerned with the optimal control problem associated to the self-organizing target detection model in 1D domains. That is, we show the global existence of weak solution and the existence of optimal control.

• Journal of the Korean Society for Precision Engineering
• /
• v.26 no.2
• /
• pp.141-147
• /
• 2009

We introduce a noble method to find a variation of the optimal path problem. The problem is to find the optimal decomposition of an original planar region such that the number of paths in the region is minimized. The paths are required to uniformly cover each subregion and the directions of the paths in each sub-region are required to be either entirely vertical or entirely horizontal. We show how we can transform the path problem into a graph s-t cut problem. We solve the transformed s-t cut problem using the Ford-Fulkerson method and show its performance. The approach can be used in zig-zag milling and layerd manufacturing.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.33 no.1
• /
• pp.35-49
• /
• 2008

To load a container in a yard block onto a ship, a Transfer Crane (TC) moves to a target yard bay, then its hoist picks up a selected container and loads it onto a waiting Yard Truck (YT). An optimal routing problem of Transfer Crane is a decision problem which determines a given TC's the visiting sequence of yard-bays and the number of containers to transfer from each yard-bay. The objective is to minimize the travel time of the TC between yard-bays and setup time for the TC in a visiting yard. In this paper, we shows that the problem is NP-complete, and suggests a new formulation for it. Using the new formulation for the problem, we investigate some characteristics of solutions, a lower and upper bounds for it. Moreover, our lower and upper bound is very efficient to applying some instances suggested in a previous work.

• Proceedings of the KIEE Conference
• /
• 2006.11a
• /
• pp.222-224
• /
• 2006

This paper addresses a particle swarm optimization-based approach for solving a generating unit maintenance scheduling problem(GMS) with some constraints. We focus on the power system reliability such as reserve ratio better than cost function as the objective function of GMS problem. It is shown that particle swarm optimization-based method is effective in obtaining feasible schedules such as GMS problem related to power system planning and operation. In this paper, we find the optimal solution of the GMS problem within a specific time horizon using particle swarm optimization algorithm. Simple case study with 16-generators system is applicable to the GMS problem. From the result, we can conclude that PSO is enough to look for the optimal solution properly in the generating unit maintenance scheduling problem.

• Journal of Korean Institute of Industrial Engineers
• /
• v.32 no.2
• /
• pp.98-103
• /
• 2006

In this research, the single machine capacitated lot-sizing and scheduling problem with sequence- dependent setup costs and setup times (CLSPSD) is considered. This problem is the extension of capacitated lot-sizing and scheduling problem (CLSP) with an additional assumption on sequence-dependent setup costs and setup times. The objective of the problem is minimizing the sum of production costs, inventory holding costs and setup costs satisfying customers' demands. It is known that the CLSPSD is NP-hard. In this paper, the MIP formulation is presented. To handle the problem more efficiently, a conceptual model is suggested, and one of the well-known meta-heuristics, the simulated annealing approach is applied. To illustrate the performance of this approach, various instances are tested and the results of this algorithm are compared with those of the CLPEX. Computational results show that this approach generates optimal or nearly optimal solutions.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.193-196
• /
• 2002

Vehicle routing problem is known to be a NP-hard problem, and is traditionally solved by some heuristic approaches. This paper investigates the application of the computer method COMSOAL to the optimal vehicle routing selection problem. The COMSOAL (Computer Method of Sequencing Operations for Assembly Lines) is a computer heuristic originally developed to solve an assembly line balancing problem a few decades ago. The solution methodology of repeatedly running COMSOAL will result in many feasible solutions from which the best is chosen. This solution approach now becomes viable thanks to the significantly increased speed of recent computer technology. This paper discusses the adaptation of the COMSOAL approach to the known set of simple vehicle routing example problem. The results show that the COMSOAL can be a good possible approach to solve the vehicle routing problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.1508-1511
• /
• 1997

In this paper, design parameters of Rapid Thermal Processing(RrW) to minimize the wafer tempera ture uniformity errors are proposed. 1,anip ling positions and the wafer height are important parameters for waf er temperature uniformity in R'I'P. We propose the method to seek lamp ling positions and the wafer height for optimal temperature uniformity. l'he ~~roposed method is applied to seek optimal lamp ling positions and the waf er height of 8 inch wafer. 'I'o seek the optimal lamp ling positions and the wafer height, we var\ulcorner. lamp ling 110s itions and the wafer height and then formulate the wafer temperature uniformity problem to the linear programmi ng problem. Finally, it is shown that the wafer temperature uniformity in RI'I' designed by optimal prarneters is improved to comparing with Ii'l'P designed by the other method.

• Journal of Korean Society for Quality Management
• /
• v.16 no.2
• /
• pp.1-9
• /
• 1988

This paper considers a machine maintenance problem. The machine's condition is partially known by observing the machine's output products. This problem is formulated as an infinite horizon partially observable Markov decison process to find an optimal maintenance policy. However, even though the optimal policy of the model exists, finding the optimal policy is very time consuming. Thus, the intends of this study is to find ${\varepsilon}-optimal$ stationary policy minimizing the expected discounted total cost of the system, ${\varepsilon}-optimal$ policy is found by using a modified version of the well-known policy iteration algorithm. A numerical example is also shown.

• Journal of Korean Institute of Industrial Engineers
• /
• v.33 no.4
• /
• pp.487-493
• /
• 2007

In this paper, we deal with an optimal software-release problem of determining the time to stop testing and release the software system to the user. The optimal release time problem is considered from maintenance like the periodic distribution of service packs and the unpredictable distribution of patches after the release. Moreover, the environment of software error-detection during operation differs from the environment during testing. This paper proposes the software reliability growth model which incorporates periodic service packs, unpredictable patches and operational environment. Based on the proposed model, we derive optimal release time to minimize total cost composed of fixing an error, testing and maintenance. Using numerical examples, optimal release time is determined and illustrated.

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

Net Present Value (NPV) criterion has been the most widely used criterion to evaluate investment opportunities. However, the analysis based on the NPV criterion falls to consider the managerial flexibility of deferring decisions until major uncertainty is resolved. Recently, real options method attracted a lot of attention as a Powerful approach to address the problem. If investment decision is deferred, the value of the investment opportunity increases but opportunity cost increases at the same time. Therefore, it is important to decide the optimal timing how long the decision can be deferred. In this paper, we developed a model deciding the optimal decision timing. Using the real options approach, the model derived the optimal deferring time until a decision is made. Then, the model was applied to a Korean mobile telecommunications company who wants to invest on the wireless resale business. We believe that this model would be very useful to overcome the problem of NPV decision criterion. With this approach, we can make contingent decisions based on the observation of uncertainly resolutions.