Mathematical programming models for order picking in warehouses with decoupling of picker and cart

References

• Adelzadeh, M., Mahdavi Asl, V., & Koosha, M. (2014). A mathematical model and a solving procedure for multi-depot vehicle routing problem with fuzzy time window and heterogeneous vehicle. The International Journal of Advanced Manufacturing Technology, 75(5), 793–802. https://doi.org/10.1007/s00170-014-6141-8
   Web of Science ®Google Scholar
• Aerts, B., Cornelissens, T., & Sörensen, K. (2021). The joint order batching and picker routing problem: Modelled and solved as a clustered vehicle routing problem. Computers & Operations Research, 129, 105168. https://doi.org/10.1016/j.cor.2020.105168
   Web of Science ®Google Scholar
• Bektas, T. (2006). The multiple traveling salesman problem: An overview of formulations and solution procedures. Omega, 34(3), 209–219. https://doi.org/10.1016/j.omega.2004.10.004
   Web of Science ®Google Scholar
• Belenguer, J. M., Benavent, E., Prins, C., Prodhon, C., & Calvo, R. W. (2011). A branch-and-cut method for the capacitated location-routing problem. Computers & Operations Research, 38(6), 931–941. https://doi.org/10.1016/j.cor.2010.09.019
   Web of Science ®Google Scholar
• Braekers, K., Caris, A., & Jenssens, G. K. (2014). Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots. Transportation Research Part B: Methodological, 67, 166–186. https://doi.org/10.1016/j.trb.2014.05.007
   Web of Science ®Google Scholar
• Briant, O., Cambazard, H., Cattaruzza, D., Catusse, N., Ladier, A. L., & Ogier, M. (2020). An efficient and general approach for the joint order batching and picker routing problem. European Journal of Operational Research, 285(2), 497–512. https://doi.org/10.1016/j.ejor.2020.01.059
   Web of Science ®Google Scholar
• Burkard, R. E., Deineko, V. G., Van Dal, R., van der Veen, J. A., & Woeginger, G. J. (1998). Well-solvable special cases of the traveling salesman problem: A survey. SIAM Review, 40(3), 496–546. https://doi.org/10.1137/S0036144596297514
   Web of Science ®Google Scholar
• Chen, C. M., Gong, Y., De Koster, R. B., & Van Nunen, J. A. (2010). A flexible evaluative framework for order picking systems. Production and Operations Management, 19(1), 70–82. https://doi.org/10.1111/j.1937-5956.2009.01047.x
   Web of Science ®Google Scholar
• Contardo, C., & Martinelli, R. (2014). A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optimization, 12, 129–146. https://doi.org/10.1016/j.disopt.2014.03.001
   Web of Science ®Google Scholar
• Dantzig, G., Fulkerson, R., & Johnson, S. (1954). Solution of a large-scale traveling-salesman problem. Journal of the Operations Research Society of America, 2(4), 393–410. https://doi.org/10.1287/opre.2.4.393
   Web of Science ®Google Scholar
• Gademann, N., & Velde, S. (2005). Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Transactions, 37(1), 63–75. https://doi.org/10.1080/07408170590516917
   Web of Science ®Google Scholar
• Gavish, B., & Graves, S. C. (1978). The traveling salesman problem and related problems. (Working Paper GR-078-78). Operations Research Center, Massachusetts Institute of Technology.
   Google Scholar
• Goeke, D., & Schneider, M. (2021). Modeling single-picker routing problems in classical and modern warehouses. INFORMS Journal on Computing, 33(2), 436–451. https://doi.org/10.1287/ijoc.2020.1040
   Web of Science ®Google Scholar
• Letchford, A. N., Nasiri, S. D., & Theis, D. O. (2013). Compact formulations of the Steiner traveling salesman problem and related problems. European Journal of Operational Research, 228(1), 83–92. https://doi.org/10.1016/j.ejor.2013.01.044
   Web of Science ®Google Scholar
• Löffler, M., Boysen, N., & Schneider, M. (2022). Picker routing in AGV-assisted order picking systems. INFORMS Journal on Computing, 34(1), 440–462. https://doi.org/10.1287/ijoc.2021.1060
   Web of Science ®Google Scholar
• Masae, M., Glock, C. H., & Grosse, E. H. (2020). Order picker routing in warehouses: A systematic literature review. International Journal of Production Economics, 224, 107564. https://doi.org/10.1016/j.ijpe.2019.107564
   Web of Science ®Google Scholar
• Matai, R., Singh, S. P., & Mittal, M. L. (2010). Traveling salesman problem: An overview of applications, formulations and solution approaches. In D. Davendra (Ed.), Traveling salesman problem: Theory and applications (pp. 1–24). InTech. https://doi.org/10.5772/12909
   Google Scholar
