Journal of Korean Institute of Industrial Engineers, Dec 1, 1998
In this paper, we deal with a node weighted Steiner Ring Problem (SRP) arising from the deploymen... more In this paper, we deal with a node weighted Steiner Ring Problem (SRP) arising from the deployment of Synchronous Optical Networks (SONET), a standard of transmission using optical fiber technology. The problem is to find a minimum weight cycle (ring) covering a subset of nodes in the network considering node and link weights. We have developed two mathematical models, one of which is stronger than the other in terms of LP bounds, whereas the number of constraints of the weaker one is polynomially bounded. In order to solve the problem optimally, we have developed some preprocessing rules and valid inequalities. We have also prescribed an effective heuristic procedure for providing tight upper bounds. Computational results show that the stronger model is better in terms of computation time, and valid inequalities and preprocessing rules are effective for solving the problem optimally.
In this paper, we consider a situation in which a group of facilities must be constructed in orde... more In this paper, we consider a situation in which a group of facilities must be constructed in order to serve a given set of customers, where the facilities might not be able to guarantee an absolute coverage to the different customers. We examine the problem of maximizing the total service reliability of the system subject to a budgetary constraint. We propose a new reformulation of this problem that facilitates the generation of tight lower and upper bounds. These bounding mechanisms are embedded within the framework of a branch-and-bound procedure. Computational results on problem instances ranging in size up to 100 facilities and 200 customers reveal the efficacy of the proposed exact and heuristic approaches.
Various types of control charts are available, but their full advantages are not being utilized d... more Various types of control charts are available, but their full advantages are not being utilized due to the lack of experts who can select, design, implement, and interpret. An expert system is developed which would perform these functions as if each process had a resident expert.
Journal of the Eastern Asia Society for Transportation Studies, 2004
The efficiency of the real-time route guidance system(RGS) depends largely on the quality of rout... more The efficiency of the real-time route guidance system(RGS) depends largely on the quality of route search algorithms. In this paper, we implement the coarse grid method(CGM) in mathematical programming for finding a good quality route of real-time RGS in large-scale networks. The proposed CGM examines coarser and wider networks as the search phase proceeds, in stead of searching the whole network at once. Naturally, we can significantly reduce computational efforts in terms of search time and memory requirement. We demonstrate the practical effectiveness of the proposed CGM with nationwide real road network simulation.
Journal of Korean Institute of Industrial Engineers, 2007
In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum ... more In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over and overlapping as well as demand splitting are considered. Also, maximum number of setups for each time period is not limited. For this LSSP, we have formulated a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we have developed an efficient heuristic algorithm by combining decomposition scheme with local search procedure. Test results show that the developed heuristic algorithm finds good quality (in practice, even better) feasible solutions using far less computation time compared with the CPLEX, a competitive MIP solver.
The uniformly minimum variance unbiased estimate of a parametric function and its variance are de... more The uniformly minimum variance unbiased estimate of a parametric function and its variance are derived under the inverse multinational sampling plan of mth order (IMSP(m)), and it is shown that IMSP(m) can be used more advantageously than IMSP(j), j
This paper is concerned with some variational calculus/optimization problems involving the determ... more This paper is concerned with some variational calculus/optimization problems involving the determination of constrained optimal path functions or routes of a single moving facility, which traverses a region encompassing a set of existing facilities. Situations of this type may involve a reconnaisance plane maintaining a surveillance of certain locations, a patrol car traveling in radio contact with several stations with the possibility of being dispatched to answer service calls originating over several designated regions, or an aircraft determining a flight plan over a region containing enemy missile sites. We formulate the general problem of maximizing total benefits, or maximizing the benefits per unit travel time, subject to constraints on the travel path function. The specific problems analyzed involve a direct distance related benefit (or cost) function, employing rectilinear or squared-Euclidean distance measures, and they constrain the paths to be straight lines between parallel boundaries or across rectangular regions, with both ends free or with one end fixed, or to be general paths between fixed end-points. In each case, the problem is reduced to a finite dimensional optimization problem. Illustrative examples and computational results on a personal computer are provided, and several extensions are proposed for future research.
We study the structural and electrochemical performance of sulfur cathodes prepared with two diff... more We study the structural and electrochemical performance of sulfur cathodes prepared with two different binders, PVdF and SBR/CMC. Enhanced battery performance is observed in the SBR/CMC-based electrode and its origin is scrutinized.
As a systematic, scientific, computerized, and interdisciplinary approach to art therapy, an expe... more As a systematic, scientific, computerized, and interdisciplinary approach to art therapy, an expert system has been developed for the structured mandala, which is selected as an art therapy tool. This system can aid human experts in providing their client with the analysis and interpretation of the mandala. The client's personal preferences of color are obtained through a questionnaire. The system automatically analyzes and evaluates the color-related-elements in the mandalas, and deduces the client's performance-relatedelements in the colorings. A knowledge base has been constructed on the meanings of the colors that appear in drawings and structured mandala, the relations between the colors that appear in a mandala and the personal characteristics in the questionnaire, and the detection of changes of elements in a series of mandalas. The knowledge is expressed in a simple IF-THEN format and accumulated in the knowledge base. The system evokes the relevant knowledge corresponding to the analysis and evaluation of the elements in the mandala, and the answers to the questionnaire. The system operation and usability are illustrated through example cases.
In this paper, we deal with a new lot-sizing and scheduling problem (LSSP) that minimizes the sum... more In this paper, we deal with a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost, and inventory cost. Incorporating the constraints of setup carry-over and overlapping as well as demand splitting, we develop a mixed integer ...
Journal of Korean Institute of Industrial Engineers, Dec 1, 1998
In this paper, we deal with a node weighted Steiner Ring Problem (SRP) arising from the deploymen... more In this paper, we deal with a node weighted Steiner Ring Problem (SRP) arising from the deployment of Synchronous Optical Networks (SONET), a standard of transmission using optical fiber technology. The problem is to find a minimum weight cycle (ring) covering a subset of nodes in the network considering node and link weights. We have developed two mathematical models, one of which is stronger than the other in terms of LP bounds, whereas the number of constraints of the weaker one is polynomially bounded. In order to solve the problem optimally, we have developed some preprocessing rules and valid inequalities. We have also prescribed an effective heuristic procedure for providing tight upper bounds. Computational results show that the stronger model is better in terms of computation time, and valid inequalities and preprocessing rules are effective for solving the problem optimally.
In this paper, we consider a situation in which a group of facilities must be constructed in orde... more In this paper, we consider a situation in which a group of facilities must be constructed in order to serve a given set of customers, where the facilities might not be able to guarantee an absolute coverage to the different customers. We examine the problem of maximizing the total service reliability of the system subject to a budgetary constraint. We propose a new reformulation of this problem that facilitates the generation of tight lower and upper bounds. These bounding mechanisms are embedded within the framework of a branch-and-bound procedure. Computational results on problem instances ranging in size up to 100 facilities and 200 customers reveal the efficacy of the proposed exact and heuristic approaches.
Various types of control charts are available, but their full advantages are not being utilized d... more Various types of control charts are available, but their full advantages are not being utilized due to the lack of experts who can select, design, implement, and interpret. An expert system is developed which would perform these functions as if each process had a resident expert.
Journal of the Eastern Asia Society for Transportation Studies, 2004
The efficiency of the real-time route guidance system(RGS) depends largely on the quality of rout... more The efficiency of the real-time route guidance system(RGS) depends largely on the quality of route search algorithms. In this paper, we implement the coarse grid method(CGM) in mathematical programming for finding a good quality route of real-time RGS in large-scale networks. The proposed CGM examines coarser and wider networks as the search phase proceeds, in stead of searching the whole network at once. Naturally, we can significantly reduce computational efforts in terms of search time and memory requirement. We demonstrate the practical effectiveness of the proposed CGM with nationwide real road network simulation.
Journal of Korean Institute of Industrial Engineers, 2007
In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum ... more In this paper, we consider a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost and inventory cost. Setup carry-over and overlapping as well as demand splitting are considered. Also, maximum number of setups for each time period is not limited. For this LSSP, we have formulated a mixed integer programming (MIP) model, of which the size does not increase even if we divide a time period into a number of micro time periods. Also, we have developed an efficient heuristic algorithm by combining decomposition scheme with local search procedure. Test results show that the developed heuristic algorithm finds good quality (in practice, even better) feasible solutions using far less computation time compared with the CPLEX, a competitive MIP solver.
The uniformly minimum variance unbiased estimate of a parametric function and its variance are de... more The uniformly minimum variance unbiased estimate of a parametric function and its variance are derived under the inverse multinational sampling plan of mth order (IMSP(m)), and it is shown that IMSP(m) can be used more advantageously than IMSP(j), j
This paper is concerned with some variational calculus/optimization problems involving the determ... more This paper is concerned with some variational calculus/optimization problems involving the determination of constrained optimal path functions or routes of a single moving facility, which traverses a region encompassing a set of existing facilities. Situations of this type may involve a reconnaisance plane maintaining a surveillance of certain locations, a patrol car traveling in radio contact with several stations with the possibility of being dispatched to answer service calls originating over several designated regions, or an aircraft determining a flight plan over a region containing enemy missile sites. We formulate the general problem of maximizing total benefits, or maximizing the benefits per unit travel time, subject to constraints on the travel path function. The specific problems analyzed involve a direct distance related benefit (or cost) function, employing rectilinear or squared-Euclidean distance measures, and they constrain the paths to be straight lines between parallel boundaries or across rectangular regions, with both ends free or with one end fixed, or to be general paths between fixed end-points. In each case, the problem is reduced to a finite dimensional optimization problem. Illustrative examples and computational results on a personal computer are provided, and several extensions are proposed for future research.
We study the structural and electrochemical performance of sulfur cathodes prepared with two diff... more We study the structural and electrochemical performance of sulfur cathodes prepared with two different binders, PVdF and SBR/CMC. Enhanced battery performance is observed in the SBR/CMC-based electrode and its origin is scrutinized.
As a systematic, scientific, computerized, and interdisciplinary approach to art therapy, an expe... more As a systematic, scientific, computerized, and interdisciplinary approach to art therapy, an expert system has been developed for the structured mandala, which is selected as an art therapy tool. This system can aid human experts in providing their client with the analysis and interpretation of the mandala. The client's personal preferences of color are obtained through a questionnaire. The system automatically analyzes and evaluates the color-related-elements in the mandalas, and deduces the client's performance-relatedelements in the colorings. A knowledge base has been constructed on the meanings of the colors that appear in drawings and structured mandala, the relations between the colors that appear in a mandala and the personal characteristics in the questionnaire, and the detection of changes of elements in a series of mandalas. The knowledge is expressed in a simple IF-THEN format and accumulated in the knowledge base. The system evokes the relevant knowledge corresponding to the analysis and evaluation of the elements in the mandala, and the answers to the questionnaire. The system operation and usability are illustrated through example cases.
In this paper, we deal with a new lot-sizing and scheduling problem (LSSP) that minimizes the sum... more In this paper, we deal with a new lot-sizing and scheduling problem (LSSP) that minimizes the sum of production cost, setup cost, and inventory cost. Incorporating the constraints of setup carry-over and overlapping as well as demand splitting, we develop a mixed integer ...
Uploads
Papers by Seong-in Kim