• 산업공학
• /
• 제24권4호
• /
• pp.341-350
• /
• 2011

This paper considers a problem of locating both distribution centers and retailers in a zone-dependent two-level distribution network where either a distribution center or a retailer should be located in each zone. Customer demands of each zone should be satisfied directly from either its own distribution center or its own retailer being supplied from a distribution center of another zone. The objective of the proposed problem is to minimize total cost being composed of distribution center/retailer setup costs and transportation costs. In the analysis, the problem is proved to be NP-hard, so that a branch-and-bound algorithm is derived for the problem. Numerical experiments show that the proposed branch-and-bound algorithm provides the optimal solution efficiently for some small problems.

• 한국경영과학회지
• /
• 제33권2호
• /
• pp.87-101
• /
• 2008

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.

• 한국경영과학회지
• /
• 제30권4호
• /
• pp.61-70
• /
• 2005

In this Paper, we develop an improved branch and bound algorithm for the (un)weighted unconstrained two-dimensional cutting problem. In the proposed algorithm, we improve the branching strategies of the existing exact algorithm and reduce the size of problem by removing the dominated pieces from the problem. We apply the newly Proposed definition of dominated cutting pattern and it can reduce the number of nodes that must be searched during the algorithm procedure. The efficiency of the proposed algorithm is presented through comparison with the exact algorithm known as the most efficient.

• 대한산업공학회지
• /
• 제33권2호
• /
• pp.213-220
• /
• 2007

This paper considers a two-stage hybrid flow shop scheduling problem for the objective of minimizing the number of tardy jobs. Each job is processed through the two production stages in stages, each of which has multiple identical parallel machines. The problem is to determine the allocation and sequence of jobs at each stage. A branch and bound algorithm that gives the optimal solutions is suggested that incorporates the methods to obtain the lower and upper bounds. Dominance properties are also suggested to reduce the search space. To show the performance of the algorithm, computational experiments are done on randomly generated problems, and the results are reported.

• 대한산업공학회지
• /
• 제24권4호
• /
• pp.661-671
• /
• 1998

It is important to minimize the number of disk accesses which is necessary to transfer data in disk into main memory when processing transactions in physical database design. A vertical file partitioning method is used to reduce the number of disk accesses by partitioning relations vertically and accessing only necessay fragments. In this paper, SOFM(Self-Organizing Feature Maps) network is used to solve vertical partitioning problems. This paper shows that SOFM network is efficient in solving vertical partitioning problem by comparing approximate solution of SOFM network with optimal solution of N-ary branch and bound method. And this paper presents a heuristic algorithm for allocating duplicate attributes to vertically partitioned fragments. As branch and bound method requires particularly much computing time to solve large-sized problems, it is shown that SOFM network is able to overcome this limitation of branch and bound method and solve large-sized problems efficiently in a short time.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.134-138
• /
• 1998

Unification of Kohone SOM(Self-Organizing Maps) neural network with the branch-and-bound algorithm is presented for clustering large set of patterns. The branch-and-bound search technique is employed for designing coarse neural network learning paradaim. Those unification can be use for clustering or calssfication of large patterns. For classfication purposes further usefulness is possible, since only two clusters exists in the SOM neural network of each nodes. The result of experiments show the fast learning time, the fast recognition time and the compactness of clustering.

• 대한기계학회논문집A
• /
• 제34권2호
• /
• pp.191-201
• /
• 2010

본 연구는 비스플라인 근사기법을 사용한 분지한계법 기반의 새로운 전역 최적화 알고리즘에 관한 것이다. 본 연구에서는 알고리즘 구성 요소 및 이들의 구현 내용에 관한 상세히 설명한다. 핵심 요소로서, 상호분리되는 부공간으로의 설계 공간의 분할 작업이 있고, 이들 분할 부공간의 한계값 계산 작업이 있는데, 이들 모두는 실수형 비스플라인 볼륨모델에 의해 구현된다. 본 연구 알고리즘은 다양한 테스트 문제들을 가지고 해의 정확성, 함수호출 회수, 알고리즘 수행시간, 메모리 사용량, 알고리즘 수렴성 등 그 계산 성능들을 평가한다. 이러한 평가 결과는 제안 알고리즘이 직관에 의존하지 않는 완전 알고리즘이며, 대용량의 최적화 문제에도 높은 가능성이 있음을 보여주는 것이다.

• 전자공학회논문지A
• /
• 제28A권12호
• /
• pp.73-87
• /
• 1991

This paper presents a new approach to the scheduling problem in the high level synthesis. In this approach, iterative rescheduling processes starting with ASAP(As Soon As Possible) scheduling result are performed in a branch-and-bound manner so to arrive at the scheduling result of the lowest hardware cost under the given timing constraint. At each iteration step, only the selected nodes are considered for rescheduling, and the lower bound cost estimation is performed to avoid the unnecessary attempts to search for an optimal result. This branch-and-bound method turns out to be effective in pruning the search space, and thus reducing run time considerably in many cases.

• 한국경영과학회지
• /
• 제19권2호
• /
• pp.1-19
• /
• 1994

A generalized network problem is a special class of linear programming problem whose coefficient matrix contains at most two nonzero elements per column. A generalized network problem with 0-1 flow restrictions is called an integer generalized network(IGN) problem. In this paper, we presented a branch and bound algorithm for the IGN that uses network relaxation. To improve the procedure, we develop various strategies, each of which employs different node selection criterion and/or branching variable selection criterion. We test these solution strategies and compare their efficiencies with LINDO on 70 randomly generated problems.

• 한국경영과학회지
• /
• 제42권3호
• /
• pp.1-12
• /
• 2017

In this paper, we generalize lifted inequalities to a 0-1 mixed-integer bilinear covering set with linear terms. This work is motivated by the observation that Generalized Bilinear Inequality (GBI) occurs in the Branch and Bound process. We find some conditions and prove the subadditivity of lifting functions for lifting to be sequence-independent. Using the theoretical results, we develop facet-defining inequalities for a GBI-defined set through three steps of lifting.