Algorithms for on-line order batching in an order picking warehouse

Computers and Operations Research

Volumn 39, Issue 11, 2012, Pages 2549-2563

  Henn, Sebastian ^a  

^a OTTO VON GUERICKE UNIVERSITY   (Germany)

Author keywords

On line optimization; Order batching; Order picking; Warehouse management

Indexed keywords

COMPETITIVE ANALYSIS; COMPETITIVE RATIO; COMPLETION TIME; CUSTOMER ORDERS; HEURISTIC APPROACH; LOWER AND UPPER BOUNDS; NUMERICAL EXPERIMENTS; ONLINE OPTIMIZATION; ORDER BATCHING; ORDER PICKERS; ORDER PICKING; RIDE-THROUGH; SUBSTANTIAL REDUCTION; TIME-PERIODS; WAREHOUSE MANAGEMENT;

ALGORITHMS; CUSTOMER SATISFACTION; HEURISTIC METHODS; WAREHOUSES;

SALES;

EID: 84859704879     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2011.12.019     Document Type: Article

References (32)

1. R. de Koster, T. Le-Duc, and K. Roodbergen Design and control of warehouse order picking: a literature review European Journal of Operational Research 182 2 2007 481 501 (Pubitemid 46661887)
2. G. Wäscher Order picking: a survey of planning problems and methods H. Dyckhoff, R. Lackes, J. Reese, Supply chain management and reverse logistics 2004 Springer Berlin 323 347
3. F. Caron, G. Marchet, and A. Perego Routing policies and COI-based storage policies in picker-to-part systems International Journal of Production Research 36 3 1998 713 732 (Pubitemid 128554497)
4. R. de Koster, K. Roodbergen, and R. van Voorden Reduction of walking time in the distribution center of De Bijenkorf M. Speranza, P. Stähly, New trends in distribution logistics 1999 Springer Berlin 215 234
5. M. Yu, and R. de Koster The impact of order batching and picking area zoning on order picking system performance European Journal of Operational Research 198 2 2009 480 490
6. H. Ratliff, and A. Rosenthal Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem Operations Research 31 2 1983 507 521 (Pubitemid 13576748)
7. E. Chew, and L. Tang Travel time analysis for general item location assignment in a rectangular warehouse European Journal of Operational Research 112 3 1999 582 597
8. N. Gademann, and S. van de Velde Order batching to minimize total travel time in a parallel-aisle warehouse IIE Transactions 37 1 2005 63 75 (Pubitemid 40085426)
9. Y. Bozer, and J. Kile Order batching in walk-and-pick order picking systems International Journal of Production Research 46 7 2008 1887 1909 (Pubitemid 351270694)
10. D. Gibson, and G. Sharp Order batching procedures European Journal of Operational Research 58 1 1992 57 67
11. E. Elsayed Algorithms for optimal material handling in automatic warehousing systems International Journal of Production Research 19 5 1981 525 535 (Pubitemid 12553033)
12. Y.C. Ho, T.S. Su, and Z.B. Shi Order-batching methods for an order-picking warehouse with two cross aisles Computers & Industrial Engineering 55 2 2008 321 347
13. G. Clarke, and J. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 4 1964 568 581
14. M. de Koster, E. van der Poort, and M. Wolters Efficient orderbatching methods in warehouses International Journal of Production Research 37 7 1999 1479 1504
15. C. Hsu, K. Chen, and M. Chen Batching orders in warehouses by minimizing travel distance with genetic algorithms Computers in Industry 56 2 2005 169 178 (Pubitemid 40206235)
16. C.Y. Tsai, J. Liou, and T.M. Huang Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time International Journal of Production Research 46 22 2008 6533 6555
17. S. Henn, S. Koch, K. Doerner, C. Strauss, and G. Wäscher Metaheuristics for the order batching problem in manual order picking systems BuR: Business Research 3 1 2010 82 105
18. N. Kamin On-line optimization of order picking in an automated warehouse 1998 Shaker Aachen
19. J. Won, and S. Olafsson Joint order batching and order picking in warehouse operations International Journal of Production Research 43 7 2005 1427 1442 (Pubitemid 41633064)
20. E. Elsayed, and M.K. Lee Order processing in automated storage/retrieval systems with due dates IIE Transactions 28 7 1996 567 577 (Pubitemid 126760592)
21. I. van Nieuwenhuyse, and R. de Koster Evaluating order throughput time in 2-block warehouses with time window batching International Journal of Production Economics 121 2009 654 664
22. T. Le-Duc, and R. de Koster Travel time estimation and order batching in a 2-block warehouse European Journal of Operational Research 176 1 2007 374 388 (Pubitemid 44442714)
23. G. Zhang, X. Cai, C.Y. Lee, and C. Wong On-line algorithms for minimizing makespan on batch processing machines Naval Research Logistics 48 3 2001 241 258 (Pubitemid 32286988)
24. C. Poon, and W. Yu On-line scheduling algorithms for a batch machine with finite capacity Journal of Combinatorial Optimization 9 2005 167 186 (Pubitemid 41227415)
25. N. Ascheuer, S. Krumke, and J. Rambau Online dial-A-ride problems: minimizing the completion time H. Reichel, S. Tison, Proceedings of the 17th symposium on theoretical aspects of computer science, Lecture notes in computer science vol. 1770 2000 Springer Berlin 639 650
26. E. Feuerstein, and L. Stougie On-line single-server dial-a-ride problems Theoretical Computer Science 268 2001 91 105 (Pubitemid 32866936)
27. R. Hall Distance approximations for routing manual pickers in a warehouse IIE Transactions 25 4 1993 76 87
28. A. Fiat, and G. Woeginger Competitive analysis of algorithms A. Fiat, G. Woeginger, Online algorithms: the state of the art, Lecture notes in computer science vol. 1442 1998 Springer 1 12 (Pubitemid 128123710)
29. D. Sleator, and R. Tarjan Amortized efficiency of list update and paging rules Communications of the ACM 28 2 1985 202 208 (Pubitemid 15514486)
30. E. Angelelli, G. Speranza, and M. Savelsbergh Competitive analysis for dynamic multiperiod uncapacitated routing problems Networks 49 4 2007 308 317 (Pubitemid 47324737)
31. B. Gfeller, L. Peeters, B. Weber, and P. Widmayer Online single machine batch scheduling R. Kralovic, P. Urzyczyn, Mathematical foundations of computer science 2006, 31st international symposium, Lecture notes in computer science vol. 4162 2006 Springer 424 435 (Pubitemid 44577934)
32. S. Krumke, W. de Paepe, D. Poensgen, M. Lipmann, A. Marchetti-Spaccamela, and L. Stougie On minimizing the maximum flow time in the online dial-a-ride problem T. Erlebach, G. Persiano, Approximation and online algorithms, approximation and online algorithms, third international workshop, WAOA 2005, Lecture notes in computer science vol. 3879 2006 258 269 (Pubitemid 43987061)