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 23, Issue 4 - Dec 1998
Volume 23, Issue 3 - Sep 1998
Volume 23, Issue 2 - Jun 1998
Volume 23, Issue 1 - Mar 1998
Selecting the target year
An Algorithm on Three-Dimensional Loading Problem
Journal of the Korean Operations Research and Management Science Society, volume 23, issue 2, 1998, Pages 1~13
The purpose of this paper is to formulate the three-dimensional loading problem and to develop an exact algorithm. The three-dimensional loading problem is not only to load as many boxes as possible, but also to ensure load stability. In this Paper, we propose formulation by zero-one integer programming. Further we propose as an algorithm the branch-and-bound enforced by efficient bounding criteria. As an upper bound, we use the solution of the Lagrangean relaxation problem which relaxes constraints of zero-one IP, and as a lower bound, we use a heuristic solution induced by the solution of the Lagrangean relaxation problem. Last, we show computational experiments on convergency of upper and lower bounds.
A Scheduling Method on Parallel Computation Models with Limited Number of Processors Using Genetic Algorithms
Journal of the Korean Operations Research and Management Science Society, volume 23, issue 2, 1998, Pages 15~27
In the parallel processing systems, a compiler partitions a loaded program into tasks, allocates the tasks on multiple processors and schedules the tasks on each allocated processor. In this paper we suggest a Genetic Algorithm(GA) based scheduling method to find an optimal allocation and sequence of tasks on each Processor. The suggested method uses a chromosome which consists of task sequence and binary string that represent the number and order of tasks on each processor respectively. Two correction algorithms are used to maintain precedency constraints of the tasks in the chromosome. This scheduling method determines the optimal number of processors within limited numbers, and then finds the optimal schedule for each processor. A result from computational experiment of the suggested method is given.
A Decomposition Algorithm for a Local Access Telecommunication Network Design Problem
Cho, Geon ;
Journal of the Korean Operations Research and Management Science Society, volume 23, issue 2, 1998, Pages 29~46
In this paper, we develop detailed algorithms for implementing the so-called Limited Column Generation procedure for Local Access Telecommunication Network(LATN) design problem. We formulate the problem into a tree-partitioning problem with an exponential number of variables. Its linear programming relaxation has all integral vertices, and can be solved by the Limited Column Generation procedure in just n pivots, where n is the number of nodes in the network. Prior to each pivot. an entering variable is selected by detecting the Locally Most Violated(LMV) reduced cost, which can be obtained by solving a subproblem in pseudo-polynomial time. A critical step in the Limited Column Generation is to find all the LMV reduced costs. As dual variables are updated at each pivot, the reduced costs have to be computed in an on-line fashion. An efficient implementation is developed to execute such a task so that the LATN design problem can be solved in O(n
H), where H is the maximum concentrator capacity. Our computational experiments indicate that our algorithm delivers an outstanding performance. For instance, the LATN design problem with n＝150 and H＝1000 can be solved in approximately 67 seconds on a SUN SPARC 1000 workstation.
A Lagrangian Relaxation Approach to Capacity Planning for a Manufacturing System with Flexible and Dedicated Machines
Lim, Seung-Kil ; Kim, Yeong-Dae ;
Journal of the Korean Operations Research and Management Science Society, volume 23, issue 2, 1998, Pages 47~65
We consider a multiperiod capacity planning problem for determining a mix of flexible and dedicated capacities under budget restriction. These capacities are controlled by purchasing flexible machines and/or new dedicated machines and disposing old dedicated machines. Acquisition and replacement schedules are determined and operations are assigned to the flexible or dedicated machines for the objective of minimizing the sum of discounted costs of acquisition and operation of flexible machines, new dedicated machines, and old dedicated machines. In this research, the Problem is formulated as a mixed integer linear Program and solved by a Lagrangian relaxation approach. A subgradient optimization method is employed to obtain lower bounds and a multiplier adjustment method is devised to improve the bounds. We develop a linear programming based Lagrangian heuristic algorithm to find a good feasible solution of the original problem. Results of tests on randomly generated test problems show that the algorithm gives relatively good solutions in a reasonable amount of computation time.
A Performance Comparison between Operation Strategies for Idle Vehicles in Automated Guided Vehicle System
Kim, Kap-Hwan ; Kim, Jae-Yeon ;
Journal of the Korean Operations Research and Management Science Society, volume 23, issue 2, 1998, Pages 67~81
An Automated Guided Vehicle System (AGVS) with a unidirectional loop guide path is modeled as a discrete-time stationary Markov chain. It is discussed how to estimate the mean response time, the utilization, and the cycle time of AGV for a delivery order. Three common operation strategies for idle vehicles - central zone positioning rule, circulatory loop positioning rule and point of release positioning rule - are analyzed. These different operation strategies are compared with each other based on the performance measures.
A Branch-and-Bound Algorithm for U-line Line Balancing
Journal of the Korean Operations Research and Management Science Society, volume 23, issue 2, 1998, Pages 83~101
Assembly U-lines are increasingly accepted in industry, especially just-in-time production systems, for the efficient utilization of workforce. In this paper, we present an integer programming formulation and a branch-and-bound method for balancing the U-line with the objective of minimizing the number of workstations with a fixed cycle time. In the mathematical model, we provide the method that can reduce the number of variables and constraints. The proposed branch-and-bound method searches the optimal solution based on a depth-first-search. To efficiently search for the optimal solutions to the problems, an assignment rule is used in the method. Bounding strategies and dominance rules are also utilized. Some problems require a large amount of computation time to find the optimal solutions. For this reason. some heuristic fathoming rules are also proposed. Extensive experiments with test-bed problems in the literature are carried out to show the performance of the proposed method. The computational results show that our method is promising in solution quality.
A Multilevel Model Integration for Collaborative Decision Making
Journal of the Korean Operations Research and Management Science Society, volume 23, issue 2, 1998, Pages 103~129
Corporate level decision making with multiple decision makers in a consistent way is essential in Decision Support System. However, since the decision makers have different interests and knowledge, the models used by them are also different in their level of abstraction. This makes decision makers waste a lot of efforts for an integrated decision making. The purpose of this paper is to propose an integration mechanism so that collaborative decision making models may be used synthetically in multi-abstraction level. Models are classified as multimedia model, mathematical model, qualitative model, causal ＆ directional model, causal model, directional model and relationship model according to the level of abstraction. The proposed integration mechanism consists of model interpretation phase. model transformation phase, and model integration phase. Specifically, the model transformation Phase is divided into (1) model tightening mode which gather information to make a model transformed into upper level model, and (2) model relaxing mode which makes lower level model. In the model integration phase, models of same level are to be integrated schematically. An illustrative M＆A-decision example is given to show the possibility of the methodology.
Management of Knowledge Abstraction Hierarchy
Journal of the Korean Operations Research and Management Science Society, volume 23, issue 2, 1998, Pages 131~156
Cooperative query answering is a research effort to develop a fault-tolerant and intelligent database system using the semantic knowledge base constructed from the underlying database. Such knowledge base has two aspects of usage. One is supporting the cooperative query answering Process for providing both an exact answer and neighborhood information relevant to a query. The other is supporting ongoing maintenance of the knowledge base for accommodating the changes in the knowledge content and database usage purpose. Existing studies have mostly focused on the cooperative query answering process but paid little attention on the dynamic knowledge base maintenance. This paper proposes a multi-level knowledge representation framework called Knowledge Abstraction Hierarchy (KAH) that can not only support cooperative query answering but also permit dynamic knowledge maintenance. The KAH consists of two types of knowledge abstraction hierarchies. The value abstraction hierarchy is constructed by abstract values that are hierarchically derived from specific data values in the underlying database on the basis of generalization and specialization relationships. The domain abstraction hierarchy is built on the various domains of the data values and incorporates the classification relationship between super-domains and sub-domains. On the basis of the KAH, a knowledge abstraction database is constructed on the relational data model and accommodates diverse knowledge maintenance needs and flexibly facilitates cooperative query answering. In terms of the knowledge maintenance, database operations are discussed for the cases where either the internal contents for a given KAH change or the structures of the KAH itself change. In terms of cooperative query answering, database operations are discussed for both the generalization and specialization Processes, and the conceptual query handling. A prototype system has been implemented at KAIST that demonstrates the usefulness of KAH in ordinary database application systems.
Multi-facetted Approach to Mathematical Model Representation and Management
Journal of the Korean Operations Research and Management Science Society, volume 23, issue 2, 1998, Pages 157~185
One of the essential issues in model systems is how to represent and manipulate mathematical modeling knowledge. As the bases of integrated modeling environments, current modeling frameworks have limitations: lack of facility to coordinate different users perpectives and lack of mechanism to reuse modeling knowledge. In this paper, multi-facetted modeling approach is proposed as a basis for the development of integrated modeling environment which provides facilities for (1) independent management of modeling knowledge from individual models； (2) object-oriented conceptual blackboard concept； (3) multi-facetted modeling； and (4) declarative representation of mathematical knowledge. The proposed multi-facetted approach is illustrated using multicommodity transportation models.
Knowledge-based Approach for Solving Short-term Power Scheduling in Extended Power Systems
Journal of the Korean Operations Research and Management Science Society, volume 23, issue 2, 1998, Pages 187~200
This paper presents an original approach for solving short-term power scheduling in extended power system with two fuels in a unit and a limited fuel using Lagrangian relaxations. The underlying model incorporates the full set of costs and constraints including setup, production, ramping, and operational status, and takes the form of a mixed integer nonlinear control problem. Moreover, the mathematical model developed includes two fuels in a unit and a limited fuel, regulation reserve requirements of prespecified group of units. Lagrangian relaxation is used to disaggregate the model by generator into separate subproblems which are then solved with a nested dynamic program including empirical knowledges. The strength of the methodology lies partially in its ability to construct good feasible solutions from information provided by the dual. Thus, the need for branch-and-bound is eliminated. In addition, the inclusion of two fuels in a unit and a limited fuel provides new insight into the limitations of current techniques. Computational experience with the proposed algorithm indicates that Problems containing up to 23 units including 8 unit used two fuels and 24 time periods can be readily solved in reasonable times. Duality gaps of less than 4％ were achieved.
A Study on the Efficiency of Property-Liability Insurance Companies using DEA
Journal of the Korean Operations Research and Management Science Society, volume 23, issue 2, 1998, Pages 201~217
This paper attempts to show how DEA(data envelopment analysis), a nonparametric productivity analysis method, can be employed for insurance companies to improve their respective efficiencies and competitiveness. Specifically, we measured relative technical efficiencies and returns to scale of 11 Korean property-liability insurance companies using BCC model, and raised several issues including the cause of inefficiency, benchmarking toward reference set and resource allocation concerning the insurance companies. Also, in order to monitor the variability of the research results over periods, we employed longitudinal analysis to see the moving patterns of technical efficiencies, returns to scale and frequencies included in the reference set of the individual insurance companies under consideration. The methodology and the results in this paper may also serve as a useful guideline for individual insurance companies to set their respective business strategies.