Use statistical analysis to approximate integrated order batching problem

References

• Aboelfotoh, Aaya, Manjeet Singh, and Gursel Suer. 2019. “Order Batching Optimization for Warehouses with Cluster-Picking.” Procedia Manufacturing 39: 1464–1473. https://doi.org/10.1016/j.promfg.2020.01.302.
   Google Scholar
• Ackerman, Kenneth B. 2012. Practical Handbook of Warehousing. New York: Springer Science & Business Media.
   Google Scholar
• Akkerman, Fabian, and Martijn Mes. 2022. “Distance Approximation to Support Customer Selection in Vehicle Routing Problems.” Annals of Operations Research. https://doi.org/10.1007/s10479-022-04674-8.
   Web of Science ®Google Scholar
• Albareda-Sambola, Maria, Antonio Alonso-Ayuso, Elisenda Molina, and Clara Simón De Blas. 2009. “Variable Neighborhood Search for Order Batching in a Warehouse.” Asia-Pacific Journal of Operational Research 26 (5): 655–683. https://doi.org/10.1142/s0217595909002390.
   Web of Science ®Google Scholar
• Alvarez, Alejandro Marcos, Quentin Louveaux, and Louis Wehenkel. 2017. “A Machine Learning-Based Approximation of Strong Branching.” INFORMS Journal on Computing 29 (1): 185–195. https://doi.org/10.1287/ijoc.2016.0723.
   Web of Science ®Google Scholar
• Applegate, David L., Robert E. Bixby, Vašek Chvátal, and William J. Cook. 2007. The Traveling Salesman Problem: A Computational Study. Princeton: Princeton University Press.
   Google Scholar
• Arlotto, Alessandro, and J. Michael Steele. 2016. “Beardwood–Halton–Hammersley Theorem for Stationary Ergodic Sequences: A Counterexample.” The Annals of Applied Probability 26 (4). https://doi.org/10.1214/15-aap1142.
   PubMed Web of Science ®Google Scholar
• Bartholdi, John J., and Steven T. Hackman. 2014. Warehouse & Distribution Science: Release 0.96, 23–31. Atlanta: Georgia Institute of Technology, School of Industrial and Systems Engineering, The Supply Chain and Logistics Institute.
   Google Scholar
• Beardwood, Jillian, J. H. Halton, and J. M. Hammersley. 1959. “The Shortest Path Through Many Points.” Mathematical Proceedings of the Cambridge Philosophical Society 55 (4): 299–327. https://doi.org/10.1017/s0305004100034095.
   Google Scholar
• Bengio, Yoshua, Andrea Lodi, and Antoine Prouvost. 2021. “Machine Learning for Combinatorial Optimization: A Methodological Tour D'horizon.” European Journal of Operational Research 290 (2): 405–421. https://doi.org/10.1016/j.ejor.2020.07.063.
   Web of Science ®Google Scholar
• Boysen, Nils, Stefan Fedtke, and Felix Weidinger. 2018. “Optimizing Automated Sorting in Warehouses: The Minimum Order Spread Sequencing Problem.” European Journal of Operational Research 270 (1): 386–400. https://doi.org/10.1016/j.ejor.2018.03.026.
   Web of Science ®Google Scholar
• Boysen, Nils, Konrad Stephan, and Felix Weidinger. 2019. “Manual Order Consolidation with Put Walls: The Batched Order Bin Sequencing Problem.” EURO Journal on Transportation and Logistics 8 (2): 169–193. https://doi.org/10.1007/s13676-018-0116-0.
   Web of Science ®Google Scholar
• Calzavara, Martina, Christoph H Glock, Eric H Grosse, and Fabio Sgarbossa. 2019. “An Integrated Storage Assignment Method for Manual Order Picking Warehouses Considering Cost, Workload and Posture.” International Journal of Production Research 57 (8): 2392–2408. https://doi.org/10.1080/00207543.2018.1518609.
   Web of Science ®Google Scholar
• Cergibozan, Çağla, and A Serdar Tasan. 2019. “Order Batching Operations: An Overview of Classification, Solution Techniques, and Future Research.” Journal of Intelligent Manufacturing 30 (1): 335–349. https://doi.org/10.1007/s10845-016-1248-4.
   Web of Science ®Google Scholar
