• 대한기계학회논문집A
• /
• 제36권4호
• /
• pp.361-371
• /
• 2012

혼합이산비선형계획법(mixed-discrete nonlinear programming) 문제의 최적화를 위한 대표적인 기법 중에 하나인 분지한계법(branch-and-bound method)은 다른 기법에 비해 강건하지만 분지한계법 내부의 각 노드마다 연속최적화를 수행해야 하기 때문에 많은 함수 계산이 요구되는 것으로 알려져 있다. 이러한 분지한계법의 단점을 극복하기 위하여 크게 두 가지 연구를 수행하였다. 먼저, 분지한계법의 각 노드마다 동일한 수렴허용오차를 설정해주던 기존의 방법을 대체할 수 있는 비균일 수렴허용오차 방법을 제안하였다. 또한 분지한계법에 적용할 수 있는 5 가지 분지순서 방법 중에서 분지한계법의 성능을 가장 극대화할 수 있는 분지순서 방법을 제시하였다. 수렴허용오차 방법과 분지순서 방법들을 각각 선택하여 분지한계법에 적용한 후 7 개의 수학예제와 4 개의 공학예제에 대하여 테스트를 수행한 결과, 제안된 비균일 수렴허용오차 방법과 5 가지 분지순서 방법 중 최소간 격차이법을 분지한계법에 함께 적용할 경우 분지한계법의 성능이 가장 극대화 됨을 확인할 수 있었다.

• Journal of applied mathematics & informatics
• /
• 제8권1호
• /
• pp.181-197
• /
• 2001

A heuristic method TABU-CSP using Tabu Search (TS) is described for solving Constraint Satisfaction Problems (CSPs). The method is started with a complete but inconsistent solution of a binary CSP and obtained in prespecified number of iterations either a consistent solution or a near optimal solution with an acceptable number of conflicts. The repair in the solution at each iterative step is done by using two heuristics alternatively. The first heuristic is a min-conflicts heuristic that chooses a variable with the maximum number of conflicts and reassigns it the value which leads to the minimum number of conflicts. If the acceptable solution is not reached after the search continued for a certain number of iterations, the min-conflict heuristic is changed and the variable selected least number of times is chosen for repair. If an acceptable solution is not reached, the method switches back to the min-conflict heuristic and proceeds further. This allowed the method to explore a different region of search space space for the solution as well as to prevent cycling. The demonstration of the method is shown on a toy problem [9]which has no solution. The method is then tested on various randomly generated CSPs with different starting solutions. The performance of the proposed method in terms of the average number of consistency is checked and the average number of conflicts is conflicts is compared with that of the Branch and Bound(BB) method used to obtain the same solution. In almost all cases, the proposed method moves faster to the acceptable solution than BB.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1985년도 하계학술회의논문집
• /
• pp.111-114
• /
• 1985

• 대한조선학회논문집
• /
• 제30권1호
• /
• pp.115-124
• /
• 1993

본 연구에서는 구조물의 안전성을 평가하는 방법으로써 구조시스템 신뢰성 해석방법을 살펴보고 소성설계 관점에서 선체중앙단면의 안전성을 평가하고자 한다 이를 위해 소성붕괴모드는 가상하중법과 하중증분법을 이용한 탄소성 구조해석법으로 구하고, 확률론적으로 중요한 붕괴모드는 branch and bound 방법을 변형하여 소성붕괴모드를 형성하는 마지막 소성힌지단계에서 branching하는 방법을 적용하여 붕괴모드가 반복 생산되는 문제를 개선하였다. 이렇게 구한 붕괴모드를 이용하여 1,2차 bound방법으로 선체횡단면의 시스템 신뢰도 및 시스템 파괴확률을 구하고 본 연구에서 제시한 방법의 유효성을 붕괴하중 계수방법과 비교 검토하였다.

• Journal of Electrical Engineering and Technology
• /
• 제12권6호
• /
• pp.2187-2195
• /
• 2017

In order to solve the AC optimal power flow (OPF) problem considering the generators' on/off status, it is necessary to model the problem as mixed-integer nonlinear programming (MINLP). Because the computation time to find the optimal solution to the mixed-integer AC OPF problem increases significantly as the system becomes larger, most of the existing solutions simplify the problem either by deciding the on/off status of generators using a separate unit commitment algorithm or by ignoring the minimum output of the generators. Even though this kind of simplification may make the overall computation time tractable, the results can be significantly erroneous. This paper proposes a novel algorithm for the mixed-integer AC OPF problem, which can provide a near-optimal solution quickly and efficiently. The proposed method is based on a combination of the outer approximation method and the relaxed AC OPF theory. The method is applied to a real-scale power system that has 457 generators and 2132 buses, and the result is compared to the branch-and-bound (B&B) method and the genetic algorithm. The results of the proposed method are almost identical to those of the compared methods, but computation time is significantly shorter.

• KIEE International Transactions on Power Engineering
• /
• 제5A권1호
• /
• pp.46-55
• /
• 2005

This paper proposes a new method for choice of the best transmission system expansion plan on the side of highest satisfaction level of decision maker using fuzzy integer programming. The proposed method considers the permissibility and ambiguity of the investment budget (economics) for constructing the new transmission lines and the delivery marginal rate (reliability criteria) of the system by modeling the transmission expansion problem as a fuzzy integer programming one. It solves the optimal strategy (reasonable as well as flexible) using a fuzzy set theory-based on branch and bound method that utilizes a network flow approach and the maximum flow-minimum cut set theorem. Under no or only a very small database for the evaluation of reliability indices, the proposed technique provides the decision maker with a valuable and practical tool to solve the transmission expansion problem considering problem uncertainties. Test results on the 63-bus test system show that the proposed method is practical and efficiently applicable to transmission expansion planning.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 추계학술대회 논문집 전력기술부문
• /
• pp.350-353
• /
• 2001

This study proposes a new method for the transmission system expansion planning using the fuzzy integer programming. It presents stepwise cost characteristics analysis which is a practical condition of an actual systems. A branch and bound method which includes the network flow method and the maximum flow-minimum cut set theorem has been used in order to proceed the stepwise cost characteristics analysis. Uncertainties of the permission of the construction cost and not strict reserve rate and load forecasting of expansion planning have been included and also processed using fuzzy set theory in this study. In order to proceed the latter analysis, the solving procedure is illustrated in detail by branch and bound method which includes the network flow method and maximum flow-minimum cut set theorem. Finally, case studies on 21-bus test system show that the algorithm proposed is efficiently applicable to the practical expansion planning of transmission systems in future.

• 한국경영과학회지
• /
• 제27권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.

• 한국산업정보학회논문지
• /
• 제1권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.

• 산업경영시스템학회지
• /
• 제21권46호
• /
• pp.33-49
• /
• 1998

In order to improve the performance of relational databases, one has to reduce the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to reduce the number of disk I/O accesses by vertically partitioning relation into fragments and allowing attribute replication to fragments if necessary. When zero-one integer programming model is solved by the branch-and-bound method, it requires much computing time to solve a large sized problem. Therefore, heuristic solutions using genetic algorithm(GA) are presented. GA in this paper adapts a few ideas which are different from traditional genetic algorithms, for examples, a rank-based sharing fitness function, elitism and so on. In order to improve performance of GA, a set of optimal parameter levels is determined by the experiment and makes use of it. As relations are vertically partitioned allowing attribute replications and saved in disk, an attribute replicating vertical partition method by GA can attain less access cost than non-attribute-replication one and require less computing time than the branch-and-bound method in large-sized problems. Also, it can acquire a good solution similar to the optimum solution in small-sized problem.