• 한국철도학회:학술대회논문집
• /
• 한국철도학회 2010년도 춘계학술대회 논문집
• /
• pp.1574-1579
• /
• 2010

This paper deals with the development of warehouse layout design algorithm. In the developed model, receiving/outgoing areas, storage areas, picking/distribution areas, value-added operation areas and support areas are considered. For more efficient use of the warehouse floor space, a mezzanine floor is also considered. We develop heuristic algorithms of warehouse layout design for several cases: three types of warehouse and three types of flow. This study is expected to be used as a guideline in warehouse layout design phase.

• 한국항해항만학회지
• /
• 제33권7호
• /
• pp.477-482
• /
• 2009

In this paper the order picking problem in warehouses is considered, a topic which has received considerable attention from the international academic body in recent years. The order picking problem deals with the retrieval of order items from prespecified locations in the warehouse, and its objective is usually the minimization of travel time or travel distance. Hence, a well-thought order picking policy in combination with an appropriate storage policy will enhance warehouse efficiency and reduce operational costs. This paper starts with a literature overview summarizing approaches to routing order pickers, assigning stock-keeping units to pick locations and designing warehouse layouts. Since the layout design might affect both storage and routing policies, the three factors are interdependent with respect to order picking performance. To test these interdependencies, a simulation experiment was set up, involving two types of warehouse layout, four types of storage policy, five well-known heuristics and five sizes of order picking list. Our results illustrate that from the point of view of order picking distance minimization it is recommended to equip the warehouse with a third cross aisle, although this comes at the cost of a certain space loss. Additionally, we propose a set of most appropriate matches between order picking heuristics and storage policies. Finally, we give some directions for further research and recommend an integrated approach involving all factors that affect warehouse efficiency.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2021년도 추계학술대회
• /
• pp.101-103
• /
• 2021

전 세계적으로 수출입 화물이 급격하게 늘어나면서 기업들은 창고의 효율성 증가와 창고 인력 감소로 인해 무인 자동화창고에 대한 관심과 연구개발이 증가하고 있다. 소규모 창고에서는 재고의 흐름을 유동적으로 할 수 있는 셔틀랙 기반의 레이아웃이 빈번하게 존재한다. 그러나 셔틀랙 기반의 물류센터는 비상상황(고장, 정전 등)에서 셔틀이 작동하지 않아 물류센터 효율성과 재고관리에 심각한 영향을 미치고 있다. 이에 셔틀랙 기반의 물류센터에서 다양한 셔틀의 통로와 RTV의 통로를 레이아웃별로 분류하고 특성과 유형을 분석하여 각 레이아웃별로 신뢰성을 도출하였다. 통로의 개수에 따라 적재율도 다르게 도출되어 각 레이아웃별로 신뢰성과 적재율을 비교 분석하였다.

• 대한산업공학회지
• /
• 제18권2호
• /
• pp.109-121
• /
• 1992

In this paper, we address a layout design problem for determining a K-class-based dedicated storage layout in an automated storage retrieval system. K-class-based dedicated storage employs K zones in which lots from a class of products are stored randomly. Zones form a partition of storage locations. Our objective function is to minimize the expected single command travel time, which is expressed as a set function of space requirements for zones, average demand rates from classes, and one-way travel times from the pickup/deposit station to locations. We construct a heuristic algorithm based on analytical results and a local search method, the methodology deveolped can be used with easily-available data by warehouse planners to improve the throughput capacity of a conventional warehouse as well as an AS/RS.

• 한국컴퓨터정보학회논문지
• /
• 제8권4호
• /
• pp.159-164
• /
• 2003

물류창고의 적재위치는 창고를 이동하는 물품의 총 자재취급비용에 의해 직접전인 영향을 받는다. 본 논문의 목적은 물류 창고에서의 총 오더피킹 시간을 감소하기 위한 물품 저장방식인 블록 저장방식을 개발하고자 한다. 블록저장방식은 랙들을 블록으로 분할하고, 각 물품은 회전율과 도크와 블록간의 평균 거리를 기준으로 할당한다. 제시한 저장방식의 수행도를 평가하기 위해 다양한 주문 결합 방법들을 이용하여 기존의 등급별 저장방식과 비교 연구한다.

• 산업공학
• /
• 제13권3호
• /
• pp.455-461
• /
• 2000

