• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제14권8호
• /
• pp.753-757
• /
• 2008

본 논문은 그리드 환경에서 동전계획법을 위한 새로운 스케줄링 정책을 제안한다. 이 스케줄링 정책의 특징은 동적 테이블의 지역성을 고려하여 테이블을 분할하고, 네트워크 지연이 최소인 노드에 작업을 할당함으로써 작업의 실행시간을 단축하는 것이다. 또한 최적의 병행성을 얻기 위해 분산 하향식으로 동적 테이블을 구성한다 시뮬레이션을 통하여 제안하는 그리드 스케줄링 정책이 그리드 환경의 성능 향상 면에서 기존의 분기-한정(branch-bound) 알고리즘에 비해 더 효과적임을 보인다

• 한국산업정보학회논문지
• /
• 제7권1호
• /
• pp.58-65
• /
• 2002

정수계획법모형에서 목적함수와 선형 제약조건식에 만족하는 최적해를 유도할 때, 선형 제약조건식으로 이루어지는 모든 가능해의 Convex set K에서 정수인 extreme point 또는 수정된 정수인 extreme point를 유도하여 목적함수Z의 최적해로 결정한다. 본 논문에서는 기저변수 벡터 $X_{B}$의 성분이 정수가 아닐 때 Branch & Bound 방법을 확장하여 $X_{B}$가 정수가 되도록 한다. 그리고 목적함수의 계수 $C_{j}$의 변동에 의하여 단계적으로 변하는 최적화를 유도함을 목적으로 한다. 한다.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -3
• /
• pp.1780-1783
• /
• 2002

A problem of signal transmitted and received in OFDM systems is considered. In particular, an efficient solution to the problem of blind channel estimation based on Maximum Likelihood (ML) principle has been investigated. The paper proposes a new upper-bound cost, used in conjunction with a standard branch and bound integer programming technique for solving the ML problem. The tighter upper-bound cost exploits a finite-alphabet property of the transmitted signal. The proposed upper-bound cost was found to greatly speed up the ML algorithm, thus reducing computational complexity. Experimental results and discussion are included.

• 한국시뮬레이션학회논문지
• /
• 제24권4호
• /
• pp.77-88
• /
• 2015

본 논문은 작업별 위치기반 지수학습 효과를 갖는 2-에이전트 단일기계 스케줄링 문제를 고려한다. 에이전트 A는 가중 완료 시간의 합을 최소화하며, 에이전트 B는 총소요시간에 대한 상한 값을 만족하는 조건을 갖는다. 본 연구에서는 먼저 우수해/가능해에 대한 특성을 개발하고, 이를 이용하여 최적 해를 찾기 위한 분지한계 알고리즘을 설계한다. 또한 근사 최적 해를 구하기 위해 6가지 다른 초기해 생성 방법을 이용한 시뮬레이티드 어닐링 알고리즘을 제안한다. 수치 실험을 통해 제안된 알고리즘의 우수한 성능을 검증한다. 실험 결과, 다른 초기해 생성 방법들 간에는 %errors 차이가 유의하게 발생하지 않았으며, 에이전트 A의 작업 순서를 무작위로 생성할 때 성능이 좋아짐을 발견하였다. 반면에, 에이전트 B의 초기해 생성 방법은 성능에 영향을 미치지 않았다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제7권12호
• /
• pp.3180-3199
• /
• 2013

While non-predefined object segmentation (NDOS) distinguishes an arbitrary self-assumed object from its background, predefined object segmentation (DOS) pre-specifies the target object. In this paper, a new and novel method to segment predefined objects is presented, by globally optimizing an orientation-based objective function that measures the fitness of the object boundary, in a discretized parameter space. A specific object is explicitly described by normalized discrete sets of boundary points and corresponding normal vectors with respect to its plane shape. The orientation factor provides robust distinctness for target objects. By considering the order of transformation elements, and their dependency on the derived over-segmentation outcome, the domain of translations and scales is efficiently discretized. A branch and bound algorithm is used to determine the transformation parameters of a shape model corresponding to a target object in an image. The results tested on the PASCAL dataset show a considerable achievement in solving complex backgrounds and unclear boundary images.

• 대한기계학회논문집A
• /
• 제25권3호
• /
• pp.369-380
• /
• 2001

