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 22, Issue 4 - Dec 1997
Volume 22, Issue 3 - Sep 1997
Volume 22, Issue 2 - Jun 1997
Volume 22, Issue 1 - Mar 1997
Selecting the target year
) Algorithm for the Linear Knapsack Problem with SUB and Extended GUB Constraints
Journal of the Korean Operations Research and Management Science Society, volume 22, issue 3, 1997, Pages 1~9
We present an extension of the well-known generalized upper bound (GUB) constraint and consider a linear knapsack problem with both the extended GUB constraints and the simple upper bound (SUB) constraints. An efficient algorithm of order O(
) is developed by exploiting structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.
A Concave Function Minimization Algorithm Under 0-1 Knapsack Constraint using Strong Valid Inequalities
Journal of the Korean Operations Research and Management Science Society, volume 22, issue 3, 1997, Pages 11~22
The aim of this paper is to develop the B & B type algorithms for globally minimizing concave function under 0-1 knapsack constraint. The linear convex envelope underestimating the concave object function is introduced for the bounding operations which locate the vertices of the solution set. And the simplex containing the solution set is sequentially partitioned into the subsimplices over which the convex envelopes are calculated in the candidate problems. The adoption of cutting plane method enhances the efficiency of the algorithm. These mean valid inequalities with respect to the integer solution which eliminate the nonintegral points before the bounding operation. The implementations are effectively concretized in connection with the branching stategys.
Development of Clustering Algorithm for the Design of Telecommunication Network Considering Cost-Traffic Tradeoff
Journal of the Korean Operations Research and Management Science Society, volume 22, issue 3, 1997, Pages 23~36
In the design of telecommunication network, the network configuration using hubbing topology is useful for designing and managing the network efficiently : i. e. all of central offices (COs) are grouped into clusters. Each cluster has one hub consisting of large-scale transmission facilities like digital cross-connect systems and ATMs. In clustering process, the community of interest and geographical factor should be considered. However, there exists a tradeoff between two factors. One is to minimize total link costs for geographical factor and the other is to maximize the total intra-cluster traffics for community of interest. Hence, this can be solved by multiobjective linear programming techniques. In this paper, the problem under considerations is formulated as two p-median subproblems taking into considerations total costs and total intra-traffics, respectively. Then we propose the algorithm to solve the problem based on the concept of cost-traffic tradeoff. The algorithm enables to identify efficient cost-traffic tradeoff pairs. An illustration is also presented.
An Al Approach with Tabu Search to solve Multi-level Knapsack Problems:Using Cycle Detection, Short-term and Long-term Memory
Ko, Il-Sang ;
Journal of the Korean Operations Research and Management Science Society, volume 22, issue 3, 1997, Pages 37~58
An AI approach with tabu search is designed to solve multi-level knapsack problems. The approach performs intelligent actions with memories of historic data and learning effect. These action are developed ont only by observing the attributes of the optimal solution, the solution space, and its corresponding path to the optimal, but also by applying human intelligence, experience, and intuition with respect to the search strategies. The approach intensifies, or diversifies the search process appropriately in time and space. In order to create a good neighborhood structure, this approach uses two powerful choice rules that emphasize the impact of candidate variables on the current solution with respect to their profit contribution. "Pseudo moves", similar to "aspirations", support these choice rules during the evaluation process. For the purpose of visiting as many relevant points as possible, strategic oscillation between feasible and infeasible solutions around the boundary is applied. To avoid redundant moves, short-term (tabu-lists), intemediate-term (cycle-detection), and long-term (recording frequency and significant solutions for diversfication) memories are used. Test results show that among the 45 generated problems (these problems pose significant or insurmountable challenges to exact methods) the approach produces the optimal solutions in 39 cases.lutions in 39 cases.
Design of Survivable Communication Networks with High-connectivity Constraints
Koh, Seok J. ; Lee, Chae Y. ;
Journal of the Korean Operations Research and Management Science Society, volume 22, issue 3, 1997, Pages 59~80
Designing highly survivable interoffice telecommunication networks is considered. The problem is formulated as a minimum-cost network design problem with three node connectivity constraints. These valid and facet-defining inequalities for the convex hull of the solution are presented. A branch and cut algorithm is proposed based on the inequalities to obtain the optimal solution. With the lower bound by the cutting plane algorithm, a delete-ink heuristic is proposed to otain a good upper bound in the branch and bound procedure. The effeciveness of the branch and cut algorithm is demonstrated with computational results for a variety of problem sets : different lower bounds, two types of link costs and large number of links. The cutting plane procedure based on the three inequalities provides excellent lower bounds to the optimal solutions.
A Branch and Bound Algorithm for Solving a Capacitated Subtree of Tree Problem in Local Access Telecommunication Networks
Cho, Geon ; Kim, Seong-Lyun ;
Journal of the Korean Operations Research and Management Science Society, volume 22, issue 3, 1997, Pages 81~98
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
) 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.
Analysis of a Production Systems with Early Set-up and Post-operation
;;;Kim, S. C.;Yoon, S. H.;Park, N. I.;
Journal of the Korean Operations Research and Management Science Society, volume 22, issue 3, 1997, Pages 99~111
We consider a production system with post-operation and early set-up. As soon as there are no more units(raw materials) to process and the machine becomes idle, it undergoes a post-operation. After the post operation, if the number of waiting units is greater than or equal to m, it begins a set-up. After the set-up, if the number of units is greater than or equal to N(
m), it begins to process the units. We first analyze the system by employing the decomposition property of the vacation queue. We, then, propose an algorithm that finds the optimal threshold values (
). Finally we present some numerical examples and interprete the system behavior.
On the Bayesian Fecision Making Model of 2-Person Coordination Game
Journal of the Korean Operations Research and Management Science Society, volume 22, issue 3, 1997, Pages 113~143
Most of the conflict problems between 2 persons can be represented as a bi-matrix game, because player's utilities, in general, are non-zero sum and change according to the progress of game. In the bi-matrix game the equilibrium point set which satisfies the Pareto optimality can be a good bargaining or coordination solution. Under the condition of incomplete information about the risk attitudes of the players, the bargaining or coordination solution depends on additional elements, namely, the players' methods of making inferences when they reach a node in the extensive form of the game that is off the equilibrium path. So the investigation about the players' inference type and its effects on the solution is essential. In addition to that, the effect of an individual's aversion to risk on various solutions in conflict problems, as expressed in his (her) utility function, must be considered. Those kinds of incomplete information make decision maker Bayesian, since it is often impossible to get correct information for building a decision making model. In Baysian point of view, this paper represents an analytic frame for guessing and learning opponent's attitude to risk for getting better reward. As an example for that analytic frame. 2 persons'bi-matrix game is considered. This example explains that a bi-matrix game can be transformed into a kind of matrix game through the players' implicitly cooperative attitude and the need of arbitration.
Packet Delay Analysis in the DQDB Network with a Saturated Station
Noh, Seung J. ;
Journal of the Korean Operations Research and Management Science Society, volume 22, issue 3, 1997, Pages 145~162
This paper an analytical model for estimating packet waiting times at stations in the DQDB network, where the most upstream station is saturated. This model is useful in comparing the extreme unfairness which downstream stations experience due to their geographical locations in accessing the medium. Each station is modeled as an M/G/1, where the service time is defined to be the time a packet spends in the transmission buffer. The service time is decomposed into five components, and in turn, the first and second moment of each component are derived in three different modes of operation. Simulation experiments are presented for model validation and results are discussed.
The Hybrid Systems for Credit Rating
Goo, Han-In ; Jo, Hong-Kyuo ; Shin, Kyung-Shik ;
Journal of the Korean Operations Research and Management Science Society, volume 22, issue 3, 1997, Pages 163~173
Although numerous studies demonstrate that one technique outperforms the others for a given data set, it is hard to tell a priori which of these techniques will be the most effective to solve a specific problem. It has been suggested that the better approach to classification problem might be to integrate several different forecasting techniques by combining their results. The issues of interest are how to integrate different modeling techniques to increase the predictive performance. This paper proposes the post-model integration method, which tries to find the best combination of the results provided by individual techniques. To get the optimal or near optimal combination of different prediction techniques, Genetic Algorithms (GAs) are applied, which are particularly suitable for multi-parameter optimization problems with an object function subject to numerous hard and soft constraints. This study applies three individual classification techniques (Discriminant analysis, Logit model and Neural Networks) as base models for the corporate failure prediction. The results of composite predictions are compared with the individual models. Preliminary results suggests that the use of integrated methods improve the performance of business classification.
Process Redesign Through Dynamic Modeling
Journal of the Korean Operations Research and Management Science Society, volume 22, issue 3, 1997, Pages 175~190
Organizational change projects such as Business Process Redisign (BPR) have been perceived to incur high risk due to their high management complexity, enterprise-wide impace, and steep project cost. This research intends to reduce such risk by developing a systematic process redesign methods, called Dynamic Process Modeling (DPM) method. DPM integrates the customer-oriented business process modeling technique with computerized visual simulation technique to promote better understanding of the target process and enable performance simulation of the proposed redesign alternatives prior to actual BPR implementations. For the cusstomer-oriented process modeling, we propose Dynamic-Event Process Chain (Dynamic-EPC) extending from the conceptual customer process model, Event-Process Chain (EPC). We compare DPM with four other implementation-level process modeling methods over eight criteria and demonstrate its effectiveness by applying it to the real-world hospital BPR case.
Factors Affecting the Computer Self-Efficacy
Journal of the Korean Operations Research and Management Science Society, volume 22, issue 3, 1997, Pages 191~208
Recently, self-efficacy is one of the critical constructs that have been found to influence human decisions about behavior selection and the performance associated with the selected behavior. The construct has been widely adaopted and tested in the fields of social psychology and/or other behavioral sciences. In information system field, however, it has been hardly studied, although computer self-efficiency could have been an important factor explaining and predicting human computer usage behaviors. From this perspective, main proposes of the study are : (1) to develop a measure of computer self-efficacy, 2) to identify the factors influencing self-efficacy, and 3) to reveal the relationship between self-efficacy and computer usage behavior. By reviewing the literature, past experience, others'use, encouragement by others, and anxiety are selected as the factors influencing computer self-efficacy. Four hypotheses concerning the relationship between each of the variables and computer self-efficacy are tested by LISREL. One more hypothesis about the relationship between computer self-efficacy and computer usage is also tested. The results show that computer self-efficacy is significantly influenced by computer ansiety, encouragement by others, and computer experience, and that it is closely correlated with computer usage behavior.
The Advantageous Bargaining Sequence in Sequential Bargaining with Multiple Parties
Journal of the Korean Operations Research and Management Science Society, volume 22, issue 3, 1997, Pages 209~222
In this paper, we study a bargaining order problem where one buyer sequentially bargains with two sellers whose reservation prices are unknown to the buyer but correlated. Our main question is who the buyer should bargain first with to maximize his expected payoff. This type of problem is widely applicable to business and political situations where one party negotiates with multiple parties sequentially. One of the most important element in a sequential bargaining is "linkage effect" which exists when the aggreement of the previous bargaining affects the outcome of the following bargaining. To examine "linkage effect", we assume that the sellers'objects are similar so that the sellers' reservation prices are correlated. In addition, to consider incomplete information aspect regarding reservation prices, it is assumed that the sellers' reservation prices are unknown to the buyer. That is, we deal with one sided incomplete information case. In our model, there are two stages in each of which the buyer meets one seller. Since we are concerned with the bargaining order, we consider two different bargaining orders. Using game theory, we find a perfect Bayesian equilibrium and compute the buyer's expected payoff for each bargaining order. Finally we identify the advantageous bargaining order for the buyer by comparing the expected payoffs obtained under two different bargaining orders. Our results are as follows: the advantageous bargaining order depends on the prior probability of the seller type. However, in general, the buyer should bargain first with the seller whose object is less valuable to the buyer. The basic reason for our result is that the buyer wants to experiment in the first stage to find out the sellers' reservation prices and in doing so, to minimize the experimental cost and maximize potential gain in case of negotiation failure in the first stage. in the first stage.