Variable Neighborhood Search strategies for the Order Batching Problem

Computers and Operations Research

Volumn 78, Issue , 2017, Pages 500-512

  Menéndez, Borja ^a   Pardo, Eduardo G ^b   Alonso Ayuso, Antonio ^a   Molina, Elisenda ^c   Duarte, Abraham ^a  

^a UNIVERSIDAD REY JUAN CARLOS   (Spain)

^b UNIVERSIDAD POLITÉCNICA DE MADRID   (Spain)

^c UNIVERSIDAD CARLOS III DE MADRID   (Spain)

Author keywords

Order Batching Problem; Picking process; Variable Neighborhood Search

Indexed keywords

WAREHOUSES;

CAPACITY LIMIT; COMPUTING TIME; NON-PARAMETRIC STATISTICAL TESTS; OPERATIONAL MANAGEMENT; OPTIMIZATION PROBLEMS; ORDER BATCHING; STATE OF THE ART; VARIABLE NEIGHBORHOOD SEARCH;

OPTIMIZATION;

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

References (38)

1. [1] Albareda-Sambola, M., Alonso-Ayuso, A., Molina, E., De Blas, C.S., Variable neighborhood search for order batching in a warehouse. Asia-Pac J Oper Res, 26(05), 2009.
2. [2] Alvim, Adriana CF, Ribeiro, Celso C, Glover, Fred, Aloise, Dario J, A hybrid improvement heuristic for the one-dimensional bin packing problem. J Heuristics 10:2 (2004), 205–229.
3. [3] Coyle JJ, Bardi EJ, Langley CJ. The management of business logistics, vol. 6. Minneapolis/St. Paul: West Publishing Company; 1996.
4. [4] De Koster, M.B.M., Van der Poort, E.S., Wolters, M., Efficient order batching methods in warehouses. Int J Prod Res 37:7 (1999), 1479–1504.
5. [5] De Koster R, Jan Roodbergen K, van Voorden R. Reduction of walking time in the distribution center of de bijenkorf. In: New trends in distribution logistics. Springer Berlin Heidelberg; 1999. p. 215–34.
6. [6] De Koster, R., Le-Duc, T., Roodbergen, K.J., Design and control of warehouse order picking: a literature review. Eur J Oper Res 182:2 (2007), 481–501.
7. [7] Drury, J., Towards more efficient order picking. IMM Monogr, 1, 1988.
8. [8] Duarte, A., Pantrigo, J.J., Pardo, E.G., Sánchez-Oro, J., Parallel variable neighbourhood search strategies for the cutwidth minimization problem. IMA J Manag Math, 2013, 10.1093/imaman/dpt026.
9. [9] Duarte, A., Pantrigo, J.J., Pardo, E.G., Mladenovic, N., Multi-objective variable neighborhood search: an application to combinatorial optimization problems. J Glob Optim 63:3 (2015), 515–536.
10. [10] Gademann, N., Velde, S., Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Trans 37:1 (2005), 63–75.
11. [11] Garey MR, Johnson DS. Computers and intractability: a guide to np-completeness; 1979.
12. [12] Garey MR, Graham RL, Ullman JD. An analysis of some packing algorithms. In: Combinatorial algorithms (Courant computer science symposium, no. 9; 1972); 1973. p. 39–47.
13. [13] Ghiani, G., Laporte, G., Musmanno, R., Introduction to logistics systems planning and control. 2004, John Wiley & Sons.
14. [14] Gibson, D.R., Sharp, G.P., Order batching procedures. Eur J Oper Res 58:1 (1992), 57–67.
15. [15] Glover, F., Laguna, M., Tabu search. 1997, Kluwer Academic Publishers, Norwell, MA, USA [ISBN 079239965X].
16. [16] Goetschalckx, M., Ratliff, H.D., Order picking in an aisle. IIE Trans 20:1 (1988), 53–62.
17. [17] Gu, J., Goetschalckx, M., McGinnis, L.F., Research on warehouse operation: a comprehensive review. Eur J Oper Res 177:1 (2007), 1–21.
18. [18] Gu, J., Goetschalckx, M., McGinnis, L.F., Research on warehouse design and performance evaluation: a comprehensive review. Eur J Oper Res 203:3 (2010), 539–549.
19. [19] Hall, R.W., Distance approximations for routing manual pickers in a warehouse. IIE Trans 25:4 (1993), 76–87.
20. [20] Hansen, P., Mladenović, N., Moreno, P., Variable neighbourhood search: algorithms and applications. Ann Oper Res 175:1 (2010), 367–407.
21. [21] Henn, S., Wäscher, G., Tabu search heuristics for the order batching problem in manual order picking systems. Eur J Oper Res 222:3 (2012), 484–494.
22. [22] Henn, S., Koch, S., Doerner, K., Strauss, C., Wäscher, G., Metaheuristics for the order batching problem in manual order picking systems. BuR Bus Res J, 3(1), 2010.
23. [23] Heragu, S.S., Facilities design, iuniverse. 2006, Lincoln, NE.
24. [24] Ho, Y.-C., Tseng, Y.-Y., A study on order-batching methods of order-picking in a distribution centre with two cross-aisles. Int J Prod Res 44:17 (2006), 3391–3417.
25. [25] Hsu, C.-M., Chen, K.-Y., Chen, M.-C., Batching orders in warehouses by minimizing travel distance with genetic algorithms. Comput Ind 56:2 (2005), 169–178.
26. [26] Karasek, J., An overview of warehouse optimization. Int J Adv Telecommun Electrotech Signals Syst 2:3 (2013), 111–117.
27. [27] Martí R, Moreno-Vega JM, Duarte A. Advanced multi-start methods. In: Handbook of metaheuristics. Springer US, 2010. p. 265–81.
28. [28] Menéndez, B., Pardo, E.G., Duarte, A., Alonso-Ayuso, A., Molina, E., General variable neighborhood search applied to the picking process in a warehouse. Electron Notes Discret Math(47), 2015, 77–84.
29. [29] Mladenović, N., Hansen, P., Variable neighborhood search. Comput Oper Res 24:11 (1997), 1097–1100.
30. [30] Öncan, T., Milp formulations and an iterated local search algorithm with tabu thresholding for the order batching problem. Eur J Oper Res, 2015.
31. [31] Pan, C.-H., Liu, S.-Y., A comparative study of order batching algorithms. Omega 23:6 (1995), 691–700.
32. [32] Pardo, E.G., Mladenović, N., Pantrigo, J.J., Duarte, A., Variable formulation search for the cutwidth minimization problem. Appl Soft Comput 13:5 (2013), 2242–2252.
33. [33] Petersen, C.G., An evaluation of order picking routing policies. Int J Oper Prod Manag 17:11 (1997), 1098–1111.
34. [34] Ratliff, H.D., Rosenthal, A.S., Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Oper Res 31:3 (1983), 507–521.
35. [35] Roodbergen, K.J., De Koster, R., Routing methods for warehouses with multiple cross aisles. Int J Prod Res 39:9 (2001), 1865–1883.
36. [36] Roodbergen KJ, Petersen CG. How to improve order picking efficiency with routing and storage policies. In: Progress in material handling practice; 1999. p. 107–24.
37. [37] Rosenwein, M.B., A comparison of heuristics for the problem of batching orders for warehouse selection. Int J Prod Res 34:3 (1996), 657–664.
38. [38] Wilcoxon, Frank, Individual comparisons by ranking methods. Biometrics bulletin 1:6 (1945), 80–83.