• 제어로봇시스템학회논문지
• /
• 제5권1호
• /
• pp.62-68
• /
• 1999

The attitude of a vehicle can be precisely determined using GPS carrier phase measurements from more than two antennas attached to a vehicle and an efficient integer ambiguity resolution technique. Many methods utilizing the known baseline length as a constraint of independent elements of integer ambiguities are proposed to resolve integer ambiguity at real time. Three-dimensional search space is reduced to two-dimensional search space with this constraint. Thus the true integer ambiguity can be easily determined with less computational burden and fewer number of measurements. But there are still strong requirements for the real time integer ambiguity resolution, which uses single epoch measurement of long baseline. In this paper, a new constraint from the geometry of multiple baselines is derived. With this new constraint, two-dimensional search space is further reduced to one-dimensional search space. It makes possible to determine integer ambiguity with single epoch measurement. The proposed method is applied to real data to show its effectiveness.

• International Journal of Control, Automation, and Systems
• /
• 제4권3호
• /
• pp.333-343
• /
• 2006

In this paper, the baseline-length information is directly modeled as a measurement for the Wald test, which speeds up the resolution convergence of the integer ambiguity of GPS carrier phase measurements. The convergent speed improvement is demonstrated using numerical simulation and real experiments. It is also shown that the integer ambiguities can be resolved using only four actual satellite measurements with very reasonable convergence speed, if the baseline-length information is used just like one additional observable satellite measurement. Finally, it is shown that the improvement of convergence speed of the Wald test is due to the increase of the probability ratio with the use of the baseline-length constraint.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2005년도 추계학술대회 및 정기총회
• /
• pp.10-26
• /
• 2005

In our model, we keep inventory to satisfy uncertain demands which arrives irregularly. In this situation, we have additional two constraints. First, we need to have certain amount of order consolidation (consolidation constraint) for the orders to replenish the inventory because of production or purchase constraint. And also, if we order at a certain date which was set by administrative convenience, we have amount constraint to order the consolidated order demands (capacity constraint). We showed this variant inventory policy is needed in steel industry and note that there will be possible similar case in industry. To deal with this case, we invented a variant replenishment policy and show this policy is superior to other possible polices in the consolidation constraint case by extensive simulation. And we derive a combined solution method for dealing with the capacity constraints in addition to the consolidation constraints. For this, we suggest a combined solution method of integer programming and simulation.

• 한국경영과학회지
• /
• 제31권2호
• /
• pp.99-112
• /
• 2006

In our model, we keep inventory to satisfy uncertain demands which arrives irregularly. In this situation, we have additional two constraints. First, we need to have certain amount of order consolidation (consolidation constraint) for the orders to replenish the inventory because of production or purchase amount constraint. And also, if we order at a certain date which was set by administrative convenience, we have capacity constraint to order the consolidated order demands (capacity constraint). We show this variant inventory policy is needed in steel industry and note that there will be possible similar case in industry. To deal with this case, we invent a variant replenishment policy and show this policy is superior to other possible polices in the consolidation constraint case by extensive simulation. And we derive a combined solution method for dealing with the capacity constraints in addition to the consolidation constraints. For this, we suggest a combined solution method of integer programming and simulation.

• 한국컴퓨터정보학회논문지
• /
• 제15권9호
• /
• pp.47-55
• /
• 2010

선형 제약 만족 최적화 문제는 선형식으로 표현 가능한 목적함수 및 복잡한 제약조건을 포함하는 조합 최적화 문제를 의미한다. 정수계획법은 이와 같은 문제를 해결하는 데 매우 효과적인 기법으로 알려져 있지만 문제의 규모가 커질 경우 준최적해를 도출하기까지 매우 많은 시간과 메모리를 요구한다. 본 논문에서는 지역 탐색과 정수계획법을 결합하여 탐색 성능을 향상할 수 있는 방안을 제시한다. 기본적으로 대상 문제의 해결을 위해 지역 탐색의 가장 단순한 형태인 단순 언덕오르기 탐색을 사용하되 이웃해 생성 시 정수계획법을 적용한다. 또한 부가적으로 초기해 생성을 위해 제약 프로그래밍을 활용한다. N-Queens 최대화 문제를 대상으로 한 실험 결과, 본 논문에서 제시한 기법을 통해 다른 탐색 기법들보다 훨씬 더 좋은 해를 도출할 수 있음을 확인할 수 있었다.

• 경영과학
• /
• 제25권1호
• /
• pp.43-53
• /
• 2008

This paper considers a profit-based unit commitment problem with fuel consumption constraint and maintenance cost, which is one of the key decision problems in electricity industry. The nature of non-linearity inherent in the constraints and objective functions makes the problem intractable which have led many researches to focus on Lagrangian based heuristics. To solve the problem more effectively, we propose mixed integer programming based solution algorithm linearizing the complex non-linear constraints and objectives functions. The computational experiments using the real-world operation data taken from a domestic electricity power generator show that the proposed algorithm solves the given problem effectively.

• 산업경영시스템학회지
• /
• 제31권3호
• /
• pp.17-23
• /
• 2008

In this research article, scheduling a casting sequence in a job-shop type foundry involving a variety of casts made of an identical alloy but with different shapes and II weights, has been investigated. The objective is to produce the assigned mixed orders satisfying due dates and obtaining the highest ingot efficiency simultaneously. Implementing simple integer programming instead of complicated genetic algorithms accompanying rigorous calculations proves that it can provide a feasible solution with a high accuracy for a complex, multi-variable and multi-constraint optimization problem. Enhancing the ingot efficiency under the constraint of discrete ingot sizes is accomplished by using a simple and intelligible algorithm in a standard integer programming. Employing this simple methodology, a job-shop type foundry is able to maximize the furnace utilization and minimize ingot waste.

• 한국경영과학회지
• /
• 제21권3호
• /
• pp.227-236
• /
• 1996

In this paper an algorithm based on cutting plane approach is developed which constructs all the efficient p-tuples of multiobjective integer linear fractional programming problem. The integer solution is constrained to satisfy and h out of n additional constraint sets. A numerical illustration in support of the proposed algorithm is developed.

• 한국컴퓨터정보학회논문지
• /
• 제22권9호
• /
• pp.9-16
• /
• 2017

The course timetabling problem is a problem assigning a set of subjects to the given classrooms and different timeslots, while satisfying various hard constraints and soft constraints. This problem is defined as a constraint satisfaction optimization problem and is known as an NP-complete problem. Various methods has been proposed such as integer programming, constraint programming and local search methods to solve a variety of course timetabling problems. In this paper, we propose an iterative improvement search method to solve the problem based on constraint programming. First, an initial solution satisfying all the hard constraints is obtained by constraint programming, and then the solution is repeatedly improved using constraint programming again by adding new constraints to improve the quality of the soft constraints. Through experimental results, we confirmed that the proposed method can find far better solutions in a shorter time than the manual method.

• 한국항행학회논문지
• /
• 제11권4호
• /
• pp.388-393
• /
• 2007

변환부호화기(Transform coders)를 설계함에 있어서 비트 할당(Bit allocation)은 중요한 설계 요인 중의 하나이다. 본 논문에서는 고해상(high-resolution) 이론에 의한 수식들을 바탕으로 각 계수 양자화기들의 비트율을 정수값으로 할당해주는 최적의 알고리즘인 최대 탐욕 알고리즘과 최소 탐욕 알고리즘을 제안하였다. 특히, 제안된 최대 탐욕 알고리즘과 최소 탐욕 알고리즘에서 쌍대성(duality) 성질을 확인할 수 있었다.