Optimal Lane Depths for Single and Multiple Products in Block Stacking Storage Systems

摘要

Block Stacking is one of the most common storage methods for warehousing large quantities of palletized or boxed products, when high space utilization is the main concern. Efficient algorithms are currently only available to compute the optimal lane depth for a single product, assuming that all lanes have equal depths. In this paper, an algorithm is presented to compute the optimal number of lanes and the optimal lane depth for a single product, when the lanes are allowed to have different depths. It is shown that the optimal lane depth follow a triangular pattern. The optimal lane depth pattern is compared experimentally with several heuristic patterns. Several near-optimal and efficient heuristics are identified. In most warehouses, the lane depth on each side of a single aisle is kept constant for layout and material flow purposes. An optimal algorithm to assign a single product to such limited number of lane depths is also derived. Based upon this algorithm, a procedure for determining the lane depths and the number of lanes in a warehouse for storing multiple products is developed. If the warehouse is perfectly balanced, then the procedure minimizes the required warehouse area. Keywords: Mathematical modules; Storage and retrieval.