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

European Journal of Operational Research

Volumn 243, Issue 1, 2015, Pages 142-155

  Öncan, Temel ^a  

^a GALATASARAY UNIVERSITY   (Turkey)

Author keywords

Local search; Mixed Integer Linear Programming; Order Batching Problem; Warehouse management

Indexed keywords

LEARNING ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); WAREHOUSES;

COMPUTATIONAL EXPERIMENT; ITERATED LOCAL SEARCH; LOCAL SEARCH; MILP FORMULATION; MIXED INTEGER LINEAR PROGRAMMING; ORDER BATCHING; ROUTING POLICIES; WAREHOUSE MANAGEMENT;

INTEGER PROGRAMMING;

EID: 84921437693     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2014.11.025     Document Type: Article

References (44)

1. Aiex R.M., Resende M.G.C., and Ribeiro C.C. TTT plots: A perl program to create time-to-target plots Optimization Letters 1 2007 355 366
2. Albareda-Sambola M., Alonso-Ayuso M., Molina E., and Simon de Blas C. Variable neighborhood search for order batching in a warehouse Asia-Pacific Journal of Operational Research 26 5 2009 655 683
3. Baker P., and Canessa M. Warehouse design: A structured approach European Journal of Operational Research 193 2009 425 436
4. Bozer Y.A., and Kile J.W. Order batching in walk-and-pick order picking systems International Journal of Production Research 46 7 2008 1887 1909
5. Carpaneto G., Martello S., and Toth P. Algorithms and codes for the assignment problem Annals of Operations Research 13 1988 193 223
6. Chen M.-C., Huang C.-L., Chen K.-Y., and Wu H.-P. Aggregation of orders in distribution centers using data mining Expert Systems with Applications 28 3 2005 453 460
7. Chen M.-C., and Wu H.-P. An association-based clustering approach to order batching considering customer demand patterns Omega - The International Journal of Management Science 33 4 2005 333 343
8. Clarke G., and Wright J.W. Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 4 1964 568 581
9. de Koster R., Le-Duc T., and Roodbergen K.J. Design and control of warehouse order picking: A literature review European Journal of Operational Research 182 2007 481 501
10. de Koster R., Van Der Poort E., and Wolters M. Efficient order batching methods in warehouses International Journal of Production Research 37 7 1999 1479 1504
11. Drury, J. (1988). Towards more efficient order picking. IMM monograph No. 1. Cranfield, UK: The Institute of Materials Managements.
12. Elsayed E.A. Algorithms for optimal material handling in automatic warehousing systems International Journal of Production Research 19 5 1981 525 535
13. Gademann N., Van den Berg J., and Hoff H. An order batching algorithm for wave picking in a parallel-aisle warehouse IIE Transactions 33 5 2001 385 398
14. Gademann N., and Van de Velde S. Order batching to minimize total travel time in a parallel-aisle warehouse IIE Transactions 37 1 2005 63 75
15. Gibson D.R., and Sharp G.P. Order batching procedures European Journal of Operational Research 58 1992 57 67
16. Glover F. Tabu thresholding: Improved search by nonmonotonic trajectories ORSA Journal on Computing 7 1995 426 442
17. Goetschalckx M., and Ratliff H.D. Order picking in an aisle IIE Transactions 20 1 1998 53 62
18. Gong Y., and de Koster R.B.M. A review on stochastic models and analysis on warehouse operations Logistics Research 3 4 2013 191 205
19. Gu J., Goetschalckx M., and McGinnis L. Research on warehouse operation: A comprehensive review European Journal of Operational Research 177 2007 1 21
20. Gu J., Goetschalckx M., and McGinnis L. Research on warehouse design and performance evaluation: A comprehensive review European Journal of Operational Research 203 2010 539 549
21. Hall R.W. Distance approximations for routing manual pickers in a warehouse IIE Transactions 24 4 1993 76 87
22. Henn S. Algorithms for on-line order batching in an order picking warehouse Computers and Operations Research 39 2012 2549 2563
23. Henn, S. (2014). Test instances for the order batching problem in manual order picking systems. http://www.mansci.ovgu.de/Forschung/Materialien/2012+-+II-.html Accessed 20.08.14.
24. Henn S., Koch S., Doerner K., Strauss K., and Wäscher G. Metaheuristics for the order batching problem in manuel order picking systems BuR - Business Research 3 1 2010 82 105
25. Henn S., and Schmid V. Metaheuristics for order batching and sequencing in manual order picking systems Computers and Industrial Engineering 66 2013 338 351
26. Henn S., and Wäscher G. Tabu search heuristics for the order batching problem in manual order picking systems European Journal of Operational Research 222 2012 484 494
27. Hong S., Johnson A.L., and Peters B.A. Batch picking in narrow-aisle order picking systems with consideration for picker blocking European Journal of Operational Research 221 2012 557 570
28. Hoos H.H., and Stützle T. Evaluation Las Vegas - Pitfalls and remedies G. Cooper, S. Moral, Proceedings of the 14th conference on uncertainty in artificial intelligence 1998 Morgan Kaufmann Publishers San Francisco, CA 238 245
29. Hsu C.-M., Chen K.-Y., and Chen M.-C. Batching orders in warehouses by minimizing travel distance with genetic algorithms Computers in Industry 56 2 2005 169 178
30. Hwang H., and Kim D.G. Order-batching heuristics based on cluster analysis in low-level picker-to-part warehousing system International Journal of Production Research 43 17 2005 3657 3670
31. Islam K.M.S., and Sarker B.R. A similarity coefficient measure and machine-parts grouping in cellular manufacturing systems International Journal of Production Research 38 3 2000 699 720
32. Kaveh, A. Punnen, A. P. (2008). Randomized local search and improved solutions for microarray layout QAP. Research Report. SFU Surrey, Department of Mathematics.
33. Lourenço H.R., Martin O., and Stützle T. Iterated local search F. Glover, G. Kochenberger, Handbook of metaheuristics 2003 Kluwer Academic Publishers Dordrecht 321 353
34. Matusiak M., de Koster R., Kroon L., and Saarinen J. A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse European Journal of Operational Research 236 3 2014 968 977
35. Öncan T., Kabadi S.N., Nair K.P.K., and Punnen A.P. VLSN search algorithms for partitioning problems using matching neighborhoods Journal of the Operational Research Society 59 2008 388 398
36. Öncan T., and Punnen A.P. The quadratic minimum spanning tree problem: A lower bounding procedure and an efficient search algorithm Computers and Operations Research 37 2010 1762 1773
37. Paessens H. The savings algorithm for the vehicle routing problem European Journal of Operational Research 34 1988 336 344
38. Petersen C.G. An evaluation of order picking routeing policies International Journal of Operations and Production Management 17 11 1997 1098 1111
39. Ratliff H.D., and Rosenthal A.S. Orderpicking in a rectangular warehouse: Aa solvable case of the traveling salesman problem Operations Research 31 1983 507 521
40. Roodbergen K.J., and de Koster R. Routing methods for warehouses with multiple cross aisles International Journal of Production Research 39 9 2001 1865 1883
41. Ruben R.A., and Jacobs F.R. Batch construction and storage assignment Management Science 45 4 1999 575 596
42. Schmid V., Doerner K.F., and Laporte G. Rich routing problems arising in supply chain management European Journal of Operational Research 224 2013 435 448
43. Tompkins J.A., White J.A., Bozer Y.A., and Tanchoco J.M.A. Facilities planning 3rd ed. 2003 John Wiley & Sons New Jersey
44. Wäscher G. Order picking: A survey of planning problems and methods H. Dyckhoff, R. Lackes, J. Reeves, Supply chain management and reverse logistics 2004 Springer Berlin 323 347