Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints

Abstract One of the most significant activities in warehouse management concerns the allocation of products to the storage positions. This problem is known in the literature as the Product Allocation Problem (PAP). It mainly aims to optimize both the warehouse space utilization and the products handling costs (at least 40% of the total logistics cost). This paper addresses the PAP in a multi-layer warehouse, with compatibility constraints among the product classes. It has already been addressed from a modeling point of view in the literature and it has been formulated as a Mixed Integer Linear Programming model. However, solving the problem to optimality becomes impracticable in real-life settings. To this purpose, an Iterated Local Search-based Heuristic ( ILS ) and a Cluster-based Heuristic ( CH ) have already been proposed in the literature. This paper presents a Rollout-based heuristic whose performances are evaluated on the basis of a detailed computational phase, including also a real case study and compared with those of both the ILS and the CH , in terms of the computational times and the quality of the final solutions.

[1]  Marc Goetschalckx,et al.  Shared Storage Policies Based on the Duration Stay of Unit Loads , 1990 .

[2]  Roberto Musmanno,et al.  Introduction to Logistics Systems Management: Ghiani/Introduction to Logistics Systems Management , 2013 .

[3]  Riccardo Manzini,et al.  A decision-support system for the design and management of warehousing systems , 2014, Comput. Ind..

[4]  Nicola Secomandi,et al.  A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands , 2001, Oper. Res..

[5]  Adamo Bosco,et al.  A stochastic inventory routing problem with stock-out , 2013 .

[6]  Gianpaolo Ghiani,et al.  Introduction to Logistics Systems Management , 2013 .

[7]  Roberto Musmanno,et al.  New Rollout Algorithms for Combinatorial Optimization Problems , 2002, Optim. Methods Softw..

[8]  Moshe B. Rosenwein,et al.  AN APPLICATION OF CLUSTER ANALYSIS TO THE PROBLEM OF LOCATING ITEMS WITHIN A WAREHOUSE , 1994 .

[9]  E. C. Marcoulaki,et al.  Warehouse Management for Improved Order Picking Performance: An Application Case Study From the Wood Industry , 2005 .

[10]  Ya-Juei Jeffrey Tzen,et al.  Improving storage and order picking in a person-on-board as/r system: A case study , 1988 .

[11]  John N. Tsitsiklis,et al.  Rollout Algorithms for Combinatorial Optimization , 1997, J. Heuristics.

[12]  Gerhard Wäscher,et al.  Order Picking: A Survey of Planning Problems and Methods , 2004 .

[13]  Mauricio G. C. Resende,et al.  Designing and reporting on computational experiments with heuristic methods , 1995, J. Heuristics.

[14]  Francesca Guerriero,et al.  A cooperative parallel rollout algorithm for the sequential ordering problem , 2003, Parallel Comput..

[15]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[16]  T. NICK LARSON,et al.  A heuristic approach to warehouse layout with class-based storage , 1997 .

[17]  Daniele Vigo,et al.  The Three-Dimensional Bin Packing Problem , 2000, Oper. Res..

[18]  Roberto Musmanno,et al.  A mathematical model for the Multi-Levels Product Allocation Problem in a warehouse with compatibility constraints , 2013 .

[19]  Francesca Guerriero,et al.  Parallelization Strategies for Rollout Algorithms , 2005, Comput. Optim. Appl..

[20]  M.-K. Lee *,et al.  Optimization of warehouse storage capacity under a dedicated storage policy , 2005 .

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

[22]  Umut Rifat Tuzkaya,et al.  A particle swarm optimization algorithm for the multiple-level warehouse layout design problem , 2008, Comput. Ind. Eng..

[23]  Mark Goh,et al.  Three-dimensional bin packing problem with variable bin height , 2010, Eur. J. Oper. Res..

[24]  Marco Bortolini,et al.  A hierarchical procedure for storage allocation and assignment within an order-picking system. A case study , 2012 .

[25]  D. Van Oudheusden,et al.  Storage layout of AS/RS racks based on recurrent orders , 1992 .

[26]  F. Guerriero.  Hybrid Rollout Approaches for the Job Shop Scheduling Problem , 2008 .