• 제목/요약/키워드: storage location

검색결과 408건 처리시간 0.026초

창고시스템에서 보관위치할당 방식에 대한 이동거리와 보관위치 수의 분석 (Analysis of the Travel Distance and the Number of Storage Location for Storage Location Allocation Methods in a Warehouse System)

  • 장석화
    • 산업경영시스템학회지
    • /
    • 제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.

등고선 접근방식을 이용한 복식명령작업 저장위치형태의 결정 (A Contour Line Approach to Storage Location Configurations for Dual Command Operations)

  • 박병춘
    • 대한산업공학회지
    • /
    • 제24권4호
    • /
    • pp.519-528
    • /
    • 1998
  • This paper examines the effect of storage location configurations on dual command cycle times for the efficient operation of automated storage/retrieval systems. We use a contour line approach to determine storage location configurations. We present a contour line configuration generating scheme and a location indexing scheme. Given a contour line configuration, the location indexing scheme provides a unique priority to each location. The location priority is then used for determining the storage location of an incoming load. To investigate the effect of alternative contour line configurations on dual command cycle times, we perform a series of experiments under various storage policies.

  • PDF

지정식 보관방식 창고시스템에서 보관위치 할당계획 (The Allocation Planning of Storage Location in a Dedicated Storage Method Warehuse System)

  • 장석화
    • 산업경영시스템학회지
    • /
    • 제30권1호
    • /
    • pp.8-14
    • /
    • 2007
  • This paper addresses the allocation planning of the storage location in a warehouse system that the dedicated storage method is used. In the discrete finite time period model, the demands for storage location of products are dynamic for time periods. The planning is to determine the reallocation time period and the storage location of the products in reallocation time period, which minimizes costs. The cost factors are the reallocation cost, the travel cost within warehouse and the surplus storage location cost. A model is formulated, and the property of optimal solution is characterized. The dynamic programming algorithm is developed, and a numerical example is shown.

유닛로드형 자동창고의 수행도 분석 (Performance Analysis of Unit-load AS/R Systems)

  • 김남하;임석철;홍석교;이수훈;홍만표
    • 대한산업공학회지
    • /
    • 제20권2호
    • /
    • pp.39-50
    • /
    • 1994
  • Most research results on the throughput of unit-load automated storage retrieval (AS/R) systems assume the randomized storage; that is, all slots In the entire rack are equally likely to be selected for the storage location. However, for the most existing AS/R systems which use Closest Open location storage policy, Park[6] mathematically showed that this assumption results in a significant difference from the actual performance of AS/R systems. In this study, we present more details about the performance of the unit-load AS/R systems by considering the rack utilization and rack density; and examine their impact on the throughput of AS/R systems by using computer simulation. A new storage policy named Shortest Cycle Location(SCL) is proposed. Simulation results indicate that the performance of SCL policy consistently outperforms the Closest Open location storage policy. We also define the "Extra-Cost Zone" compared to the "No-Cost Zone"[3] and explore its geometric and practical meaning.

  • PDF

평면적 저장 위치 할당 문제에 대한 유전자 알고리즘 (Genetic Algorithm of the Planar Storage Location Assignment Problem)

  • 박창규;서준용
    • 대한산업공학회지
    • /
    • 제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.

취급, 수송 및 저장능력을 고려한 임시 재고의 저장 공간 할당 (Allocating Storage Spaces for Temporary Inventories Considering Handling, Transportation, and Storage Capacities)

  • 원승환;김갑환
    • 한국경영과학회지
    • /
    • 제31권3호
    • /
    • pp.11-25
    • /
    • 2006
  • Space may be a scarce resource in manufacturing shops, warehouses, freight terminals, and container terminals. This Paper discusses how to locate temporary storage Inventories In limited storage areas. A typical inventory is delivered from the location of the preceding process to the storage area and stored In the storage area during the certain period of time. And it may be relocated from the storage position to another. Finally. it is delivered from the final storage area to the location of the next process. Because this logistic process for an inventory requires handling activities, transportation activities, and storage spaces, the limitation in capacities of handling equipment, transportation equipment, and storage space must be considered when allocating spaces to the inventory. This problem Is modeled as a multicommodity minimal cost flow problem. And a heuristic algorithm for the Problem is proposed. Numerical experiments are presented to validate the mathematical model and the heuristic algorithm.

