• Journal of the Korean Operations Research and Management Science Society
• /
• v.20 no.3
• /
• pp.31-41
• /
• 1995

The maximum Origin-Destination Flow Path Problem (MODFP) in an Acyclic Network has known as NP-hard. K. S. Sung has suggested on Optimal Algorithm for MODFP based on the Pseudo flo or arc and the K-th shortest path algorithm. When we try to solve MODFP problem by general Branch and Bound Method (BBM), the upper and lower bounds of subproblems are so weak that the BBM become very inefficient. Here we utilized the Pseudo flow of arc' for the tight bounds of subproblems so that it can produce an efficient BBM for MODFP problem.

• Proceedings of the KIEE Conference
• /
• 2003.07a
• /
• pp.46-49
• /
• 2003

This paper proposes a method to solve expansion problem for a transmission network, given future generation and load strategy, and alternative types of lines available, subject to load, reliability and right of way constraints, the problem is formulated as a series of zero one integer programs which are solved by an efficient branch and bound algorithm A study test result on the 63-buses test system shows that the proposed method is practical and efficiently applicable to the transmission expansion planning.

• Journal of Navigation and Port Research
• /
• v.28 no.2
• /
• pp.129-133
• /
• 2004

Column subtraction, originally proposed by Harche and Thompson(1994), is an exact method for solving large set covering, packing and partitioning problems. Since the constraint set of ship scheduling problem(SSP) have a special structure, most instances of SSP can be solved by LP relaxation This paper aim, at applying the column subtraction method to solve SSP which am not be solved by LP relaxation For remained instances of unsolvable ones, we subtract columns from the finale simplex table to get another integer solution in an iterative manner. Computational results having up to 10,000 0-1 variables show better performance of the column subtraction method solving the remained instances of SSP than complex branch and-bound algorithm by LINDO.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.27 no.4
• /
• pp.87-109
• /
• 2002

A satisfiability problem in propositional logic is the problem of checking for the existence of a set of truth values of atomic prepositions that renders an input propositional formula true. This paper describes an empirical investigation of a particular integer programming approach, using the set covering model, to solve satisfiability problems. Our satisfiability engine, SETSAT, is a fully integrated, linear programming based, branch and bound method using various symbolic routines for the reduction of the logic formulas. SETSAT has been implemented in the integer programming shell MINTO which, in turn, uses the CPLEX linear programming system. The logic processing routines were written in C and integrated into the MINTO functions. The experiments were conducted on a benchmark set of satisfiability problems that were compiled at the University of Ulm in Germany. The computational results indicate that our approach is competitive with the state of the art.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.25 no.2
• /
• pp.33-46
• /
• 2000

The problem of scheduling n independent jobs on serial stages with identical parallel machines at each stage is considered. Each job lot is allocated evenly to all machines at each stage for processing and moved in transfer batches between states., This scheduling strategy is called an identical production pattern. The objective is to find a permutation schedule that minimizes makespan. A branch and bound algorithm is suggested to find an optimal permutation schedule for a transformed problem A number examples is presented to illustrate the branch and bound algorithm, Computational results for 640 problems generated randomly show that within a resonable time the suggested algorithm can be used for transfer batch scheduling in a flexible flowshop.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.4
• /
• pp.171-176
• /
• 2021

This paper deals with bid evaluation problem that chooses the vendors and quantity with minimum purchasing cost for bid information of setup cost and unit price. For this problem, the branch-and-bound(BB) and branch-and-cut(BC) methods are well-known. But these methods can be fail to obtain the optimal solution. This paper gets the initial feasible solution with procuring quantity assignment principle in accordance with the unit price or setup cost rank-first. Then procuring quantity moving optimization(vendor change) is execute take account of unit price or setup cost rank. As a result of experimentation, the propose algorithm is significantly lower compared to BB and BC.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.501-505
• /
• 1998

In this paper, an LP problem with convex polyhedral objective coefficients is treated. In the problem, the interactivities of the uncertain objective coefficients are represented by a bounded convex polyhedron (a convex polytope). We develop a computation algorithm of a maxmin achievement rate solution. To solve the problem, first, we introduce the relaxation procedure. In the algorithm, a sub-problem, a bilevel programing problem, should be solved. To solve the sub-problem, we develop a solution method based on a branch and bound method. As a result, it is shown that the problem can be solved by the repetitional use of the simplex method.

• Journal of Korea Society of Industrial Information Systems
• /
• v.1 no.1
• /
• pp.29-62
• /
• 1996

In this paper, the problem of determining cyclic schedules for a material handling hoist in the printed-circuit-board(PCB) electroplating line is considered. The objective of this research is to determine an optimal simple-cycle schedule of the hoist which in turn maximizes the line throughput rate. Previous approaches to the cyclic hoist scheduling problem are all mathematical programming-based approaches to develop cyclic schedules(Mixed Integer Programming, Linear Programming based Branch and Bound, Branch and Bound Search Method and so on). In this paper, a genetic algorithm-based approach for a single hoist scheduling in the PCB electroplating line is described. Through some experiments for the well known example data and randomly generated data, the proposed algorithm is shown to be more efficient than the previous mathematical programming-based algorithm.

• Journal of the Korean Institute of Educational Facilities
• /
• v.15 no.3
• /
• pp.4-16
• /
• 2008

BTL(Build-Transfer-Lease) Project for Education Facilities is contracted as a package which consists of several education facilities and its maintenance period is 20 years. Thus, total cost variation largely depends on the accuracy of the maintenance cost forecasting in the early stage in the life cycle of the BTL Projects. This research develops a method using complete linkage algorithm and branch & bound algorithm to help in finding optimal bundling combination. The result of this research suggests more reasonable and effective forecasting method for the maintenance bundle in BTL projects.

• Journal of Korean Institute of Industrial Engineers
• /
• v.22 no.4
• /
• pp.567-578
• /
• 1996

In relational databases the number of disk accesses depends on the amount of data transferred from disk to main memory for processing the transactions. N-ary vertical partitioning of the relation can often result in a decrease in the number of disk accesses, since not all attributes in a tuple are required by each transactions. In this paper, a 0-1 integer programming model for solving n-ary vertical partitioning problem minimizing the number of disk accesses is formulated and a branch-and-bound method is used to solve it. A preprocessing procedure reducing the number of variables is presented. The algorithm is illustrated with numerical examples and is shown to be computationally efficient. Numerical experiments reveal that the proposed method is more effective in reducing access costs than the existing algorithms.