MILP formulations and an Iterated Local Search Algorithm with Tabu Thresholding for the Order Batching Problem

Abstract In this work we deal with the Order Batching Problem (OBP) considering traversal, return and midpoint routing policies. For the first time, we introduce Mixed Integer Linear Programming (MILP) formulations for these three variants of the OBP. We also suggest an efficient Iterated Local Search Algorithm with Tabu Thresholding (ILST). According to our extensive computational experiments on standard and randomly generated instances we can say that the proposed ILST yields an outstanding performance in terms of both accuracy and efficiency.

[1]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[2]  H. Paessens,et al.  The savings algorithm for the vehicle routing problem , 1988 .

[3]  Verena Schmid,et al.  Metaheuristics for order batching and sequencing in manual order picking systems , 2013, Comput. Ind. Eng..

[4]  Paolo Toth,et al.  Algorithms and codes for the assignment problem , 1988 .

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

[6]  Kees Jan Roodbergen,et al.  Design and control of warehouse order picking: A literature review , 2006, Eur. J. Oper. Res..

[7]  Temel Öncan,et al.  The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm , 2010, Comput. Oper. Res..

[8]  Jari Saarinen,et al.  A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse , 2014, Eur. J. Oper. Res..

[9]  Gerhard Wäscher,et al.  Tabu search heuristics for the order batching problem in manual order picking systems , 2012, Eur. J. Oper. Res..

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

[11]  A.J.R.M. Gademann,et al.  An order batching algorithm for wave picking in a parallel-aisle warehouse , 1996 .

[12]  Fred W. Glover,et al.  Tabu Thresholding: Improved Search by Nonmonotonic Trajectories , 1995, INFORMS J. Comput..

[13]  Sebastian Henn,et al.  Algorithms for on-line order batching in an order picking warehouse , 2012, Comput. Oper. Res..

[14]  H. D. Ratliff,et al.  Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem , 1983, Oper. Res..

[15]  Gunter P. Sharp,et al.  Order batching procedures , 1992 .

[16]  Mu-Chen Chen,et al.  An association-based clustering approach to order batching considering customer demand patterns , 2005 .

[17]  Kees Jan Roodbergen,et al.  Routing methods for warehouses with multiple cross aisles , 2001 .

[18]  Elsayed A. Elsayed,et al.  Algorithms for optimal material handling in automatic warehousing systems , 1981 .

[19]  Gilbert Laporte,et al.  Rich routing problems arising in supply chain management , 2013, Eur. J. Oper. Res..

[20]  M. B. M. de Koster,et al.  Efficient orderbatching methods in warehouses , 1999 .

[21]  Peter Baker,et al.  Warehouse design: A structured approach , 2009, Eur. J. Oper. Res..

[22]  J. W. Kile,et al.  Order batching in walk-and-pick order picking systems , 2008 .

[23]  Helena Ramalhinho Dias Lourenço,et al.  Iterated Local Search , 2001, Handbook of Metaheuristics.

[24]  NOUD GADEMANN,et al.  Order batching to minimize total travel time in a parallel-aisle warehouse , 2005 .

[25]  Mu-Chen Chen,et al.  Aggregation of orders in distribution centers using data mining , 2005, Expert Syst. Appl..

[26]  René M. B. M. de Koster,et al.  A review on stochastic models and analysis of warehouse operations , 2011, Logist. Res..

[27]  H. Hwang *,et al.  Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system , 2005 .

[28]  Clara Simón de Blas,et al.  Variable Neighborhood Search for Order Batching in a Warehouse , 2009, Asia Pac. J. Oper. Res..

[29]  Chih-Ming Hsu,et al.  Batching orders in warehouses by minimizing travel distance with genetic algorithms , 2005, Comput. Ind..

[30]  Charles G. Petersen.  An evaluation of order picking routeing policies , 1997 .

[31]  B. Sarker,et al.  A similarity coefficient measure and machine-parts grouping in cellular manufacturing systems , 2000 .

[32]  H D Ratliff,et al.  Order Picking In An Aisle , 1988 .

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

[34]  Randolph W. Hall,et al.  DISTANCE APPROXIMATIONS FOR ROUTING MANUAL PICKERS IN A WAREHOUSE , 1993 .

[35]  Karl F. Doerner,et al.  Metaheuristics for the Order Batching Problem in Manual Order Picking Systems , 2010 .

[36]  Celso C. Ribeiro,et al.  TTT plots: a perl program to create time-to-target plots , 2007, Optim. Lett..

[37]  Temel Öncan,et al.  VLSN search algorithms for partitioning problems using matching neighbourhoods , 2008, J. Oper. Res. Soc..

[38]  Brett A. Peters,et al.  Batch picking in narrow-aisle order picking systems with consideration for picker blocking , 2012, Eur. J. Oper. Res..

[39]  F. Robert Jacobs,et al.  Batch Construction Heuristics and Storage Assignment Strategies for Walk/Rideand Pick Systems , 1999 .