RFID 기반 냉동창고 시스템의 적재위치 관리 방안 (An Approach for Managing Storage Locations in RFID-Based Cold-Storage Warehouse System)

  • 문미경;최봉준
    • 한국정보통신학회논문지
    • /
    • 제15권9호
    • /
    • pp.1971-1978
    • /
    • 2011
  • 기존의 RFID (Radio Frequency Identification) 기반 냉동창고 시스템에서는 cold room 입구에 RFID 리더기를 설치하여 물품이 인식될 때 단지 그곳에 적재되는 것으로 인식하였다. 그러나 이러한 방법으로는 다양한 상황에서 물품의 적재위치 인식에 오류가 발생하게 된다. 냉동창고에서는 물품 보관을 하는 cold room의 안팎 온도차이로 인해 물품의 적재위치 오류는 물품의 변질을 가져오게 하므로 실시간 정확한 위치를 파악하는 것은 매우 중요하다. 본 논문에서는 2대의 RFID 리더기가 설치된 지게차와 천정태그를 이용하여 냉동창고 관리시스템에서 물품의 적재위치 오류를 해결하기 위한 방안을 제시한다. 지게차에 설치된 2개의 RFID 리더기는 각각 천장에 부착된 태그로부터 위치데이터와 지게차에 적재된 물품데이터를 획득한다. 2개의 리더기로부터 수집된 데이터를 분석하여 물품의 입/출고 상황정보와 물품의 이동경로정보를 실시간으로 모니터링 할 수 있다. 이를 통해 냉동창고의 물품보관에 대한 효율성을 높일 수 있게 한다.

Design of Moving Objects Server for Location Based Services

  • Cho, Dae-Soo;Min, Kyoung-Wook;Lee, Jong-Hun
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2002년도 Proceedings of International Symposium on Remote Sensing
    • /
    • pp.157-162
    • /
    • 2002
  • Recently, location based services, which make use of location information of moving objects, have obtained increasingly high attention. The moving objects are time-evolving spatial objects, that is, their locations are dynamically changed as time varies. Generally, GIS server stores and manages the spatial objects, of which locations are rarely changed. The traditional GIS server, however, has a difficulty to manage the moving objects, due to the fact of locations being frequently changed and the trajectory information (past locations of moving objects) being managed. In this paper, we have designed a moving object server, which stores and manages the locations in order to support various location based services. The moving object server is composed of a location acquisition component, a location storage component, and a location query component. The contribution of this paper is that we integrate the each work for location acquisition, storage, and query into a moving objects server.

  • PDF

수직 배치형 컨테이너 터미널 반입작업에서 수출 컨테이너의 작업순서와 장치위치 통합 의사결정 (Integrated Decision-making for Sequencing and Storage Location of Export Containers at a Receiving Operation in the Container Terminal with a Perpendicular Layout)

  • 배종욱;박영만
    • 한국항해항만학회지
    • /
    • 제35권8호
    • /
    • pp.657-665
    • /
    • 2011
  • 본 연구는 수직 배치형 컨테이너 터미널에서 반입되는 수출 컨테이너의 작업순서와 장치위치를 결정하는 통합 문제를 다루었다. 수출 컨테이너에 대한 선호 장치위치는 대응하는 본선작업의 우선순위와 밀접하고 외부 트럭들의 대기시간은 장치 소요시간에 좌우된다. 본 연구는 외부 트럭들의 예정도착시간과 예정완료시간 그리고 적하작업의 선호 장치위치를 고려한 혼합정수모형을 제시하였다. 그리고 현장 적용을 위해 시뮬레이티드 어닐링에 기반한 휴리스틱 알고리즘을 개발하였다. 목적 함수값과 계산시간의 관점에서 최적 모형과 휴리스틱 알고리즘을 비교하였고 수치실행을 통해 휴리스틱 알고리즘의 수행도를 분석하였다.

자동창고 시스템의 저장위치 선정에 관한 시뮬레이션 연구 (A Simulation Study on the Determination of Storage Location in Automated Warehousing Systems)

  • 손권익;김창덕;조용환
    • 산업기술연구
    • /
    • 제14권
    • /
    • pp.49-61
    • /
    • 1994
  • This study deals with the automated storage/retrieval systems (AS/RS) where the rack is discrete and the random storage assignment rule is adopted. New storage policies named FNSC (first no-cost zone, second closest-open location) and FNSH (first no-cost zone, second a half side closest-open location) are proposed. Simulation results indicate that performance of FNSH is slightly lower than that of the SCL but it does not need much time to perform. The "stay" strategy of S/R machine is examined as a means of increasing the frequency of dual command.

  • PDF