• Chen, Tzu-Li, Chen-Yang Cheng, Yin-Yann Chen, and Li-Kai Chan. 2015. “An Efficient Hybrid Algorithm for Integrated Order Batching, Sequencing and Routing Problem.” International Journal of Production Economics 159: 158–167. https://doi.org/10.1016/j.ijpe.2014.09.029.
   Web of Science ®Google Scholar
• Chen, Fangyu, Hongwei Wang, Yong Xie, and Chao Qi. 2016. “An ACO-Based Online Routing Method for Multiple Order Pickers with Congestion Consideration in Warehouse.” Journal of Intelligent Manufacturing 27 (2): 389–408. https://doi.org/10.1007/s10845-014-0871-1.
   Web of Science ®Google Scholar
• Chen, Mu-Chen, and Hsiao-Pin Wu. 2005. “An Association-Based Clustering Approach to Order Batching Considering Customer Demand Patterns.” Omega 33 (4): 333–343. https://doi.org/10.1016/j.omega.2004.05.003.
   Web of Science ®Google Scholar
• Cheng, Chen-Yang, Yin-Yann Chen, Tzu-Li Chen, and John Jung-Woon Yoo. 2015. “Using a Hybrid Approach Based on the Particle Swarm Optimization and Ant Colony Optimization to Solve a Joint Order Batching and Picker Routing Problem.” International Journal of Production Economics 170: 805–814. https://doi.org/10.1016/j.ijpe.2015.03.021.
   Web of Science ®Google Scholar
• Choi, Youngmin, and Paul M. Schonfeld. 2021. “Review of Length Approximations for Tours with Few Stops.” Transportation Research Record 2676 (3): 201–213. https://doi.org/10.1177/03611981211049433.
   Web of Science ®Google Scholar
• Clarke, G., and J. W. Wright. 1964. “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points.” Operations Research 12 (4): 568–581. https://doi.org/10.1287/opre.12.4.568.
   Web of Science ®Google Scholar
• De Koster, René, Tho Le-Duc, and Kees Jan Roodbergen. 2007. “Design and Control of Warehouse Order Picking: A Literature Review.” European Journal of Operational Research 182 (2): 481–501. https://doi.org/10.1016/j.ejor.2006.07.009.
   Web of Science ®Google Scholar
• De Koster, René B.M., Tho Le-Duc, and Nima Zaerpour. 2012. “Determining the Number of Zones in a Pick-and-Sort Order Picking System.” International Journal of Production Research 50 (3): 757–771. https://doi.org/10.1080/00207543.2010.543941.
   Web of Science ®Google Scholar
• De Koster, M. B. M., E. S. Van der Poort, and M. Wolters. 1999. “Efficient Orderbatching Methods in Warehouses.” International Journal of Production Research 37 (7): 1479–1504. https://doi.org/10.1080/002075499191094.
   Web of Science ®Google Scholar
• Dubhashi, Devdatt P., and Alessandro Panconesi. 2009. Concentration of Measure for the Analysis of Randomized Algorithms. Cambridge: Cambridge University Press.
   Google Scholar
• Elsayed, E. A. 1981. “Algorithms for Optimal Material Handling in Automatic Warehousing Systems.” The International Journal of Production Research 19 (5): 525–535. https://doi.org/10.1080/00207548108956683.
   Web of Science ®Google Scholar
• Elsayed, E. A., and O. I. Unal. 1989. “Order Batching Algorithms and Travel-Time Estimation for Automated Storage/Retrieval Systems.” The International Journal of Production Research 27 (7): 1097–1114. https://doi.org/10.1080/00207548908942610.
   Web of Science ®Google Scholar
• Esra, BOZ, and ARAS Nil. 2022. “The Order Batching Problem: A State-of-the-Art Review.” Sigma Journal of Engineering and Natural Sciences 40 (2): 402–420.
   Google Scholar
• Etheve, Marc, Zacharie Alès, Côme Bissuel, Olivier Juan, and Safia Kedad-Sidhoum. 2020. “Reinforcement Learning for Variable Selection in a Branch and Bound Algorithm.” In Integration of Constraint Programming, Artificial Intelligence, and Operations Research: 17th International Conference, CPAIOR 2020, Vienna, Austria, September 21–24, 2020, Proceedings, 176–185. Springer. https://doi.org/10.1007/978-3-030-58942-4_12.
   Google Scholar