• Montoya-Torres, J. R., Franco, J. L., Isaza, S. N., Jiménez, H. F., & Herazo-Padilla, N. (2015). A literature review on the vehicle routing problem with multiple depots. Computers & Industrial Engineering, 79, 115–129. https://doi.org/10.1016/j.cie.2014.10.029
   Web of Science ®Google Scholar
• Nagy, G., & Salhi, S. (2007). Location-routing: Issues, models and methods. European Journal of Operational Research, 177(2), 649–672. https://doi.org/10.1016/j.ejor.2006.04.004
   Web of Science ®Google Scholar
• Pansart, L., Catusse, N., & Cambazard, H. (2018). Exact algorithms for the order picking problem. Computers & Operations Research, 100, 117–127. https://doi.org/10.1016/j.cor.2018.07.002
   Web of Science ®Google Scholar
• Prodhon, C., & Prins, C. (2014). A survey of recent research on location-routing problems. European Journal of Operational Research, 238(1), 1–17. https://doi.org/10.1016/j.ejor.2014.01.005
   Web of Science ®Google Scholar
• Renaud, J., Laporte, G., & Boctor, F. F. (1996). A Tabu search heuristic for the multi-depot-vehicle routing problem. Computers & Operations Research, 23(3), 229–235. https://doi.org/10.1016/0305-0548(95)O0026-P
   Web of Science ®Google Scholar
• Schneider, M., & Drexl, M. (2017). A survey of the standard location-routing problem. Annals of Operations Research, 259(1-2), 389–414. https://doi.org/10.1007/s10479-017-2509-0
   Web of Science ®Google Scholar
• Seward. (2015). Optimizing warehouse operations with machine learning on GPUs. Accessed October 26, 2018, from https://devblogs.nvidia.com/optimizing-warehouse-operations-machine-learning-gpus/
   Google Scholar
• Su, Y., Li, M., Zhu, X., & Li, C. (2022a). Steiner TSP based on aisle as a unit for order picking. Computers & Industrial Engineering, 168, 108026. https://doi.org/10.1016/j.cie.2022.108026
   Web of Science ®Google Scholar
• Su, Y., Zhu, X., Yuan, J., Teo, K. L., Li, M., & Li, C. (2022b). An extensible multi-block layout warehouse routing optimization model. European Journal of Operational Research, 305(1), 222–239. https://doi.org/10.1016/j.ejor.2022.05.045
   Web of Science ®Google Scholar
• Theys, C., Dullaert, W., & Herroelen, W. (2007). Routing order pickers in multiple block warehouses. In Proceedings of the BIVEC-GIBET Transport Research Day, 2007/Hilferink, Pieter [edit.] (pp. 10–30).
   Google Scholar
• Tompkins, J. A., White, J. A., Bozer, Y. A., & Tanchoco, J. M. A. (2010). Facilities planning. Wiley. https://doi.org/10.1016/j.ejor.2009.01.036
   Google Scholar
• Trudeau, R. J. (2013). Introduction to graph theory. Courier Corporation.
   Google Scholar
• Valle, C. A., Beasley, J. E., & Da Cunha, A. S. (2017). Optimally solving the joint order batching and picker routing problem. European Journal of Operational Research, 262(3), 817–834. https://doi.org/10.1016/j.ejor.2017.03.069
   Web of Science ®Google Scholar
• Van Gils, T., Ramaekers, K., Braekers, K., Depaire, B., & Caris, A. (2018). Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions. International Journal of Production Economics, 197, 243–261. https://doi.org/10.1016/j.ijpe.2017.11.021
   Web of Science ®Google Scholar
• Vaughan, T. S. (1999). The effect of warehouse cross aisles on order picking efficiency. International Journal of Production Research, 37(4), 881–897. https://doi.org/10.1080/002075499191580
   Web of Science ®Google Scholar
• Wasner, M., & Zäpfel, G. (2004). An integrated multi-depot hub-location vehicle routing model for network planning of parcel service. International Journal of Production Economics, 90(3), 403–419. https://doi.org/10.1016/j.ijpe.2003.12.002
   Web of Science ®Google Scholar
• Won, J., & Olafsson, S. (2005). Joint order batching and order picking in warehouse operations. International Journal of Production Research, 43(7), 1427–1442. https://doi.org/10.1080/00207540410001733896
   Web of Science ®Google Scholar
• Yousefi Nejad Attari, M., Ebadi Torkayesh, A., Malmir, B., & Neyshabouri Jami, E. (2021). Robust possibilistic programming for joint order batching and picker routing problem in warehouse management. International Journal of Production Research, 59(14), 4434–4452. https://doi.org/10.1080/00207543.2020.1766712
   Web of Science ®Google Scholar