Journal ArticleDOI
A model for warehouse layout
Reads0
Chats0
TLDR
Analytical formulas that can be used to calculate the average length of an order picking route under two different routing policies are given and the optimal layout can be determined by using these formulas as the objective function in a nonlinear programming model.Abstract:
This paper describes an approach to determine a layout for the order picking area in warehouses, so that the average travel distance for the order pickers is minimized. We give analytical formulas that can be used to calculate the average length of an order picking route under two different routing policies. The optimal layout can be determined by using these formulas as the objective function in a nonlinear programming model. The optimal number of aisles in an order picking area appears to depend strongly on the required storage space and the pick list size.read more
Citations
More filters
Journal ArticleDOI
Research on warehouse design and performance evaluation: A comprehensive review
TL;DR: A detailed survey of the research on warehouse design, performance evaluation, practical case studies, and computational support tools is presented, including the identification of the limits of previous research and of potential future research directions.
Journal ArticleDOI
Warehousing in the e-commerce era: A survey
TL;DR: This paper discusses suited systems, surveys the relevant literature, and defines future research needs for these warehousing systems especially suited for e-commerce retailers.
Journal ArticleDOI
The impact of order batching and picking area zoning on order picking system performance
Mengfei Yu,René de Koster +1 more
TL;DR: An approximation model based on queuing network theory is proposed to analyze the impact of order batching and picking area zoning on the mean order throughput time in a pick-and-pass order picking system and shows acceptable accuracy for practical purposes.
Journal ArticleDOI
Designing the layout structure of manual order picking areas in warehouses
TL;DR: In this article, the authors present a model that minimizes travel distances in the picking area by identifying an appropriate layout structure consisting of one or more blocks of parallel aisles.
Journal ArticleDOI
A branch and bound algorithm for class based storage location assignment
TL;DR: A nonlinear integer programming model is proposed to capture the above and it is observed that the class based policy results in lower total cost of order picking and storage space than the dedicated policy.
References
More filters
Journal ArticleDOI
Distance approximations for routing manual pickers in a warehouse
TL;DR: In this article, the authors evaluate and compare strategies for routing a manual picker through a simple warehouse, by deriving equations which relate route length to warehouse attributes, and several rules of thumb are derived for selection of order picking strategies and optimization of warehouse shape.
Journal ArticleDOI
Routing order pickers in a warehouse with a middle aisle
TL;DR: An algorithm is presented that can find shortest order picking tours in this type of warehouses and it appears that in many cases the average order picking time can be decreased significantly by adding a middle aisle to the layout.
Journal ArticleDOI
An evaluation of order picking routeing policies
TL;DR: The experimental results clearly indicate that the optimal routeing procedure generates significantly shorter routes than heuristic methods, and the shape of the warehouse and the location of the pick‐up/drop‐off point can affect the picking efficiency.
Journal ArticleDOI
Efficient orderbatching methods in warehouses
TL;DR: In this article, the authors investigated the problem of order batching in warehouses and evaluated two groups of heuristic algorithms: the seed algorithm and the somewhat more complex (and CPU time consuming) Time Savings algorithm.
Journal ArticleDOI
An Evaluation of Routing and Volume‐based Storage Policies in an Order Picking Operation
TL;DR: Experimental results show statistically significant differences in the mean route distance for the routing policies, storage policies, and their interactions and indicates that the choice of certain routing and storage policies in combination can result in increased picking efficiency.