• Fan, Feng-Lei, Jinjun Xiong, Mengzhou Li, and Ge Wang. 2021. “On Interpretability of Artificial Neural Networks: A Survey.” IEEE Transactions on Radiation and Plasma Medical Sciences 5 (6): 741–760. https://doi.org/10.1109/trpms.2021.3066428.
   PubMed Web of Science ®Google Scholar
• Figliozzi, Miguel Andres. 2007. “Analysis of the Efficiency of Urban Commercial Vehicle Tours: Data Collection, Methodology, and Policy Implications.” Transportation Research Part B: Methodological 41 (9): 1014–1032. https://doi.org/10.1016/j.trb.2007.04.006.
   Web of Science ®Google Scholar
• Figliozzi, Miguel Andres. 2008. “Planning Approximations to the Average Length of Vehicle Routing Problems with Varying Customer Demands and Routing Constraints.” Transportation Research Record 2089 (1): 1–8. https://doi.org/10.3141/2089-01.
   Google Scholar
• Franceschetti, Anna, Ola Jabali, and Gilbert Laporte. 2017. “Continuous Approximation Models in Freight Distribution Management.” Top 25 (3): 413–433. https://doi.org/10.1007/s11750-017-0456-1.
   Web of Science ®Google Scholar
• Gademann, Noud, and Steef Velde. 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
• Gallien, Jérémie, and Théophane Weber. 2010. “To Wave Or Not to Wave? Order Release Policies for Warehouses with an Automated Sorter.” Manufacturing & Service Operations Management 12 (4): 642–662. https://doi.org/10.1287/msom.1100.0291.
   Web of Science ®Google Scholar
• Gasse, Maxime, Didier Chetelat, Nicola Ferroni, Laurent Charlin, and Andrea Lodi. 2019. “Exact Combinatorial Optimization with Graph Convolutional Neural Networks.” In Advances in Neural Information Processing Systems, edited by H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alché-Buc, E. Fox, and R. Garnett, Vol. 32. Curran Associates, Inc.
   Google Scholar
• Gibson, David R, and Gunter P Sharp. 1992. “Order Batching Procedures.” European Journal of Operational Research 58 (1): 57–67. https://doi.org/10.1016/0377-2217(92)90235-2.
   Web of Science ®Google Scholar
• Gu, Jinxiang, Marc Goetschalckx, and Leon F. McGinnis. 2007. “Research on Warehouse Operation: A Comprehensive Review.” European Journal of Operational Research 177 (1): 1–21. https://doi.org/10.1016/j.ejor.2006.02.025.
   Web of Science ®Google Scholar
• Härdle, Wolfgang, and Léopold Simar. 2007. Applied Multivariate Statistical Analysis. Vol. 22007. Berlin, Heidelberg: Springer.
   Google Scholar
• Henn, Sebastian, Sören Koch, Karl F Doerner, Christine Strauss, and Gerhard Wäscher. 2010. “Metaheuristics for the Order Batching Problem in Manual Order Picking Systems.” Business Research 3 (1): 82–105. https://doi.org/10.1007/bf03342717.
   Google Scholar
• Henn, Sebastian, and Gerhard Wäscher. 2012. “Tabu Search Heuristics for the Order Batching Problem in Manual Order Picking Systems.” European Journal of Operational Research 222 (3): 484–494. https://doi.org/10.1016/j.ejor.2012.05.049.
   Web of Science ®Google Scholar
• Ho, Ying-Chin, Teng-Sheng Su, and Zhi-Bin Shi. 2008. “Order-Batching Methods for an Order-Picking Warehouse with Two Cross Aisles.” Computers & Industrial Engineering 55 (2): 321–347. https://doi.org/10.1016/j.cie.2007.12.018.
   Web of Science ®Google Scholar
• Ho, Y-C, and Y-Y Tseng. 2006. “A Study on Order-Batching Methods of Order-Picking in a Distribution Centre with Two Cross-aisles.” International Journal of Production Research 44 (17): 3391–3417. https://doi.org/10.1080/00207540600558015.
   Web of Science ®Google Scholar
• Hompel, Michael Ten, and Thorsten Schmidt. 2007. Warehouse Management. Berlin, Heidelberg: Springer.
   Google Scholar