Logistics systems can be evaluated by how productively distribution center operates, how promptly transportation vehicle dispatches, how efficiently facility layout is, and so on. In this paper, a practical vehicle routing scheme with fixed delivery time and fixed vehicle routes is introduced. The method helps the distribution center reduce logistics cost with respect to dispatching vehicles, and satisfy the customer with pre-determined delivery time window constraints. A case study has shown that the proposed scheme not only generates a feasible schedule with time windows, but also balances material flow in warehouse.

• 한국항해항만학회:학술대회논문집
• /
• 한국항해항만학회 2016년도 춘계학술대회
• /
• pp.211-212
• /
• 2016

이동랙을 사용하는 자동화 창고를 효율적으로 운영하기 위해서는 창고의 한정된 자원인 포크리프트와 같은 작업 차량과 이동랙 자체를 효과적으로 운용하는 운영방식이 중요하다. 주로 최대한 빠른 시간 내에 이동 동선을 줄이는 것이 목표가 된다. 고정랙에서 차량만이 이동하는 일반창고와는 달리 이동랙이 움직이는 형태이므로 창고 내 복잡도가 높아질 수 있으며 높은 복잡도는 운영 효율을 저해하는 요인이 된다. 즉, 창고의 화물 배치 형태, 입출고 작업 오더의 순서뿐만 아니라 이동랙의 움직임과 작업 차량의 충돌 등과 같은 문제가 더해져 창고의 복잡도는 현저히 증가하게 된다. 본 연구는 이동랙을 사용한 자동화 창고의 형태와 화물의 배치에 따른 운영형태를 연구하도록 한다.

• 한국생산제조학회지
• /
• 제23권5호
• /
• pp.505-511
• /
• 2014

The functional role of warehouses in modern industry is changing from an established concept of storage to a concept of circulation. The target of this study is to improve the stacker crane's efficiency for the internal operations of the Automated Storage and Retrieval System (AS/RS). Eight operating schemes are proposed under the combination of three conditions, namely, the storing method, the layout type, and the sequence of command execution. The moving distance of the stacker crane is calculated using the same gateway data through a simulation based on a C# program. The optimal operating scheme is proposed based on the analyzed simulation results. In conclusion, the combination of conditions of random storage, two-way type warehouse, and dual command execution elicits optimum results in travel efficiency for the stacker crane.

• 한국경영과학회지
• /
• 제32권2호
• /
• pp.1-15
• /
• 2007

This paper proposes a method for determining the number of storage rooms and designing the storage layout in warehouses for pyramid type stacks whose example are slacks for steel coils, paper rolls, and drums for oils. Formulas are derived for estimating the expected values and the variances of various handling times by cranes. From the derived formulas, the expected queuing time of road trucks is estimated. Base on the derived formulas, this study derives the cost function for determining the optimal numbers of rows, bays, and tiers of stacks and sizing cranes under the condition that the requirement for storage space is satisfied. Results of numerical analysis are provided.

• Genomics & Informatics
• /
• 제2권4호
• /
• pp.191-194
• /
• 2004

Exponentially increasing biopathway data in recent years provide us with means to elucidate the large-scale modular organization of the cell. Given the existing information on metabolic and regulatory networks, inferring biopathway information through scientific reasoning or data mining of large scale array data or proteomics data get great attention. Naturally, there is a need for a user-friendly system allowing the user to combine large and diverse pathway data sets from different resources. We built a data warehouse - BIOWAY - for analyzing and visualizing biological pathways, by integrating and customizing resources. We have collected many different types of data in regards to pathway information, including metabolic pathway data from KEGG/LIGAND, signaling pathway data from BIND, and protein information data from SWISS-PROT. In addition to providing general data retrieval mechanism, a successful user interface should provide convenient visualization mechanism since biological pathway data is difficult to conceptualize without graphical representations. Still, the visual interface in the previous systems, at best, uses static images only for the specific categorized pathways. Thus, it is difficult to cope with more complex pathways. In the BIOWAY system, all the pathway data can be displayed in computer generated graphical networks, rather than manually drawn image data. Furthermore, it is designed in such a way that all the pathway maps can be expanded or shrinked, by introducing the concept of super node. A subtle graphic layout algorithm has been applied to best display the pathway data.