Heuristic algorithms for a storage location assignment problem in a chaotic warehouse

The extensive application of emerging technologies is revolutionizing warehouse management. These technologies facilitate working with complex and powerful warehouse management models in which products do not have assigned fixed locations (random storage). Random storage allows the utilization of the available space to be optimized. In this context, and motivated by a real problem, this article presents a model that looks for the optimal allocation of goods in order to maximize the storage space availability within the restrictions of the warehouse. For the proposed model a construction method, a local search algorithm and different metaheuristics have been developed. The introduced algorithms can also be used for other purposes such as to assess when and how it is convenient to perform relocation of stored items to improve the current level of storage space availability. Computational tests performed on a set of randomly generated and real warehouse instances show the effectiveness of the proposed methods.

[1]  Marius M. Solomon,et al.  Dynamic Operational Policies in an Automated Warehouse , 1990 .

[2]  Mats I. Johansson,et al.  Storage Location Assignment: Using the Product Structure to Reduce Order Picking Times , 1996 .

[3]  Gajendra Kumar Adil,et al.  A branch and bound algorithm for class based storage location assignment , 2008, Eur. J. Oper. Res..

[4]  G. Moon,et al.  Effects of relocation to AS/RS storage location policy with production quantity variation , 2001 .

[5]  Francisco Ballestín,et al.  Static and dynamic policies with RFID for the scheduling of retrieval and storage warehouse operations , 2013, Comput. Ind. Eng..

[6]  Lu Chen,et al.  A tabu search algorithm for the relocation problem in a warehousing system , 2011 .

[7]  Antonella Meneghetti,et al.  Multiple-weight unit load storage assignment strategies for energy-efficient automated warehouses , 2014 .

[8]  Sun Hur,et al.  Optimal design of rack structure with modular cell in AS/RS , 2005 .

[9]  Marc Goetschalckx,et al.  Research on warehouse design and performance evaluation: A comprehensive review , 2010, Eur. J. Oper. Res..

[10]  Angel Ruiz,et al.  On storage assignment policies for unit-load automated storage and retrieval systems , 2012 .

[11]  A. Mood,et al.  The statistical sign test. , 1946, Journal of the American Statistical Association.

[12]  Jürgen Zimmermann,et al.  Resource Leveling in Make-to-Order Production : Modeling and Heuristic Solution Method , 2006 .

[13]  E. Rödel,et al.  Fisher, R. A.: Statistical Methods for Research Workers, 14. Aufl., Oliver & Boyd, Edinburgh, London 1970. XIII, 362 S., 12 Abb., 74 Tab., 40 s , 1971 .

[14]  Elena Marchiori,et al.  An Evolutionary Algorithm for Large Scale Set Covering Problems with Application to Airline Crew Scheduling , 2000, EvoWorkshops.

[15]  Gajendra K. Adil,et al.  Formation of storage classes in the presence of space cost for warehouse planning , 2006 .

[16]  P. C. Schuur,et al.  Mathematical model for warehouse design and product allocation , 2005 .

[17]  L. W. Jacobs,et al.  Note: A local-search heuristic for large set-covering problems , 1995 .

[18]  Venkata Reddy Muppani,et al.  Efficient formation of storage classes for warehouse storage location assignment: A simulated annealing approach , 2008 .

[19]  M. Kendall.  Statistical Methods for Research Workers , 1937, Nature.

[20]  Marc Goetschalckx,et al.  Research on warehouse operation: A comprehensive review , 2007, Eur. J. Oper. Res..

[21]  Héctor J. Carlo,et al.  Toward perpetually organized unit-load warehouses , 2012, Comput. Ind. Eng..