• Hong, Soondo, and Youngjoo Kim. 2017. “A Route-Selecting Order Batching Model with The S-Shape Routes in a Parallel-Aisle Order Picking System.” European Journal of Operational Research 257 (1): 185–196. https://doi.org/10.1016/j.ejor.2016.07.017.
   Web of Science ®Google Scholar
• Huang, Zeren, Kerong Wang, Furui Liu, Hui-Ling Zhen, Weinan Zhang, Mingxuan Yuan, Jianye Hao, Yong Yu, and Jun Wang. 2022. “Learning to Select Cuts for Efficient Mixed-Integer Programming.” Pattern Recognition 123: 108353. https://doi.org/10.1016/j.patcog.2021.108353.
   Web of Science ®Google Scholar
• Jiang, Wei, Jiyin Liu, Yun Dong, and Li Wang. 2021. “Assignment of Duplicate Storage Locations in Distribution Centres to Minimise Walking Distance in Order Picking.” International Journal of Production Research 59 (15): 4457–4471. https://doi.org/10.1080/00207543.2020.1766714.
   Web of Science ®Google Scholar
• Jiang, Xiaowei, Lijun Sun, Yuankai Zhang, and Xiangpei Hu. 2022. “Order Batching and Sequencing for Minimising the Total Order Completion Time in Pick-and-Sort Warehouses.” Expert Systems with Applications 187: 115943. https://doi.org/10.1016/j.eswa.2021.115943.
   Web of Science ®Google Scholar
• Li, Jundong, Kewei Cheng, Suhang Wang, Fred Morstatter, Robert P Trevino, Jiliang Tang, and Huan Liu. 2017. “Feature Selection: A Data Perspective.” ACM Computing Surveys (CSUR) 50 (6): 1–45. https://doi.org/10.1145/3136625.
   Web of Science ®Google Scholar
• Matusiak, Marek, René De Koster, and Jari Saarinen. 2017. “Utilizing Individual Picker Skills to Improve Order Batching in a Warehouse.” European Journal of Operational Research 263 (3): 888–899. https://doi.org/10.1016/j.ejor.2017.05.002.
   Web of Science ®Google Scholar
• Merchán, Daniel, and Matthias Winkenbach. 2019. “An Empirical Validation and Data-Driven Extension of Continuum Approximation Approaches for Urban Route Distances.” Networks 73 (4): 418–433. https://doi.org/10.1002/net.21874.
   Web of Science ®Google Scholar
• Ming-Huang Chiang, David, Chia-Ping Lin, and Mu-Chen Chen. 2014. “Data Mining Based Storage Assignment Heuristics for Travel Distance Reduction.” Expert Systems 31 (1): 81–90. https://doi.org/10.1111/exsy.12006.
   Web of Science ®Google Scholar
• Morabit, Mouad, Guy Desaulniers, and Andrea Lodi. 2021. “Machine-Learning–Based Column Selection for Column Generation.” Transportation Science 55 (4): 815–831. https://doi.org/10.1287/trsc.2021.1045.
   Web of Science ®Google Scholar
• Muter, Ibrahim, and Temel Öncan. 2015. “An Exact Solution Approach for the Order Batching Problem.” IIE Transactions 47 (7): 728–738. https://doi.org/10.1080/0740817x.2014.991478.
   Web of Science ®Google Scholar
• Nair, Vinod, Sergey Bartunov, Felix Gimeno, Ingrid von Glehn, Pawel Lichocki, Ivan Lobov, Brendan O'Donoghue, et al. 2020. “Solving Mixed Integer Programs Using Neural Networks.” https://arxiv.org/abs/2012.13349.
   Google Scholar
• Nicola, Daniel, Rudolf Vetschera, and A Dragomir. 2019. “Total Distance Approximations for Routing Solutions.” Computers & Operations Research 102: 67–74. https://doi.org/10.1016/j.cor.2018.10.008.
   Web of Science ®Google Scholar
• Paulus, Max B, Giulia Zarpellon, Andreas Krause, Laurent Charlin, and Chris Maddison. 2022. “Learning to Cut by Looking Ahead: Cutting Plane Selection via Imitation Learning.” In Proceedings of the 39th International Conference on Machine Learning, edited by Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato, Vol. 162. 17584–17600. PMLR. https://proceedings.mlr.press/v162/paulus22a.html.
   Google Scholar
