A tabu search approach to solving the picking routing problem for large- and medium-size distribution centres considering the availability of inventory and K heterogeneous material handling equipment

Applied Soft Computing Journal

Volumn 53, Issue , 2017, Pages 61-73

  Cortés, Pablo ^a   Gómez Montoya, Rodrigo A ^b   Muñuzuri, Jesús ^a   Correa Espinal, Alexander ^b  

^a UNIVERSIDAD DE SEVILLA   (Spain)

^b UNIVERSIDAD NACIONAL DE COLOMBIA   (Colombia)

Author keywords

Metaheuristic; Picking; Routing; Split plot design; Tabu search; Warehouse management system

Indexed keywords

BENCHMARKING; EQUIPMENT; GENETIC ALGORITHMS; HEURISTIC ALGORITHMS; MATERIALS HANDLING EQUIPMENT; SIMULATED ANNEALING; SIZE DISTRIBUTION; TABU SEARCH; WAREHOUSES;

METAHEURISTIC; PICKING; ROUTING; SPLIT PLOT DESIGNS; WAREHOUSE MANAGEMENT SYSTEMS;

MATERIALS HANDLING;

EID: 85008674642     PISSN: 15684946     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.asoc.2016.12.026     Document Type: Article

References (28)

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), 655–683, 10.1142/S0217595909002390.
2. [2] Battini, D., Calzavara, M., Persona, A., Sgarbossa, F., Order picking system design: the storage assignment and travel distance estimation (SA&TDE) joint method. Int. J. Prod. Res. 53:4 (2015), 1077–1093, 10.1080/00207543.2014.944282.
3. [3] Bartholdi, J.J., Hackman, S.T., Warehouse & Distribution Science: Release 0.96. 2014, The Supply Chain and Logistics Institute.
4. [4] Brandão, J., A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Comput. Oper. Res. 38:1 (2011), 140–151, 10.1016/j.cor.2010.04.008.
5. [5] Caron, F., Marchet, G., Perego, A., Routing policies and COI-based storage policies in picker-to-part systems. Int. J. Prod. Res. 36:3 (1998), 713–732, 10.1080/002075498193651.
6. [6] Chen, F., Wang, H., Qi, C., Xie, Y., An ant colony optimization routing algorithm for two order pickers with congestion consideration. Comput. Ind. Eng. 66:1 (2013), 77–85, 10.1016/j.cie.2013.06.013.
7. [7] Chen, F., Wang, H., Xie, Y., Qi, C., An ACO-based online routing method for multiple order pickers with congestion consideration in warehouse. J. Intell. Manuf., 1–20, 2014, 10.1007/s10845-014-0871-1.
8. [8] Cheng, C.-Y., Chen, Y.-Y., Chen, T.-L., Jung-Woon Yoo, J., Using a hybrid approach based on the particle swarm optimization and ant colony optimization to solve a joint order batching and picker routing problem. Decision models for the design, optimization and management of warehousing and material handling systems. Int. J. Prod. Econ. 170:Part C (2015), 805–814, 10.1016/j.ijpe.2015.03.021.
9. [9] Daniels, R.L., Rummel, J.L., Schantz, R., A model for warehouse order picking. Eur. J. Oper. Res. 105:1 (1998), 1–17, 10.1016/S0377-2217(97)00043-X.
10. [10] 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, 10.1016/j.ejor.2006.07.009.
11. [11] Henn, S., Algorithms for on-line order batching in an order picking warehouse. Comput. Oper. Res. 39:11 (2012), 2549–2563, 10.1016/j.cor.2011.12.019.
12. [13] Henn, S., Schmid, V., Metaheuristics for order batching and sequencing in manual order picking systems. Comput. Ind. Eng. 66:2 (2013), 338–351, 10.1016/j.cie.2013.07.003.
13. [14] 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, 10.1016/j.ejor.2012.05.049.
14. [15] Hong, S., Johnson, A., Peters, B., Large-scale order batching in parallelaisle picking systems. IIE Trans. 44:4 (2012), 88–106.
15. [16] Kulak, O., Sahin, Y., Taner, M.E., Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms. Flexible Serv. Manuf. J. 24:1 (2012), 52–80, 10.1007/s10696-011-9101-8.
16. [17] Kuo, R.J., Kuo, P.H., Chen, Y.R., Zulvia, F.E., Application of metaheuristics-based clustering algorithm to item assignment in a synchronized zone order picking system. Appl. Soft Comput. 46 (2016), 143–150.
17. [18] Leung, S.C.H., Zhang, Z., Zhang, D., Hua, X., Lim, M.K., A meta-heuristic algorithm for heterogeneous fleet vehicle routing problems with two-dimensional loading constraints. Eur. J. Oper. Res. 225:2 (2013), 199–210, 10.1016/j.ejor.2012.09.023.
18. [19] Lin, Kang, J.-R., Hou, C.-C., Cheng, C.-Y., Joint order batching and picker Manhattan routing problem. Comput. Ind. Eng. 95 (2016), 164–174, 10.1016/j.cie.2016.03.009.
19. [20] Matusiak, M., de Koster, R., Kroon, L., Saarinen, J., A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse. Eur. J. Oper. Res. 236:3 (2014), 968–977, 10.1016/j.ejor.2013.06.001.
20. [21] Menéndez, B., Pardo, E.G., Alonso-Ayuso, A., Molina, E., Duarte, A., Variable neighborhood search strategies for the order batching problem. Comput. Oper. Res. 78:February (2017), 500–512, 10.1016/j.cor.2016.01.020.
21. [22] Mokhtarinejad, M., Ahmadi, A., Karimi, B., Rahmati, S.H.A., A novel learning based approach for a new integrated location-routing and scheduling problem within cross-docking considering direct shipment. Appl. Soft Comput. 34 (2015), 274–285, 10.1016/j.asoc.2015.04.062.
22. [23] Petersen, C.G., Schmenner, R.W., An evaluation of routing and volume-based storage policies in an order picking operation. Decis. Sci. 30:2 (1999), 481–501, 10.1111/j.1540-5915.1999. tb01619.x.
23. [24] Prins, C., Two memetic algorithms for heterogeneous fleet vehicle routing problems. Eng. Appl. Artif. Intell. 22:6 (2009), 916–928, 10.1016/j.engappai.2008.10.006.
24. [25] Roodbergen, K.J., Koster, R., Routing methods for warehouses with multiple cross aisles. Int. J. Prod. Res. 39:9 (2001), 1865–1883, 10.1080/00207540110028128.
25. [26] Rubrico, J., Ota, J., Higashi, T., Tamura, H., Metaheuristic scheduling of multiple picking agents for warehouse management. Ind. Robot Int. J. 35:1 (2008), 58–68, 10.1108/01439910810843298.
26. [27] Theys, C., Bräysy, O., Dullaert, W., Raa, B., Using a TSP heuristic for routing order pickers in warehouses. Eur. J. Oper. Res. 200 (2010), 755–763, 10.1016/j.ejor.2009.01.036.
27. [28] Tsai, C.-Y., Liou, J.J.H., Huang, T.-M., Using a multiple-GA—method to solve the batch picking problem: considering travel distance and order due time. Int. J. Prod. Res., 46(22), 2008, 6533, 10.1080/00207540701441997.
28. [29] Yang, W., Chan, F.T.S., Kumar, V., Optimizing replenishment polices using Genetic Algorithm for single-warehouse multi-retailer system. Expert Syst. Appl. 39:3 (2012), 3081–3086, 10.1016/j.eswa.2011.08.171.