Although extensive efforts have been devoted to the optimal design of composite laminated plates in recent years, some practical issues still need further research. Two of them are: the handling of the ply angle as either continuous or discrete; and that of the uncertainties in material properties, which were treated as continuous and ignored respectively in most researches in the past. In this paper, an algorithm for stacking sequence optimization which deals with discrete ply angles and that for thickness optimization which considers uncertainties in material properties are used for a two step optimization of composite laminated plates. In the stacking sequence optimization, the branch and bound method is modified to handle discrete variables; and in the thickness optimization, the convex modeling is used in calculating the failure criterion, given as constraint, to consider the uncertain material properties. Numerical results show that the optimal stacking sequence is found with fewer evaluations of objective function than expected with the size of feasible region taken into consideration; and the optimal thickness increases when the uncertainties of elastic moduli considered, which shows such uncertainties should not be ignored for safe and reliable designs.

• 한국콘텐츠학회논문지
• /
• 제6권4호
• /
• pp.46-54
• /
• 2006

다수 대의 표면실장기를 포함한 PCB조립라인의 생산성 향상을 위한 방법을 제시한다. PCB조립시간의 단축을 위하여 각 실장기 별로 부품공급 피더의 배치 및 실장순서가 최적화 되어야 하며, 표면실장기들의 라인 밸런스를 위하여 부품 할당이 최적화 되어야 한다. 전체의 최적화 문제를 정수계획문제로 수식화하며, 전향경로문제와 후향경로 문제로 분할하여 구성한다. 클러스터링 알고리즘과 branch-and-bound 알고리즘을 사용하여 전향경로문제의 해를 구하며, 할당 알고리즘과 연결 알고리즘을 사용하여 후향경로 문제의 해를 구한다. 시뮬레이션 결과를 통하여 제안된 방법의 성능을 평가한다.

• 대한전기학회논문지:전력기술부문A
• /
• 제53권7호
• /
• pp.405-413
• /
• 2004

Traditionally, electrical power systems had the vertically-integrated industry structures based on the economics of scale. However power systems have been recently reformed to increase the energy efficiency of the power system. According to these trends, Korean power industry has been partially restructured, and the competitive generation market was opened in 2001. In competitive electric markets, correct demand data are one of the most important issue to maintain the flexible electric markets as well as the reliable power systems. However, the measuring load data can have the uncertainty because of mechanical trouble, communication jamming, and other things. To obtain the reliable load data, an efficient evaluation technique to adust the missing load data is needed. This paper analyzes the load pattern of historical real data and then the turned ARIMA (Autoregressive Integrated Moving Average) model, PCHIP(Piecewise Cubic Interporation) and Branch & Bound method are applied to seek the missing parameters. The proposed method is tested under a variety of conditions and tested with historical measured data from the Korea Energy Management Corporation (KEMCO).

• KIEE International Transactions on Power Engineering
• /
• 제4A권4호
• /
• pp.254-261
• /
• 2004

Traditionally, electrical power systems had formed the vertically integrated industry structures based on the economics of scale. However, power systems have been recently reformed to increase their energy efficiency. According to these trends, the Korean power industry underwent partial reorganization and competition in the generation market was initiated in 2001. In competitive electric markets, accurate load data is one of the most important issues to maintaining flexibility in the electric markets as well as reliability in the power systems. In practice, the measuring load data can be uncertain because of mechanical trouble, communication jamming, and other issues. To obtain reliable load data, an efficient evaluation technique to adjust the missing load data is required. This paper analyzes the load pattern of historical real data and then the tuned ARIMA (Autoregressive Integrated Moving Average), PCHIP (Piecewise Cubic Interpolation) and Branch & Bound method are applied to seek the missing parameters. The proposed method is tested under a variety of conditions and also tested against historical measured data from the Korea Energy Management Corporation (KEMCO).

• 한국경영과학회지
• /
• 제8권1호
• /
• pp.27-30
• /
• 1983

The purpose of this paper is to find a new method for the warehouse location problem. Akinc and Khumatvala developed a branch and bound algorithm for a one-stage problem, that is, plants and warehouses are at the same location. This paper extends this method to a two-stage problem, that is, plants, warehouses and users are located at different sites, and further this paper allows direct flows from plants to users. The new method is tested at Perkins-Elmer. The test shows that the algorithm is efficient.