• Journal of the Korean Operations Research and Management Science Society
• /
• v.5 no.1
• /
• pp.39-51
• /
• 1980

This paper deals with the problem of determining the capacity expansion timing and sizes of conduits and feeder cables for a given cable network configuration of a single exchange ares, which minimizes the present worth of total costs. The planning horizon is infinite and the demand of line pairs at each cabinet is assumed to be determininstically growing. As a solution method, the heuristic branch-and-bound algorithm of Freidenfelds and Mclaughlin is elaborated by adding details and some minor modifications, which generates a good near-optimal solution with far less computation than would otherwise be possible. We also develop a computer program, which is shown to be effective and efficient through the test run of an illustrative example.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.13 no.1
• /
• pp.13-13
• /
• 1988

This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

• Journal of the military operations research society of Korea
• /
• v.28 no.2
• /
• pp.20-33
• /
• 2002

This paper deals with assigning defensive counter air aircraft to the moving target in the air. Recently various kinds of allocation problems have been researched for fixed targets using offensive aircrafts. However, the counter air allocation problems for attacking aircrafts with considering the time and the threat have not been studied much. The main objective of this study is to mininize the time to intercept and the threat values simultaneously by using goal programming. The optimal solution by using an integer goal programming and a branch and bound algorithm is found and analyzed. By applying this model to real situation, we expect to reduce the time and number of sorties for destroying enemy aircraft, respectively.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.9
• /
• pp.101-110
• /
• 1998

In process planning for 3D pocket machining, the critical issues for the optimal process planning are the generation of cutting layers and the tool selection for each cutting layers as well as the other factors such as the determination of machining types, tool path, etc. This paper describes the optimal tool selection on a single cutting layer for 2D pocket machining, the generation of cutting layers for 3D pocket machining, the determination of the thickness of each cutting layers, the determination of the tool combinations for each cutting layers and also the development of an algorithm for determining the machining sequence which reduces the number of tool exchanges, which are based on the backward approach. The branch and bound method is applied to select the optimal tools for each cutting layer, and an algorithmic procedure is developed to determine the machining sequence consisting of the pairs of the cutting layers and cutting tools to be used in the same operation.

• Journal of Fisheries and Marine Sciences Education
• /
• v.26 no.2
• /
• pp.444-454
• /
• 2014

The range of optimization problem in aquaculture is very wide, resulting from the range of species, mode of operation. Quite a few studies focus marine net-cages, but studies on land based culture farm are few or no. This paper considers a allocation problem to meet production planning in land based aquaculture system. A water pool allocation model in land based aquaculture system was developed. The solution finds the value of decision variable to minimize yearly production costs that sums up the water pool usage cost and sorting cost. The model inputs were (1) the fish growth rate (2) critical standing corp (3) number of water pool (4) number of fish. The model outputs were (5) number of water pool in growing phase (6) cost of cultivation (6) optimal facility allocation(number of water pool for each growing phase). To solve the problem, an efficient heuristic algorithm based on a greedy manner is developed. Branch and bound and heuristic is evaluated through numerical examples.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.2
• /
• pp.17-31
• /
• 1990

This problem analyzed in this paper is to specify a schedule for thesis committee allowing maximum committee members' preference over thesis topics and meeting time-slots while satisfying other related scheduling requirements such as prohibiting simultaneous assignment of a committee member to more than one committee at a time. Two mathematical programming applroaches are presented to solve the thesis committee scheduling problem in a professional graduate school. They include LP-based branch-and-bound approach with network subproblems. Characterization of the problem is analyzed to develop an efficient solution algorithm. Implementation and computational experiments are also performed for real size problems on an IBM PC/AT to show the relative performance of the propsoed approaches along with an ordinary ILP solution approach.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.14 no.1
• /
• pp.16-26
• /
• 1989

The terminal layout problem is fundamental in may centralized computer networks, which is generated formulated as the capaciated minimum spanning tree problem (CMSTP). We present an implementation of the dual-based procedure to solve the CMSTP. Dual ascent procedure generates a good feasible solutions to the dual of the linear programming relaxation of CMSTP. A feasible primal solution to CMSTP can then be constructed based on this dual solution. This procedure can be used either as a stand-alone heuristic or, else, it can be incorporated into a branch and bound algorithm. A numerical result is given with quite favorable results.

• Journal of Korean Society for Quality Management
• /
• v.18 no.2
• /
• pp.93-99
• /
• 1990

This paper considers the selection of process plans for a flexible manufacturing machine. Most of the planning models for the automated manufacturing systems are based on the assumption that for each part there is only one process plan available. This paper considers that for each part a number of different process plans are available, each of which may require specific types of tools. If the requisite tools are not on the machine, one or more tool switches must occur before the process plan can be processed. This paper develops an optimal algorithm of branch and bound method for the selection of process plans to minimize the number of tool switches.

• Management Science and Financial Engineering
• /
• v.19 no.2
• /
• pp.19-29
• /
• 2013

Refuse collection network design, one of major decision problems in reverse logistics, is the problem of locating collection points and allocating refuses at demand points to the opened collection points. As an extension of the previous models, we consider capacity and maximum allowable distance constraints at each collection point. In particular, the maximum allowable distance constraint is additionally considered to avoid the impractical solutions in which collection points are located too closely. Also, the additional distance constraint represents the physical distance limit between collection and demand points. The objective is to minimize the sum of fixed costs to open collection points and variable costs to transport refuses from demand to collection points. After formulating the problem as an integer programming model, we suggest an optimal branch and bound algorithm that generates all feasible solutions by a simultaneous location and allocation method and curtails the dominated ones using the lower bounds developed using the relaxation technique. Also, due to the limited applications of the optimal algorithm, we suggest two heuristics. To test the performances of the algorithms, computational experiments were done on a number of test instances, and the results are reported.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.13 no.21
• /
• pp.91-100
• /
• 1990

This paper is concerned with the development of optimal algorithms for multi-stage flowshop scheduling problems with sequence dependent setup times. In the previous researches the setup time of a job is considered to be able to begin at the earliest opportunity given a particular sequence at the start of operations. In this paper the setup time of a job is considered to be able to begin only at the completion of that job on the previous machine to reflect the effects of the setup time to the performance measure of sequence dependent setup time flowshop scheduling. The results of the study consist of two areas; first, a general integer programming(IP) model is formulated and a nixed integer linear programming(MILP) model is also formulated by introducing a new binary variable. Second a depth-first branch and bound algorithm is developed. To reduce the computational burdens we use the best heuristic schedule developed by Choi(1989) as the first trial. The experiments for developed algorithm are designed for a 4$\times$3$\times$3 factorial design with 360 observations. The experimental factors are PS(ratio of processing time to setup time), M(number of machines), N(number of jobs).