• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• 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.

• Food Science and Preservation
• /
• v.2 no.1
• /
• pp.195-202
• /
• 1995

An experiment was conducted to develop the simple methods of ginger storage which decrease the weight reduction and maintain good quality of ginger during the cellar storage. The stored boxes with volume of 0.03㎥ and ventilator diameter of 3, 4, 5cm was hurried under the ground(60, 80, 100cm) in the green house. During the cellar storage at the 100cm depth the average temperature and relative humidity in the stored box were remained in 11.7~16.3$^{\circ}C$ and 73%, respect. The higher storage amount and smaller size of ventilator size increased the CO2 concentration in the stored box, and the concentration in the stored box with 50% storage quantity rate and 3cm ventilator diameter size was more than 10% for about 2 months from early Feburary. The decay rate of ginger during the cellar storage increased with higher amount of storage quantity and smaller size of ventilator. The CO2 concentration was low and remained relatively constant with the deeper location of stored box under the ground, and the decay rate was lower in the deeper stored box. Germination rate increased with the deeper location of stored box, and with the lower storage quantity and larger ventilator size. The germination rate was low in the higher decay rate box. Weight loss, total sugar and moisture contents of ginger were decreased, while crude fiber and ash were increased during the storage.

• Industrial Engineering and Management Systems
• /
• v.11 no.3
• /
• pp.276-287
• /
• 2012

Determining storage locations of containers is an important issue for efficient operation of container terminals. This study assumes a storage yard with a horizontal layout in which blocks are laid out in parallel to the quay and trucks enter at the side of a block to deliver (receive) a container to (from) the yard crane. Various storage rules for determining storage locations of containers are introduced. Simulation studies are conducted for evaluating various rules. The following guidelines are derived from the result of our simulation study: when designing a block, consider a block configuration in which the longest gantry and the longest trolley travel times of rail-mounted gantry cranes (RMGCs) are similar; do not restrict the types of containers that can be stored in a storage area; if different roles are to be assigned to different storage areas, one possible way is to divide a bay into two areas so that some rows in the bay are allocated to inbound containers while the other rows in the same bay are allocated to outbound containers; reserve the space in bay unit for a high productivity of RMGCs but reserve the space in stack unit when the storage space is not enough; when the storage space is not sufficient, allocate storage location in a way of starting from the end and ending at the middle of a block; for reducing the travel distance of internal trucks, provide a higher priority to a block nearer to the berthing position of the corresponding vessel.

• Korean Journal of Hydrosciences
• /
• v.7
• /
• pp.21-35
• /
• 1996

This Study is to develop the suitable hydrologic models for determination of the size and location of detention storage facilities to restrain stormwater runoff in urban areas. Hypothetical areas of two levels are considered to seize the hydrologic response characteristics. A one-square-kilometer ares is selected for the catchment level, and a 10-square-kilometer area consisting of 10 catchments is adapted at the watershed level as representative of urban drainage area. In this analysis, different rainfall freqyencies, land uses, drainage patte군, basin shates and detention storage policies are considered. Folw reduction effect of detention storage facilities is deduced from storage ratio and detention basin factor. A substantial saving in detention storage volumes is achieved 노두 the detention storage is planned at the watershed level rather than the catchment level. For the application of real watersheds, two watersheds in Seoul metropolitan area-Jamshil 2 and Seongnae 1-are selected on the basis of hydrologic response charactaristics. Through the regression analysis between dimensionless deterntion storage volume, dimensionless upstream area ratio and reduction rate of storage ratio, the regression equations to determine the size and location of detention storage faclities are presented.

• Structural Engineering and Mechanics
• /
• v.13 no.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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.34 no.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.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.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.

• Proceedings of the KSRS Conference
• /
• 2003.11a
• /
• 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.

• IE interfaces
• /
• v.22 no.2
• /
• pp.116-125
• /
• 2009

We revisit the assembly block storage location assignment problem (ABSLAP) at a shipyard, in order to compensate for the deficiency in performance verification of the heuristic ABSLAP algorithm developed by the previous study. In this paper, we formulate a mathematical programming model of the ABSLAP, refine elaborately the heuristic ABSLAP algorithm, and show the performance of the developed mathematical programming model and the revised heuristic ABSLAP algorithm. In addition, we explain simulation experiments conducted using the revised heuristic ABSLAP algorithm to investigate the influences of block stockyard layouts and production schedule instability on the block stockyard operations.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.5 no.5
• /
• pp.909-937
• /
• 2011

Energy efficiency is one of the most critical issues in the design of wireless sensor networks. In object-tracking sensor networks, the data storage and query processing should be energy-conserving by decreasing the message complexity. In this paper, a Prediction-based Energy-conserving Approximate StoragE schema (P-EASE) is proposed, which can reduce the query error of EASE by changing its approximate area and adopting predicting model without increasing the cost. In addition, focusing on reducing the unnecessary querying messages, P-EASE enables an optimal query algorithm to taking into consideration to query the proper storage node, i.e., the nearer storage node of the centric storage node and local storage node. The theoretical analysis illuminates the correctness and efficiency of the P-EASE. Simulation experiments are conducted under semi-random walk and random waypoint mobility. Compared to EASE, P-EASE performs better at the query error, message complexity, total energy consumption and hotspot energy consumption. Results have shown that P-EASE is more energy-conserving and has higher location precision than EASE.