• 한국경영과학회지
• /
• 제21권2호
• /
• pp.59-70
• /
• 1996

Given the flow matrix, plant size (rectangle shape) and department sizes, the algorithm in this paper provides the plant layout with rectilinear distance measure. To construct automated facility design, eigenvector approach is employed. A branch and bound computer code developed by Tillinghast is modified to find the feasible fits of departments without shape distortion (see [1])in the plant rectangle. The computational results compared with CRAFT are shown.

• 경영과학
• /
• 제10권1호
• /
• pp.207-216
• /
• 1993

The purpose of this paper is to develop a branch and bound algorithm for the transportation problem with a limited number of company owned vehicles. First, we find an initial solution by solving quasi-assignment subproblem induced by relaxing constraints of the vehicle capacity and illegal tours elimination equations. Second, we build routing from the assignment, and if there is a routings which violates relaxed constraints, we introduce branches of the subproblem in order to remove it. After all branches are searched, we get the optimal solution.

• 한국국방경영분석학회지
• /
• 제9권1호
• /
• pp.75-85
• /
• 1983

This study is concerned with the problem of routing vehicles stationed at a central depot to supply customers with known demands, in such a way as to minimize the total distance travelled. The problem is referred to as the vehicle routing problem and is a generalization of the multiple traveling salesmen problem that has many practical applications. A branch-and-bound algorithm for the exact solution of the vehicle routing problem is presented. The algorithm finds the optimal number of vehicles as well as the minimum distance routes. A numerical example is given.

• 한국정밀공학회지
• /
• 제12권6호
• /
• pp.27-36
• /
• 1995

This paper covers algorithms to determine a machine assignment strategy to locations on a single straight track by minimizing the total backtrack distance. Three different algorithms ar presented: an efficient heuristic procedure, the branch-and-bound algorithm, and the nerual network approach. Simulation results show that the proposed algorithms have potential power to design an on-line optimizer.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집A
• /
• pp.734-739
• /
• 2001

In this paper, an algorithm for stacking sequence optimization which deals with discrete ply angles is used for optimization of composite laminated plates. To handle discrete ply angles, the branch and bound method is modified. Numerical results show that the optimal stacking sequence is found with fewer evaluations of objective function than expected with the size of feasible region, which shows the algorithm can be effectively used for layup optimization of composite laminates..

• 산업경영시스템학회지
• /
• 제26권3호
• /
• pp.58-66
• /
• 2003

The cut tree approach of Montreuil and Ratliff [16] and eigenvector approach [10] are used to automatically draw a feasible facility layout with aisle structure. The department arrangement can minimize an aisle distance criterion considering door locations and dimension constraints. The aisle distance is measured by the door to door distance between departments. An eigenvector and cut tree approaches [1] are implemented based on the branch and bound technique in Kim et al. [2] in order to obtain feasible layouts. Then, the algorithm to fix the door location of each department is developed. After the door locations are determined, the factory layout is evaluated in terms of aisle distance. The aisle structure is obtained by expanding the original layout. The solution is kept until we will find better factory layout. The proposed approach based on the branch and bound technique, in theory, will provide the optimal solution. If the runs are time and/or node limited, the proposed method is a strong heuristic. The technique is made further practical by the fact that the solution is constrained such that the rectangular shape dimensions length(l) and width(w) are fixed and a perfect fit is generated if a fit is possible.

• 대한산업공학회지
• /
• 제42권3호
• /
• pp.173-181
• /
• 2016

This paper deals with the single-hoist and multiple-products scheduling problem. Although a mixed integer linear programming model for the problem was developed earlier, a branch-and-bound based heuristic algorithm is proposed in this paper to solve the big-size problems in real situation. The algorithm is capable of handling problems incorporating different product types, jobs in the process, and tank capacities. Using a small example problem the procedure of the heuristic algorithm is explained. To assess the performance of the heuristic we generate a bigger example problem and compare the results of the algorithm proposed in this paper with the optimal solutions derived from the mathematical model of earlier research. The comparison shows that the heuristic has very good performance and the computation time is sufficiently short to use the algorithm in real situation.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1995년도 추계학술대회발표논문집; 서울대학교, 서울; 30 Sep. 1995
• /
• pp.202-210
• /
• 1995

Given a tree T with a root node 0 having the capacity H and a profit $c_{v}$ and a demand $d_{v}$ on each node v of T, the capacitated subtree of a tree problem(CSTP) is to find a subtree of T containing the root that has the maximum total profit, the sum of profits over the subtree, and also satisfies the constraint of which the sum of demands over the subtree must be less than or equal to H. We first define the so-called critical item for CSTP and find an upper bound on the linear programming relaxation of CSTP. We then present our branch and bound algorithm for solving CSTP and finally report the computational results on a set of randomly generated test problems.s.s.

• 산업경영시스템학회지
• /
• 제31권2호
• /
• pp.80-93
• /
• 2008

This paper improves algorithms for an assembly-type flowshop scheduling problem in which each job is to assemble two types of components and makespan is the objective measure. For the assembly, one type of the components is outsourced with job-dependent lead time but the other type is fabricated in-house. When both components for a job are prepared, the assembly operation for the job can be started. This problem had been proved to be NP-Complete, so branch-and-bound (B&B) and heuristic algorithms have already been developed. In this paper, we suggest other dominance rules, lowerbound and heutistic algorithms. Also, we develop a new B&B algorithm using these improved bound and dominance rules. The suggested heuristics and B&B algorithm are compared with existing algorithms on randomly-generated test problems.

• 대한산업공학회지
• /
• 제24권3호
• /
• pp.417-429
• /
• 1998

This paper considers two-sided (left and right side) assembly lines which are often used, especially in assembling large-sized products such as trucks and buses. A large number of exact algorithms and heuristics have been proposed to balance one-sided lines. However, little attention has been paid to balancing two-sided assembly lines. We present an efficient algorithm based on a branch and bound for balancing two-sided assembly lines. The algorithm involves a procedure for generating an enumeration tree. To efficiently search for the near optimal solutions to the problem, assignment rules are used in the method. New and existing bound strategies and dominance rules are else employed. The proposed algorithm can find a near optimal solution by enumerating feasible solutions partially. Extensive computational experiments are carried out to make the performance comparison between the proposed algorithm and existing ones. The computational results show that our algorithm is promising and robust in solution quality.