Record Details

Class-based storage-location assignment to minimise pick travel distance

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Class-based storage-location assignment to minimise pick travel distance
 
Creator MUPPANI, VR
ADIL, GK
 
Subject automatic warehousing systems
order index rule
stock location
design
policies
storage planning
class-based storage
storage classes
dynamic programming
branch-and-bound
 
Description Storage-location assignment in warehouses is an important task as it impacts productivity of other warehouse processes. The class-based storage policy distributes the products, among a number of classes, and for each class it reserves a region within the storage area. We propose a nonlinear integer-programming model to the problem of formation of classes and allocation of storage space, considering savings in required storage space, due to random allocation of products within a class. We develop a branch and bound algorithm (BBA) to solve the model and compare it with a benchmark dynamic programming algorithm (DPA). These algorithms are applied to randomly generated data sets and to an industrial case. Computational experience shows that class-based policy can result in shorter pick-travel distances than the dedicated policy. The proposed BBA is found to be computationally much more efficient than DPA.
 
Publisher TAYLOR & FRANCIS LTD
 
Date 2011-08-30T22:09:49Z
2011-12-26T12:59:12Z
2011-12-27T05:50:12Z
2011-08-30T22:09:49Z
2011-12-26T12:59:12Z
2011-12-27T05:50:12Z
2008
 
Type Article
 
Identifier INTERNATIONAL JOURNAL OF LOGISTICS-RESEARCH AND APPLICATIONS, 11(4), 247-265
1367-5567
http://dx.doi.org/10.1080/13675560701690489
http://dspace.library.iitb.ac.in/xmlui/handle/10054/12480
http://hdl.handle.net/10054/12480
 
Language en