• Title/Summary/Keyword: branch-and-bound

Search Result 291, Processing Time 0.028 seconds

Solving the Haplotype Assembly Problem for Human Using the Improved Branch and Bound Algorithm (개선된 분기한정 알고리즘을 이용한 인간 유전체의 일배체형 조합문제 해결)

  • Choi, Mun-Ho;Kang, Seung-Ho;Lim, Hyeong-Seok
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.2 no.10
    • /
    • pp.697-704
    • /
    • 2013
  • The identification of haplotypes, which encode SNPs in a single chromosome, makes it possible to perform haplotype-based association tests with diseases. Minimum Error Correction model, one of models to computationally assemble a pair of haplotypes for a given organism from Single Nucleotide Polymorphism fragments, has been known to be NP-hard even for gapless cases. In the previous work, an improved branch and bound algorithm was suggested and showed that it is more efficient than naive branch and bound algorithm by performing experiments for Apis mellifera (honeybee) data set. In this paper, to show the extensibility of the algorithm to other organisms we apply the improved branch and bound algorithm to the human data set and confirm the efficiency of the algorithm.

Multi-level Building Layout With Dimension Constraints On Departments (형태제약을 가지는 부서의 다층빌딩 설비배치)

  • Chae-Bogk Kim
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.26 no.4
    • /
    • pp.42-49
    • /
    • 2003
  • The branch and bound techniques based on cut tree and eigenvector have been Introduced in the literature [1, 2, 3, 6, 9, 12]. These techniques are used as a basis to allocate departments to floors and then to fit departments with unchangeable dimensions into floors. Grouping algorithms to allocate departments to each floor are developed and branch and bound forms the basis of optimizing using the criteria of rectilinear distance. The proposed branch and bound technique, in theory, will provide the optimal solution on two dimensional layout. 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 and width are fixed and a perfect fit is generated if a fit is possible. Computational results obtained by cut tree-based algorithm and eigenvector-based algorithm are shown when the number of floors are two or three and there is an elevator.

A Branch-and-Bound Algorithm to Minimize the Makespan in a Fire Scheduling Problem (최소 종료시간 사격 스케줄을 위한 분지계획법 알고리즘 연구)

  • Cha, Young-Ho;Bang, June-Young
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.38 no.4
    • /
    • pp.132-141
    • /
    • 2015
  • We focus on the fire scheduling problem (FSP), the problem of determining the sequence of targets to be fired at, for the objective of minimizing makespan to achieve tactical goals. In this paper, we assume that there are m available weapons to fire at n targets (> m) and the weapons are already allocated to targets. One weapon or multiple weapons can fire at one target and these fire operations should start simultaneously while the finish time of them may be different. We develop several dominance properties and a lower bound for the problem, and suggest a branch and bound algorithm implementing them. Also, In addition, heuristic algorithms that can be used for obtaining an initial upper bound in the B&B algorithm and for obtaining good solutions in a short time were developed. Computational experiments are performed on randomly generated test problems and results show that the suggested algorithm solves problems of a medium size in a reasonable amount of computation time. The proposed lower bound, the dominance properties, and the heuristics for upper bound are tested in B&B respectively, and the result showed that lower bound is effective to fathoming nodes and the dominance properties and heuristics also worked well. Also, it is showed that the CPU time required by this algorithm increases rapidly as the problem size increases. Therefore, the suggested B&B algorithm would be limited to solve large size problems. However, the employed heuristic algorithms can be effectively used in the B&B algorithm and can give good solutions for large problems within a few seconds.

A Best-First Branch and Bound Algorithm for Unweighted Unconstrained Two-Dimensional Cutting Problems (비가중 무제한 2차원 절단문제에 대한 최적-우선 분지한계 해법)

  • Yoon, Ki-Seop;Yoon, Hee-Kwon;Kang, Maing-Kyu
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.32 no.1
    • /
    • pp.79-84
    • /
    • 2009
  • In this paper, a best-first branch and bound algorithm based upon the bottom-up approach for the unweighted unconstrained two-dimensional cutting problem is proposed to find the optimal solution to the problem. The algorithm uses simple and effective methods to prevent constructing duplicated patterns and reduces the searching space by dividing the branched node set. It also uses a efficient bounding strategy to fathom the set of patterns. Computational results are compared with veil-known exact algorithms and demonstrate the efficiency of the proposed algorithm.

