• Journal of the Korean Society for Railway
• /
• v.9 no.2 s.33
• /
• pp.206-211
• /
• 2006

This thesis presents railroad crew restoring problem, which is to determine the railroad plan allocation. This problem is constructed that determine the sequence of duties that railroad crews have to perform. We analyze characteristic of this problem and railroad industry. It's hard to consider many constraint conditions. We propose Integer Programming model and easy methodology to be considered all given operation rules. This problem is known to be NP-hard. We develop a genetic algorithm, which is proved to be powerful in solving optimization problems. We proposed the effective mathematical model and algorithm about making crew restoring in real industry.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.3
• /
• pp.222-227
• /
• 2005

Resolving the integer ambiguity of GPS carrier phase measurements is the most important routine in precise positioning. In this paper, success rate is analyzed when using baseline information in the process of determining attitude. The result is verified through the simulation. Determining the initial position for the ambiguity resolution is estimated by using code measurement and baseline constraint. Success rate is estimated using covariance of the formed initial position. UKF has been used to overcome the nonlinear baseline condition during the process so that the higher success rate has been obtained compared with the general attitude determination.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.355-356
• /
• 2005

The problem of maximizing an OWA aggregation of a group of variables that are interrelated and constrained by a collection of linear inequalities is considered by Yager[Fuzzy Sets and Systems, 81(1996) 89-101]. He obtained how this problem can be modelled as a mixed integer linear programming problem. Recently, Carlsson et al. [Fuzzy Sets and Systems, 139(2003) 543-546] obtained a simple algorithm for exact computation of optimal solutions to a constrained OWA aggregation problem with a single constraint on the sum of all decision variables. In this note, we introduce anew approach to the same problem as Carlsson et al. considered. Indeed, it is a direct consequence of a known result of the linear programming problem.

• Journal of the Korea Safety Management & Science
• /
• v.9 no.6
• /
• pp.113-122
• /
• 2007

Quality function deployment(QFD) is becoming a widely used customer oriented approach. The aim of this paper is to present an analytic method of quality function deployment that is to maximize customer satisfaction, using a customer satisfaction survey conducted in the college in Korea. Combining weights and satisfaction indices, "performance/important" diagrams are to develop and this grid can be used in order to identify priorities for decision making. Also, this paper shows a 0-1 integer programming model for maximizing customer satisfaction subject to a budget constraint in QFD planning process with case study.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.04a
• /
• pp.45-50
• /
• 2000

실시간 시뮬레이션은 제약조건이 있는 시뮬레이션의 대표적인 경우로, 반드시 주어진 시간안에 최상의 시뮬레이션 결과를 생성해내야 한다. 본 논문에서는 시간제약과 같은 시스템에 주어진 제약조건을 모델링 및 시뮬레이션하기 위한 방법론을 제시한다. 시스템의 모델링 과정에서는 계층적 방법론에 기초하여 다중 추상화(multi-resolution)를 제공하는 모델을 만든다. 또한 제약조건이 있는 시뮬레이션을 위해서는 구축된 모델의 추상화수준을 조절한다. 즉, 1) 구축된 모델을 추상화 수준에 따라 정리하여 AT(Abstraction Tree)를 생성한 후 2) 주어진 제약조건을 integer programming 기법을 이용하여 정형화하고, 3) 제약조건을 만족시키는 최상의 추상화 수준을 AT상에서 결정한다. 결정된 추상화 수준에 따라 시뮬레이션에 필요한 모델을 동적으로 재구성하여 임의의 제약조건이 있는 시뮬레이션을 효과적으로 수행함으로써, 모델의 재사용 및 경제성을 증진시킬 수 있다.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.9
• /
• pp.66-77
• /
• 2000

This paper presents a fast partitioning heuristic for hardware/software codesign called Best Imaginary Level-Iterative(BILI) partitioning which iteratively applies BIL heterogeneous multiprocessor scheduling heuristic to minimize the cost within the given time constraint. The proposed algorithm solves the partitioning problem with the implementation bin selection problem as well as architectures with multiple software modules. It costs about 15% less than the GCLP and at most about 5% more than the optimal solution obtained by the Integer Linear Programming(ILP) algorithm.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.3 no.2
• /
• pp.131-139
• /
• 2000

A design of CPS attitude determination system is described in this paper. The designed system is a low cost high precision 24 channel single frequency GPS(Global Positioning System) receiver which provides a precise absolute heading and pitch (or roll) as well as a position. It uses commercial chip-set and consists of two RF parts, two signal-tracking parts, a processor, memory parts and I/Os. In order to determine precise attitude, accurate carrier phase measurements and an efficient integer ambiguity resolution method are required. To meet these requirements, a PLL (Phase Locked Loops) is designed, and an algorithm called ARCE (Ambiguity Resolution with Constraint Equation) is adopted. The hardware and software structure of the system will be described, and the performance evaluated under various conditions will be presented. The test results will promise that more reliable navigation system be possible because the system provides all navigational information such as position, velocity, time and attitude.

• 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.

• Industrial Engineering and Management Systems
• /
• v.9 no.2
• /
• pp.178-194
• /
• 2010

To improve the ship operation in automated container terminals, it is important to schedule different types of handling equipment to operate synchronously. For example, a vehicle with container receiving and lifting capabilities is used to transport containers from a storage yard to a vessel and vice versa, while a triple quay crane (QC) can handle up to three 40-ft containers simultaneously. This paper discusses the manner in which vehicles should be assigned to containers to support such multi-lifts of QCs by using information about the locations and times of deliveries. A mixed-integer programming model is introduced to optimally assign delivery tasks to vehicles. This model considers the constraint imposed by the limited buffer space under each QC. A procedure for converting buffer-space constraints into time window constraints and a heuristic algorithmfor overcoming the excessive computational time required for solving the mathematical model are suggested. A numerical experiment is conducted to compare the objective values and computational times of the heuristic algorithm with those of the optimizing method to evaluate the performance of the heuristic algorithm.

• Journal of Korea Multimedia Society
• /
• v.22 no.2
• /
• pp.210-224
• /
• 2019

Given a positive integer k as input, a spatial preference query finds the k best data objects based on the scores (e.g., qualities) of feature objects in their spatial neighborhoods. Several solutions have been proposed for spatial preference queries in Euclidean space. A few algorithms study spatial preference queries in undirected spatial networks where each edge is undirected and the distance between two points is the length of the shortest path connecting them. However, spatial preference queries have not been thoroughly investigated in directed spatial networks where each edge has a particular orientation that makes the distance between two points noncommutative. Therefore, in this study, we present a new method called ALPS+ for processing spatial preference queries in directed spatial networks. We conduct extensive experiments with different setups to demonstrate the superiority of ALPS+ over conventional solutions.