Go to the main menu
Skip to content
Go to bottom
REFERENCE LINKING PLATFORM OF KOREA S&T JOURNALS
> Journal Vol & Issue
Journal of the Korean Operations Research and Management Science Society
Journal Basic Information
Journal DOI :
The Korean Operations and Management Science Society
Editor in Chief :
Volume & Issues
Volume 33, Issue 4 - Dec 2008
Volume 33, Issue 3 - Sep 2008
Volume 33, Issue 2 - Jun 2008
Volume 33, Issue 1 - Mar 2008
Selecting the target year
A GA-based Binary Classification Method for Bankruptcy Prediction
Min, Jae-H. ; Jeong, Chul-Woo ;
Journal of the Korean Operations Research and Management Science Society, volume 33, issue 2, 2008, Pages 1~16
The purpose of this paper is to propose a new binary classification method for predicting corporate failure based on genetic algorithm, and to validate its prediction power through empirical analysis. Establishing virtual companies representing bankrupt companies and non-bankrupt ones respectively, the proposed method measures the similarity between the virtual companies and the subject for prediction, and classifies the subject into either bankrupt or non-bankrupt one. The values of the classification variables of the virtual companies and the weights of the variables are determined by the proper model to maximize the hit ratio of training data set using genetic algorithm. In order to test the validity of the proposed method, we compare its prediction accuracy with ones of other existing methods such as multi-discriminant analysis, logistic regression, decision tree, and artificial neural network, and it is shown that the binary classification method we propose in this paper can serve as a premising alternative to the existing methods for bankruptcy prediction.
Cost Relaxation Using an Arc Set Likely to Construct an Optimal Solution for the Asymmetric Traveling Salesman Problem
Kwon, Sang-Ho ; SaGong, Seon-Hwa ; Kang, Maing-Kyu ;
Journal of the Korean Operations Research and Management Science Society, volume 33, issue 2, 2008, Pages 17~26
The traveling salesman problem is to find tours through all cities at minimum cost ; simply visiting the cities only once that a salesman wants to visit. As such, the traveling salesman problem is a NP-complete problem ; an heuristic algorithm is preferred to an exact algorithm. In this paper, we suggest an effective cost relaxation using a candidate arc set which is obtained from a regression function for the traveling salesman problem. The proposed method sufficiently consider the characteristics of cost of arcs compared to existing methods that randomly choose the arcs for relaxation. For test beds, we used 31 instances over 100 cities existing from TSPLIB and randomly generated 100 instances from well-known instance generators. For almost every instances, the proposed method has found efficiently better solutions than the existing method.
A Case-Based Reasoning Approach to Ontology Inference Engine Selection for Robust Context-Aware Services
Shim, Jae-Moon ; Kwon, Oh-Byung ;
Journal of the Korean Operations Research and Management Science Society, volume 33, issue 2, 2008, Pages 27~44
Owl-based ontology is useful to realize the context-aware services which are composed of the distributed and self-configuring modules. Many ontology-based inference engines are developed to infer useful information from ontology. Since these engines show the uniqueness in terms of speed and information richness, it's difficult to ensure stable operation in providing dynamic context-aware services, especially when they should deal with the complex and big-size ontology. To provide a best inference service, the purpose of this paper is to propose a novel methodology of context-aware engine selection in a contextually prompt manner Case-based reasoning is applied to identify the causality between context and inference engined to be selected. Finally, a series of experiments is performed with a novel evaluation methodology to what extent the methodology works better than competitive methods on an actual context-aware service.
A Study on the Evaluation of Multi-dimensional ASP Service Quality and Its Effects on User Satisfaction and Perceived Firm Performance
Kim, Sung-Hong ; Kim, Jin-Han ; Kim, Kil-Sun ;
Journal of the Korean Operations Research and Management Science Society, volume 33, issue 2, 2008, Pages 45~73
Quality has long been considered as an important factor in creating competitive advantage, and researches on quality have not been limited to off-line products but actively extended to e-services and information goods. However, given the nature of multi-dimensional aspect of quality, the systematic study on the quality of online service is still in its early stage. Especially, studies on the quality of ASP services have been rare in academic and professional journals despite the growth of ASP industry in its size and the rapid expansion in the range of application. In this paper we clarified the multi-dimensional quality aspects of the ASP service using a Garvin's framework (1984) which encompasses the service aspects of Products, and developed a measurement model for ASP service qualify. Then we empirically tested the effects of ASP service quality on user satisfaction and perceived firm performance using the data from 240 Korean small firms with less than 50 employees that had experienced the ASP service. Our results show that there are positive relationships among ASP service quality and personal performance, user satisfaction and perceived firm performance, and that product and service-related aspects of ASP service exert differential effects on performance measures so that the product-related aspects of the ASP service such as performance, features, reliability and conformance are considered to be more important in evaluating benefits from ASP services. Contrary to the approaches In literature where only the quality of online services is evaluated, our results emphasize the importance of differentiating Product and service-related aspects of ASP service and provide a basis for more comprehensive evaluation of ASP service quality.
Export Container Remarshaling Planning in Automated Container Terminals Considering Time Value
Bae, Jong-Wook ; Park, Young-Man ; Kim, Kap-Hwan ;
Journal of the Korean Operations Research and Management Science Society, volume 33, issue 2, 2008, Pages 75~86
A remarshalling is one of the operational strategies considered importantly at a port container terminal for the fast ship operations and heighten efficiency of slacking yard. The remarshalling rearranges the containers scattered at a yard block in order to reduce the transfer time and the rehandling time of container handling equipments. This Paper deals with the rearrangement problem, which decides to where containers are transported considering time value of each operations. We propose the mixed integer programming model minimizing the weighted total operation cost. This model is a NP-hard problem. Therefore we develope the heuristic algorithm for rearrangement problem to real world adaption. We compare the heuristic algorithm with the optimum model in terms of the computation times and total cost. For the sensitivity analysis of configuration of storage and cost weight, a variety of scenarios are experimented.
Scheduling Orders for Minimizing Total Weighted Tardiness
Lee, Ik-Sun ; Yoon, Sang-Hum ;
Journal of the Korean Operations Research and Management Science Society, volume 33, issue 2, 2008, Pages 87~101
This paper considers an order scheduling model to minimize the total weighted tardiness of orders. Each order requires different types of products. Each type of product is manufactured on its dedicated machine specified in advance. The completion time of each order is represented by the time when all the products belonging to the order are completed. The objective of this paper is to find the optimal production schedule minimizing the total weighted tardiness of a finite number of orders. In the problem analysis, we first derive a powerful solution property to determine the sequence of two consecutive orders. Moreover, two lower bounds of objective are derived and tested along with the derived property within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed property, branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.
Maximization of Path Reliabilities in Overlay Multicast Trees for Realtime Internet Service
Lee, Jung-H. ; Lee, Chae-Y. ;
Journal of the Korean Operations Research and Management Science Society, volume 33, issue 2, 2008, Pages 103~114
Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like Internet broadcasting are provided by the overlay multicast technology due to the complex nature and high cost of IP multicast. To reduce frequent updates of multicast members and to support real time service without delay, we suggest a reliable overlay multicast tree based on members' sojourn probabilities. Path reliabilities from a source to member nodes are considered to maximize the reliability of an overlay multicast tree. The problem is formulated as a binary integer programming with degree and delay bounds. A tabu search heuristic is developed to solve the NP-complete problem. Outstanding results are obtained which is comparable to the optimal solution and applicable in real time.
Asymptotic Analysis on Service Differentiation with Customer Arrival Information
Choi, Ki-Seok ;
Journal of the Korean Operations Research and Management Science Society, volume 33, issue 2, 2008, Pages 115~135
An interesting problem in capacitated supply chains is how to guarantee customer service levels with limited resources. One of the common approaches to solve the problem is differentiating service depending on customer classes. High-priority customers receive a better service at the cost of low-priority customers' service level. One of common criteria to determine a customer's priority in practice is whether he has made a reservation before arrival or not. Customers with a reservation usually receive service based on the time the reservation was made. We examine the effect this advance information of customer arrival has on customer service levels. We show the trade-offs between the leadtime and other system characteristics such as the proportion of high-priority customers. when the service level is high. We also suggest how to differentiate service using the asymptotic ratio of the service levels for both types of customers.
A Discount Policy for Perishable Items Sold from Two Shops
Lee, Ga-Ram ; Oh, Yong-Hui ; Hwang, Hark ;
Journal of the Korean Operations Research and Management Science Society, volume 33, issue 2, 2008, Pages 137~151
This paper deals with two shops dealing with single perishable product the fresh items are sold at a list price in the primary shop and the unsold items that have reached a certain allowed age are transferred to the secondary shop to be sold at a discounted price. It is assumed that the demand rates in two shops are Independent each other and can be expressed as a function of inventory level and price. With the objective of maximizing the profit under a Last-In-first-Out. (LIFO) issuing policy, we develop mathematical models for the following two cases : (1) opening primary shop only and (2) opening both primary shop and secondary shop. There are three decision variables, i.e., the reduced price in the secondary shop, the allowed age at the primary shop, and the order quantities at the primary shop. A solution procedure is developed based on tabu search and its validity is illustrated through a comparative study.
A Review on the Theories of Development Structure based on Data-Oriented Model
Park, Joon-Ho ; Kwon, Cheol-Shin ;
Journal of the Korean Operations Research and Management Science Society, volume 33, issue 2, 2008, Pages 153~174
There have been two streams of the studies on development structure : conceptual model approach and statistical analysis approach. But In these days, the latter has been becoming the main approach owing to the development of multivariate statistical methods and statistical packages. In this study, we examine methodologies and results of the leading researches related to development structure based on statistical analysis and propose the future research directions. This analysis would be expected to contribute toward the construction of long-range development policies on each country.
Research on the Effects of Corporate Social Responsibility : Corporate Image and Purchase Intention Perspective
Lee, Jang-Hyuk ; Lee, Seung-Min ; Kim, Sang-Yong ; Woo, Won-Seok ;
Journal of the Korean Operations Research and Management Science Society, volume 33, issue 2, 2008, Pages 175~183
The rising importance of sustainable development led major corporations to pay attention to customer communication with regard to corporate social responsibility (CSR). This research shed light on the impact of CSR related actions. Our findings show that their effect on corporate image and purchase intention strengthens as they are closely related to the corporation's business area. As well, the purchase intention effect is found to be higher in case of high involvement products than that in case of low involvement ones.