• 산업경영시스템학회지
• /
• 제29권2호
• /
• pp.58-66
• /
• 2006

This paper addresses the analysis of the travel distance and the number of storage location for storage location allocation methods in a warehouse system. The dedicated, randomized, combined and limited storage methods are considered. The combined and the limited storage methods are suggested here, which the combined storage method is to divide the storage locations into the dedicated storage area and the randomized storage area, and the limited storage method is to restrict the storage area of each product. Through a numerical example, the average travel distance between input/output point and the storage locations, and the number of storage location needed in the warehouse are compared between storage location allocation methods. The nearest randomized storage method is shown as the reasonable one in the travel distance and the number of storage location.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.473-476
• /
• 1996

In order to reduce the number of rehandles during the loading operation of export containers in port container terminals, the storage location of each arriving container should be determined considering of its weight. We formulate the problem by a dynamic programming model to get the optimal storage location.

• 대한산업공학회지
• /
• 제35권2호
• /
• pp.129-140
• /
• 2009

This paper introduces the planar storage location assignment problem (PSLAP) that no research has attempted to mathematically solve. The PSLAP can be defined as the assignment of the inbound and outbound objects to the storage yard with aim of minimizing the number of obstructive object moves. The storage yard allows only planar moves of objects. The PSLAP usually occurs in the assembly block stockyard operations at a shipyard. This paper formulates the PSLAP using a mathematical programming model, but which belongs to the NP-hard problems category. Thus this paper utilizes an efficient genetic algorithm (GA) to solve the PSLAP for real-sized instances. The performance of the proposed mathematical programming model and developed GA is verified by a number of numerical experiments.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
• /
• pp.897-899
• /
• 2003

Recently, owing to the rapid progress of Telecommunication technology, the increase of wireless internet’s subscriber and diffusion of wireless device, LBS (Location Based Services) which take advantage of user's location information and receive information in concerning with user’s location to be essential services. Location Based Services are related the moving objects which change their locations through time. Therefore, to provide location-based services efficiently, it is required that an efficient system which could acquire, store, and query the large number of locations. In this paper, we design management system to insert and search a huge number of Moving Object based on Legacy Relational Database.

• 대한산업공학회지
• /
• 제22권4호
• /
• pp.753-770
• /
• 1996

In order to reduce the number of rehandles during the loading operation of export containers in port container terminals, the storage location of each arriving container should be determined considering of its weight. We formulate the problem by a dynamic programming model to get the optimal storage location. And a heuristic rule is suggested in order to overcome computational difficulties of the optimization model. The performance of the rule is evaluated by comparing it with the result of DP model.

• Structural Engineering and Mechanics
• /
• 제13권6호
• /
• pp.653-670
• /
• 2002

In order to ensure the structural dynamic stability of moving liquid-storage containers, the flow motion of interior liquid should be appropriately suppressed by means of mechanical devices such as the disc-type elastic baffle. In practice, the design of a suitable baffle requires a priori the parametric dynamic characteristics of storage containers, with respect to the design parameters of baffle, such as the installation location and inner-hole size, the baffle number, and so on. In this paper, we intend to investigate the parametric effect of the baffle parameters on the transient dynamic behavior of a cylindrical fuel-storage tank in an abrupt vertical acceleration motion. For this goal, we employ the ALE (arbitrary Lagrangian-Eulerian) kinematic description method incorporated with the finite element method.

• 대한산업공학회지
• /
• 제34권2호
• /
• pp.160-171
• /
• 2008

MU's mobility patterns can be found from a movement history data. The prediction accuracy and model complexity depend on the degree of application of history data. The more data we use, the more accurate the prediction is. As a result, the location management cost is reduced, but complexity of the model increases. In this paper, we classify MU's mobility patterns into four types. For each type, we find the respective optimal number of application of history data, and predictive location area by using the simulation. The optimal numbers of four types are shown to be different. When we use more than three application of history data, the simulation time and data storage are shown to increase very steeply.

• 대한산업공학회지
• /
• 제26권4호
• /
• pp.384-391
• /
• 2000

Most of the previous works on classical location models are based on the assumption that the value(or utilities) of inventory remains constants over time. In this study a special case of location problem is studied for both ameliorating and deteriorating items in two-echelon supply-chain management such as agricultural and fishery products. The objective of this study is to determine the minimum number of storage facilities among a discrete set of location sites so that the probability for each customer to be covered is not less than a critical value. We have formulated this problem using stochastic set-covering problem which can be solved by 0-1 programming method. Also we developed a computer program and applied to a set of problems for fish culture storage and distribution centers and the sample results well show the impact of ameliorating and deteriorating rate on the location problem. For the further study, a graphical user-interface with visualization for input and output is needed to be developed.

• 한국콘텐츠학회논문지
• /
• 제16권12호
• /
• pp.373-382
• /
• 2016

이산화탄소 포집 및 저장 / 격리 (CCS) 기술은 많은 이산화탄소 저감 방법 중 이상적인 방법으로 주목 받고 있다. 이산화탄소를 포집해서 파이프라인을 통해 저장소까지 수송할 때, 저장소가 가까운 경우 직접 수송할 수도 있지만, 중간 저장의 역할을 하는 허브를 거쳐 수송할 수도 있다. 허브의 수와 위치를 결정하는 것은 중요한 문제이다. 다목적 의사 결정을 위한 수학 모델은 많은 제약식과 목적식을 수반하는데, 문제의 계산 복잡도가 증가하지만 항상 최적을 보장하지 않는다. 본 연구에서는, 이산화탄소 수송망에서 중간 저장 허브의 위치와 수를 결정하는 알고리즘을 제안하고, 이를 활용하여 이산화탄소 발생지의 연결 네트워크 시뮬레이터를 개발한다. 시뮬레이터에서는 또한 이산화탄소의 수송 경로를 제공한다. 사례 연구로 한국에 모델을 적용한다.

• 한국경영과학회지
• /
• 제23권3호
• /
• pp.91-108
• /
• 1998

Automated Storage and Retrieval Systems (AS/RSs) are an important facility for modern material management. The expected benefits of these capital-intensive facilities are gained when their control policies and their physical design parameters are determined simultaneously. In this paper we present several analytical models that capture the impact of the storage assignment policy and of the rack design on the expected storage and retrieval times. Sequential and interleaved service modes are considered for sequencing the storage and retrieval requests. We further investigate the impact of the rack structure on the relative performance of the following storage assignment policies : closest open location (random), full turnover-based policy, and class-based. Our analysis clearly indicates that significant savings in crane travel time are realized when implementing full turnover-based policy, rather than random. These savings become more and more pronounced as the profile of the storage racks approaches the square-in-time shape. Furthermore, it is shown that a class-based policy, with a small number of storage classes, will capture most of these savings and be easier to manage in practice.