• Rhee, WanSoo T., and Michel Talagrand. 1989. “A Sharp Deviation Inequality for the Stochastic Traveling Salesman Problem.” The Annals of Probability 17 (1). https://doi.org/10.1214/aop/1176991490.
   Web of Science ®Google Scholar
• Shiau, Jiun-Yan, and Ming-Chang Lee. 2010. “A Warehouse Management System with Sequential Picking for Multi-Container Deliveries.” Computers & Industrial Engineering 58 (3): 382–392. https://doi.org/10.1016/j.cie.2009.04.017.
   Web of Science ®Google Scholar
• Steele, J. Michael. 1981. “Complete Convergence of Short Paths and Karp's Algorithm for the TSP.” Mathematics of Operations Research 6 (3): 374–378. https://doi.org/10.1287/moor.6.3.374.
   Web of Science ®Google Scholar
• Tang, Yunhao, Shipra Agrawal, and Yuri Faenza. 2020. “Reinforcement Learning for Integer Programming: Learning to Cut.” In Proceedings of the 37th International Conference on Machine Learning, edited by Hal Daumé III and Aarti Singh, Vol. 119. 9367–9376. PMLR. https://proceedings.mlr.press/v119/tang20a.html.
   Google Scholar
• Tang, Lixin, Gongshu Wang, Jiyin Liu, and Jingyi Liu. 2011. “A Combination of Lagrangian Relaxation and Column Generation for Order Batching in Steelmaking and Continuous-Casting Production.” Naval Research Logistics (NRL) 58 (4): 370–388. https://doi.org/10.1002/nav.20452.
   Web of Science ®Google Scholar
• Tappia, Elena, Debjit Roy, Marco Melacini, and René De Koster. 2019. “Integrated Storage-Order Picking Systems: Technology, Performance Models, and Design Insights.” European Journal of Operational Research 274 (3): 947–965. https://doi.org/10.1016/j.ejor.2018.10.048.
   Web of Science ®Google Scholar
• Valle, Cristiano Arbex, John E Beasley, and Alexandre Salles Da Cunha. 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, Teun, An Caris, Katrien Ramaekers, and Kris Braekers. 2019. “Formulating and Solving the Integrated Batching, Routing, and Picker Scheduling Problem in a Real-Life Spare Parts Warehouse.” European Journal of Operational Research 277 (3): 814–830. https://doi.org/10.1016/j.ejor.2019.03.012.
   Web of Science ®Google Scholar
• Van Gils, Teun, Katrien Ramaekers, Kris Braekers, Benoît Depaire, and An Caris. 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
• Wang, Meng, Ren-Qian Zhang, and Kun Fan. 2020. “Improving Order-Picking Operation Through Efficient Storage Location Assignment: A New Approach.” Computers & Industrial Engineering 139: 106186. https://doi.org/10.1016/j.cie.2019.106186.
   Web of Science ®Google Scholar
• Wolsey, Laurence A. 2020. Integer Programming. Hoboken: John Wiley & Sons.
   Google Scholar
• Zare Mehrjerdi, Y, M Alipour, and A Mostafaeipour. 2018. “Integrated Order Batching and Distribution Scheduling in a Single-Block Order Picking Warehouse Considering S-Shape Routing Policy.” International Journal of Engineering 31 (10): 1723–1733.
   Web of Science ®Google Scholar
• Zhang, Jun, Xuping Wang, Felix TS Chan, and Junhu Ruan. 2017. “On-Line Order Batching and Sequencing Problem with Multiple Pickers: A Hybrid Rule-Based Algorithm.” Applied Mathematical Modelling 45: 271–284. https://doi.org/10.1016/j.apm.2016.12.012.
   Web of Science ®Google Scholar
• Zhong, Shuya, Vaggelis Giannikas, Jorge Merino, Duncan McFarlane, Jun Cheng, and Wei Shao. 2022. “Evaluating the Benefits of Picking and Packing Planning Integration in E-Commerce Warehouses.” European Journal of Operational Research 301 (1): 67–81. https://doi.org/10.1016/j.ejor.2021.09.031.
   Web of Science ®Google Scholar
• Žulj, Ivan, Sergej Kramer, and Michael Schneider. 2018. “A Hybrid of Adaptive Large Neighborhood Search and Tabu Search for the Order-Batching Problem.” European Journal of Operational Research 264 (2): 653–664. https://doi.org/10.1016/j.ejor.2017.06.056.
   Web of Science ®Google Scholar