Dominant failure modes identification and structural system reliability analysis for a long-span arch bridge

  • Gao, Xin;Li, Shunlong
    • Structural Engineering and Mechanics
    • /
    • v.63 no.6
    • /
    • pp.799-808
    • /
    • 2017
  • Failure of a redundant long-span bridge is often described by innumerable failure modes, which make the structural system reliability analysis become a computationally intractable work. In this paper, an innovative procedure is proposed to efficiently identify the dominant failure modes and quantify the structural reliability for a long-span bridge system. The procedure is programmed by ANSYS and MATLAB. Considering the correlation between failure paths, a new branch and bound operation criteria is applied to the traditional stage critical strength branch and bound algorithm. Computational effort can be saved by ignoring the redundant failure paths as early as possible. The reliability of dominant failure mode is computed by FORM, since the limit state function of failure mode can be expressed by the final stage critical strength. PNET method and FORM for system are suggested to be the suitable calculation method for the bridge system reliability. By applying the procedure to a CFST arch bridge, the proposed method is demonstrated suitable to the system reliability analysis for long-span bridge structure.

A Branch-and-Bound Algorithm for U-line Line Balancing (U라인 라인밸런싱을 위한 분지한계법)

  • 김여근;김재윤;김동묵;송원섭
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.23 no.2
    • /
    • pp.83-101
    • /
    • 1998
  • 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.

  • PDF

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
    • /
    • v.22 no.3
    • /
    • pp.59-80
    • /
    • 1997
  • 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.

  • PDF

A Comparison of Stacking Sequence Optimization Schemes;Genetic Algorithm and Branch and Bound Method (적층순서 최적화 알고리듬의 평가;유전 알고리듬과 분기법)

  • Kim, Tae-Uk;Shin, Jeong-Woo
    • Proceedings of the KSME Conference
    • /
    • 2003.04a
    • /
    • pp.420-424
    • /
    • 2003
  • Stacking sequence optimization needs discrete programming techniques because ply angles are limited to a fixed set of angles such as $0^{\circ},\;{\pm}45^{\circ},\;90^{\circ}$. Two typical methods are genetic algorithm and branch and bound method. The goal of this paper is to compare the methods in the light of their efficiency and performance in handling the constraints and finding the global optimum. For numerical examples, maximization of buckling load is used as objective and optimization results from each method are compared.

  • PDF

Optimal Base Station Clustering for a Mobile Communication Network Design

  • Hong, Jung-Man;Lee, Jong-Hyup;Lee, Soong-Hee
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.5 no.5
    • /
    • pp.1069-1084
    • /
    • 2011
  • This paper considers an optimal base station clustering problem for designing a mobile (wireless) communication network. For a given network with a set of nodes (base stations), the problem is to optimally partition the set of nodes into subsets (each called a cluster) such that the associated inter-cluster traffic is minimized under certain topological constraints and cluster capacity constraints. In the problem analysis, the problem is formulated as an integer programming problem. The integer programming problem is then transformed into a binary integer programming problem, for which the associated linear programming relaxation is solved in a column generation approach assisted by a branch-and-bound procedure. For the column generation, both a heuristic algorithm and a valid inequality approach are exploited. Various numerical examples are solved to evaluate the effectiveness of the LP (Linear Programming) based branch-and-bound algorithm.

Scheduling on the Pre-assembly Stage of Multiple Fabrication Machines (다중기계로 구성되는 조립전단계에서의 부품생산 일정계획)

  • 윤상흠
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.26 no.4
    • /
    • pp.63-71
    • /
    • 2003
  • This paper analyses a deterministic scheduling problem concerned with manufacturing multiple types of components at a pre-assembly stage composed of parallel fabrication machines. Each component part is machined on a fabrication machine specified in advance. The manufactured components are subsequently assembled into products. The completion time of a job(product) is measured by the latest completion time of its all components at the pre-assembly stage. The problem has the objective measure of minimizing the total weighted completion time of a finite number of jobs. Two lower bounds are derived and tested in a branch-and-bound scheme. Also, three constructive heuristic algorithms are developed based on the machine aggregation and greedy strategies. Some empirical evaluation of the performance of the proposed branch-and-bound and heuristic algorithms are also performed.