A branch and bound algorithm for class based storage location assignment

Class-based storage implementation decisions have significant impact on the required storage space and the material handling cost in a warehouse. In this paper, a nonlinear integer programming model is proposed to capture the above. Effects of storage area reduction on order picking and storage spac...

Full description

Saved in:
Bibliographic Details
Published in:European journal of operational research 2008-09, Vol.189 (2), p.492-507
Main Authors: Muppani (Muppant), Venkata Reddy, Adil, Gajendra Kumar
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
Branch & bound algorithms
Branch and bound
Class based storage
Cost reduction
Exact sciences and technology
Firm modelling
Integer programming
Operational research and scientific management
Operational research. Management science
Order picking
Storage
Storage space
Studies
Warehouse storage planning
Warehouses
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Class-based storage implementation decisions have significant impact on the required storage space and the material handling cost in a warehouse. In this paper, a nonlinear integer programming model is proposed to capture the above. Effects of storage area reduction on order picking and storage space cost are incorporated. A branch and bound algorithm is developed to solve the model. Computational experience with randomly generated data sets and an industrial case shows that branch and bound algorithm is computationally more efficient than a baseline dynamic programming algorithm. It is further observed that the class based policy results in lower total cost of order picking and storage space than the dedicated policy.
ISSN:0377-2217
1872-6860
DOI:10.1016/j.ejor.2007.05.050