31,270 research outputs found

    Estimating travel times in dual shuttle AS/RSs.: A revised approach

    Get PDF
    Automated Storage and Retrieval Systems (AS/RSs) effectively support warehouse operations in order to increase production and logistics efficiency. Literature about travel time computation in multi-shuttle AS/RSs still needs to be enhanced since most of the existing contributions rely on the same formulation, namely the Meller and Mungwattana’s equation. Based on well-established theoretical assumptions and on a simulation model, the present work puts forward a revised version of the Meller and Mungwattana’s formula for dual shuttle systems. In particular, the constant factor multiplying the travel between time is replaced by a coefficient depending on the rack configuration and on the input and output points of the storage system. The new equation is tested against widely applied models for AS/RS travel time calculation and proves to result in shorter times than the original Meller and Mungwattana’s equation. A linear regression analysis is completed in order to find a numerical formulation of the proposed coefficient. Taking into account some key physical characteristics of a warehouse while estimating travel times allows improving the design and management of storage areas. Future research will focus on deepening multi-shuttle travel time calculation by addressing crane acceleration and deceleration, different rack and crane configurations, as well as class-based storage

    A survey on performance analysis of warehouse carousel systems

    Get PDF
    This paper gives an overview of recent research on the performance evaluation and design of carousel systems. We discuss picking strategies for problems involving one carousel, consider the throughput of the system for problems involving two carousels, give an overview of related problems in this area, and present an extensive literature review. Emphasis has been given on future research directions in this area

    On the Determinations of Class-Based Storage Assignments in AS/RS having two I/O Locations

    Get PDF
    This paper presents the use and extension of a geometrical-based algorithmic approach for determining the expected S/R machine cycle times, and therefore warehouse throughput, for class-based storage assignment layouts in an AS/RS.The approach was designed for the purpose of solving a practical storage assignment design problem for a major European manufacturer.The algorithm may be used to layout racks that are either "square-in-time (SIT)" or "non-square in time (NSIT)" with single or multiple I/O points.It is believed that use of this approach can result in the expedient evaluation of warehouse throughput resulting from new layouts, or re-layouts, of AS/R system racks, thus making these systems more appealing for use in integrated supply chain systems in general.production management;manufacturing;supply chain mangement;warehousing;storage

    Optimal Storage Rack Design for a 3-dimensional Compact AS/RS

    Get PDF
    In this paper, we consider a newly-designed compact three-dimensional automated storage and retrieval system (AS/RS). The system consists of an automated crane taking care of movements in the horizontal and vertical direction. A gravity conveying mechanism takes care of the depth movement. Our research objective is to analyze the system performance and optimally dimension of the system. We estimate the crane’s expected travel time for single-command cycles. From the expected travel time, we calculate the optimal ratio between three dimensions that minimizes the travel time for a random storage strategy. In addition, we derive an approximate closed-form travel time expression for dual command cycles. Finally, we illustrate the findings of the study by a practical example.AS/RS;Warehousing;Order Picking;Travel Time Model;Compact Storage Rack Design

    A Gemoetrical Approach to Computing Expected Cycle Times for Class-Based Storage Layouts in AS/RS

    Get PDF
    An exact, geometry-based analytical model is presented that can be used to compute the expected cycle time for a storage/retrieval (S/R) machine, executing single-commands, dual-commands, or both, in a rack structure that has been laid out in pre-specified storage zones for classes of goods.The rack may be either square-in-time or non-square-in-time.The approach is intuitively appealing, and it does not assume any certain layout shape, such as traditional "L-shaped" class layouts.The model has been coded in Turbo Pascal, and can be used by designers as a tool for quickly evaluating alternative layout configurations with respect to expected S/R cycle time in an AS/RS, and thereby the throughput of an automated warehouse over time.This model has been successfully applied in a major manufacturing plant in Europe to evaluate reconfigurations of their rack storage layouts over the past five years.Automated storage and retrieval systems;AS/RS;class-based storage.

    Optimal Storage Rack Design for a 3D Compact AS/RS with Full Turnover-Based Storage

    Get PDF
    Compact, multi-deep (3D) automated storage and retrieval systems (AS/RS) are becoming increasingly popular for storing products with relatively low turnover on a compact area. An automated storage/retrieval crane takes care of movements in the horizontal and vertical direction in the rack, and a gravity conveying mechanism takes care of the depth movement. An important question is how to layout such systems to minimize the product storage and retrieval times. Although much attention has been paid to 2D AS/RS, multi-deep systems have hardly been studied. This paper studies the impact of system layout on crane travel time. We calculate the rack dimensions that minimize single-command cycle time under the full-turnover-based storage policy. We prove the expected travel time is minimized when the rack is square-in-time in horizontal and vertical directions and the conveyor’s dimension is the longest. We compare the model’s results with the performance of the random storage policy and show a significant crane travel time reduction can be obtained. We illustrate the findings of the study by applying them in a practical example.AS/RS;Warehousing;Order Picking;Storage Rack Design;Travel Time Model;Turnover-Based Storage

    Design and Control of Warehouse Order Picking: a literature review

    Get PDF
    Order picking has long been identified as the most labour-intensive and costly activity for almost every warehouse; the cost of order picking is estimated to be as much as 55% of the total warehouse operating expense. Any underperformance in order picking can lead to unsatisfactory service and high operational cost for its warehouse, and consequently for the whole supply chain. In order to operate efficiently, the orderpicking process needs to be robustly designed and optimally controlled. This paper gives a literature overview on typical decision problems in design and control of manual order-picking processes. We focus on optimal (internal) layout design, storage assignment methods, routing methods, order batching and zoning. The research in this area has grown rapidly recently. Still, combinations of the above areas have hardly been explored. Order-picking system developments in practice lead to promising new research directions.Order picking;Logistics;Warehouse Management

    Optimal Zone Boundaries for Two-class-based Compact 3D AS/RS

    Get PDF
    Compact, multi-deep (3D), Automated Storage and Retrieval Systems (AS/RS) are becoming more common, due to new technologies, lower investment costs, time efficiency and compact size. Decision-making research on these systems is still in its infancy. We study a particular compact system with rotating conveyors for the depth movement and a Storage/Retrieval (S/R) machine for the horizontal and vertical movement of unit loads. We determine the optimal storage zone boundaries for such systems with two product classes: high and low turnover, by minimizing the expected Storage/Retrieval (S/R) machine travel time. We propose a mixed-integer nonlinear programming model to determine the zone boundaries. A decomposition algorithm and a one dimensional search scheme are developed to solve the model. The algorithm is complex, but the results are appealing since most of them are in closed-form and easy to apply to optimally layout the 3D AS/RS rack. The results are compared with those under random storage, and show that a significant reduction of the machine travel time can be obtained. Finally, a practical example is studied to demonstrate the use and validate our findings.AS/RS;Class-based storage;Order picking;Storage rack design;Travel time model
    corecore