Record Details

A branch and bound algorithm for class based storage location assignment

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title A branch and bound algorithm for class based storage location assignment
 
Creator MUPPANI, VR
ADIL, GK
 
Subject automatic warehousing systems
branch and bound
class based storage
order picking
storage space
warehouse storage planning
 
Description 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. (C) 2007
 
Publisher ELSEVIER SCIENCE BV
 
Date 2011-07-22T17:25:42Z
2011-12-26T12:52:30Z
2011-12-27T05:38:19Z
2011-07-22T17:25:42Z
2011-12-26T12:52:30Z
2011-12-27T05:38:19Z
2008
 
Type Article
 
Identifier EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 189(2), 492-507
0377-2217
http://dx.doi.org/10.1016/j.ejor.2007.05.050
http://dspace.library.iitb.ac.in/xmlui/handle/10054/6302
http://hdl.handle.net/10054/6302
 
Language en