Record Details

Efficient formation of storage classes for warehouse storage location assignment: A simulated annealing approach

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title Efficient formation of storage classes for warehouse storage location assignment: A simulated annealing approach
 
Creator MUPPANI, VR
ADIL, GK
 
Subject retrieval-systems
automatic storage
algorithms
policies
models
order picking
storage-space cost
class-based storage
cube per order index
simulated annealing
 
Description Class-based storage policy distributes products among a number of classes and for each class it reserves a region within the storage area. The procedures reported in the literature for formation of storage classes primarily consider order-picking cost ignoring storage-space cost. Moreover, in these procedures items are ordered on the basis of their cube per order index (COI), and items are then partitioned into classes maintaining this ordering. This excludes many possible product combinations in forming classes which may result in inferior solutions. In this paper, a simulated annealing algorithm (SAA) is developed to solve an integer programming model for class formation and storage assignment that considers all possible product combinations, storage-space cost and order-picking cost. Computational experience on randomly generated data sets and an industrial case shows that SAA gives superior results than the benchmark dynamic programming algorithm for class formation with COI ordering restriction. (c) 2007
 
Publisher PERGAMON-ELSEVIER SCIENCE LTD
 
Date 2011-08-24T05:19:56Z
2011-12-26T12:56:45Z
2011-12-27T05:45:57Z
2011-08-24T05:19:56Z
2011-12-26T12:56:45Z
2011-12-27T05:45:57Z
2008
 
Type Article
 
Identifier OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 36(4), 609-618
0305-0483
http://dx.doi.org/10.1016/j.omega.2007.01.006
http://dspace.library.iitb.ac.in/xmlui/handle/10054/10771
http://hdl.handle.net/10054/10771
 
Language en