• Journal of the military operations research society of Korea
• /
• v.8 no.1
• /
• pp.53-70
• /
• 1982

This thesis develops a more realistic and applicable new set covering model that is adjusted and supplied by the existing set covering models, and induces an algorithm for solving the new set covering model, and applies the new model and the algorithm to an actual set covering problems. The new set covering model introduces a probabilistic covering aistance ($0{\eqslantless}p{\eqslantless}1$)or time($0{\eqslantless}p{\eqslantless}1$) instead of a deterministic covering distance(0 or 1) or time (0 or 1) of the existing set covering model. The existing set covering model has not considered the merit of the overcover of customers. But this new set covering model leads a concept of this overcover to a concept of the parallel system reliability. The algorithm has been programmed on the UNIVAC 9030 for solving large-scale covering problems. An application of the new set covering model is presented in order to determine the locations of the air surveillance radars as a set covering problem for a case-study.

• Korean Management Science Review
• /
• v.26 no.3
• /
• pp.1-9
• /
• 2009

In this paper, we present mathematical models for the ring covering problems arising in the design of multi-ring WDM networks. Also, we present efficient algorithms to solve the suggested models. By the computational experiment, our model can solve the medium-sized networks efficiently and shows better performance than the existing heuristic method. Although we propose an efficient method for the column generation procedure, branching rule that does not destroy the column generation structure is unsolved. Further research is required to develop an effective branching rule.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.10 no.1
• /
• pp.1-8
• /
• 1985

By introducing the concept of reliability of parallel systems the set covering. A branch-and-bound algorithm is developed and illustrated by a numerical example. The procedure has been coded and its computational efficiency is studied.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.116-119
• /
• 2005

As to the synthetical estimation of land covering parameters or the compounded land covering classification for multi-resolution satellite data, former researches mainly adopted linear or nonlinear regression models to describe the regression relationship of land covering parameters caused by the degradation of spatial resolution, in order to improve the retrieval accuracy of global land covering parameters based on 1;he lower resolution satellite data. However, these methods can't authentically represent the complementary characteristics of spatial resolutions among different satellite data at arithmetic level. To resolve the problem above, a new compounded land covering classification method at arithmetic level for multi-resolution satellite data is proposed in this .paper. Firstly, on the basis of unsupervised clustering analysis of the higher resolution satellite data, the likelihood distribution scatterplot of each cover type is obtained according to multiple-to-single spatial correspondence between the higher and lower resolution satellite data in some local test regions, then Parzen window approach is adopted to derive the real likelihood functions from the scatterplots, and finally the likelihood functions are extended from the local test regions to the full covering area of the lower resolution satellite data and the global covering area of the lower resolution satellite is classified under the maximum likelihood rule. Some experimental results indicate that this proposed compounded method can improve the classification accuracy of large-scale lower resolution satellite data with the support of some local-area higher resolution satellite data.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2007.11a
• /
• pp.316-321
• /
• 2007

The hierarchical covering location problem emphasizes the issue of locating of hierarchical facilities in order to maximize the number of customers that can be covered. In the classical HCLP(Hierarchical Covering Location Problem), it is assumed that the customers are covered completely if they are located within a specific distance from the facility, and not covered otherwise. The generalized HCLP is introduced that the coverage of customers is measured to be any real value rather than 0 or 1, where the service level may decrease according to the distance. Mixed integer programming formulation for the generalized HCLP is suggested with a partial coverage of service. Solutions are found using OPL Studio, and are evaluated for various cases.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.1
• /
• pp.43-50
• /
• 2013

This paper aims to determine the optimal location of expressway patrol vehicle stations that minimizes additional troubles caused by the delay of crash treatments. To do this, we formulate a maximum covering problem and a p-center problem weighted by crash frequency, using the shortest distance as the criteria for allocating service district, and we employ the Lagrangian relaxation algorithm to solve the former and Daskin's heuristic algorithm to solve the latter, respectively. Based on crash data of Korean expressways, the results from the proposed models are compared with the current location of patrol vehicle stations by using several indices as the level of service for crash treatment, such as maximum crash-weighted distance, average crash-weighted distance, and average access distance. The results show that the proposed models improve average access distance and time by about 10km and 10min, respectively. When allocation for service district is changed only with the fixed current location, the level of service can be also improved. The models and results proposed in this paper can contribute to improving the level of service for crash treatment on expressways. They can also provide the theoretical basis on the location decision for other various emergency facilities, and the allocation decision for floating service districts according to time-period crash data.

• Journal of the Korean Institute of Navigation
• /
• v.23 no.2
• /
• pp.11-22
• /
• 1999

This paper is concerned with the development of a tractable model to assist liner shipping companies in the decision-making of empty container repositioning and leasing. A hybrid methodology is presented which properly accounts for the specific characteristics of empty container management. For this mathematical models are developed based on dynamic network models, covering both land and marine segment. Then a stochastic method is presented to deal with the uncertainty of the future demand and supply. Especially, the concept of opportunity cost has been introduced in order to explain interactions between the variation of the future demand and supply and the stock level at each depot.

• Journal of Ship and Ocean Technology
• /
• v.10 no.1
• /
• pp.1-9
• /
• 2006

The resistance reduction by an air lubrication effect of a large air cavity covering the hull bottom surface and the similarity relations involved have been investigated with a series of towing tank tests of three geometrically similar models. The test results of geometrically similar models have indicated that a large air cavity was formed beneath the bottom having a backward-facing step by artificially supplying air is effective for resistance reduction. The areas of air cavity and the required flow rates of air are directly related to the effective wetted surface area. The traditional extrapolation methods seem to be applicable to the estimation of the resistance in the tested range if corrections are made to account the changes in the frictional resistance caused by the changes in the effective wetted surface area. To investigate the effectiveness of air lubrication in improving the resistance performance of a practical ship, a small test boat having a backward-facing step under its bottom has been manufactured and speed trials in a river have been performed. Air has been supplied artificially into the downstream region of the bottom step to form a large air cavity covering the bottom surface. The results have confirmed the practical applicability of air lubrication for the resistance reduction of a small high-speed boat.

• Journal of the military operations research society of Korea
• /
• v.8 no.2
• /
• pp.17-30
• /
• 1982

This paper offers an optimal artillery deployment scheme for the defending unit when two forces are confronted at a military front line. When proposed gun sites, types and number of guns as well as targets are given, the solutions of the two models in this paper direct each (unit of) guns to a certain location. The aim of the models is to maximize the number of guns which can hit important targets. Unlike widely used target assignment models, these models are formulated using the set covering problem concept. These models do not contain probabilities and time. Thus they are simple as models, easy in implementation, and yield tractable solutions. The dynamic and probabilistic feature of battle situations is implicitly reflected on the models. The first model is for the case that enemies' approaching route is clearly predictable, while the second model is for the unpredictable approaching route case.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.12
• /
• pp.1663-1669
• /
• 1995

This paper is a study on the recognition of Korean proverb using neural network and Markov model. The neural network uses, at the stage of training neurons, features such as the rate of zero crossing, short-term energy and PLP-Cepstrum, covering a time of 300ms long. Markov models were generated by the recognized phoneme strings. The recognition of words and proverbs using Markov models have been carried out. Experimental results show that phoneme and word recognition rates are 81. 2%, 94.0% respectively for Korean proverb recognition experiments.