Journal of Industrial Engineering Research in Production Systems

Journal of Industrial Engineering Research in Production Systems

Mathematical Modeling of Integrated Order Batching and Distribution Scheduling in a Warehouse with Multiple Pickers Using Batch Picking

Document Type : Research Paper

Authors
Mehrdad Alipour 1
Yahia Zare Mehrjerdi 2
Ali Mostafaeipour 3
1 Ph.D. Student, industrial engineering, Department of Industrial Engineering, Technical and Industrial Campus, Yazd University, Yazd, Iran
2 Professor, Department of Industrial Engineering, Technical and Industrial Campus, Yazd University, Yazd, Iran
3 Associate Professor of Industrial Engineering Department, Technical and Industrial Campus, Yazd University, Yazd, Iran
10.22084/ier.2023.21652.1970
Abstract
The orders received from customers in retail companies must be picked in the warehouse before delivery to customers. Order picking is the most costly and time-consuming process in a warehouse and customer orders are usually batched and picked in common tours to reduce travel distance and picking time. On the other hand, the widespread use of the internet and e-commerce has significantly increased the number and decreased the size of orders issued by customers and as a result, the order batching and picking operations in the warehouse has become more complicated. Besides, adopting appropriate policies to distribute orders among customers by taking into account issues such as the time and cost of distributing orders and due dates, is of great importance. Moreover, considering the operations of order picking and distribution in an integrated manner can significantly reduce costs and increase the level of service provided to customers.
In this research, the order batching and distribution operations are considered integratedly and a mathematical model is proposed to address the integrated problem by considering minimization of total tardiness as objective function. respectively. For model­ validation purposes, an iterated local search metaheuristic approach is proposed to solve the proposed model. By using the generated data, it has been shown that the metaheuristic algorithm is able to obtain quality solutions for the problem.
Due to the fact that an optimization solver is unable to optimize a small size problem in a realistic time, an upper bound was defined for the purpose of comparing the algorithm results with that. Our comparison of results indicates that for relatively larger sized sample problem the quality of obtained solutions by meta-heurietsic algorithm, in comparion with upper bound, having suitable quality as expected. 
Keywords
Order Batching
Batch Picking
Vehicle Routing
Iterated Local Search
  • Henn, S., Algorithms for on-line order batching in an order picking warehouse (2012). Computers & Operations Research. 39(11): p. 2549-2563.
  • Chew, E.P. and L.C. Tang, Travel time analysis for general item location assignment in a rectangular warehouse (1999). European Journal of Operational Research. 112(3): p. 582-597.
  • De Koster, R., T. Le-Duc, and K.J. Roodbergen, Design and control of warehouse order picking: A literature review (2007). European journal of operational research. 182(2): p. 481-501.
  • De Koster, M.B.M., E.S. Van der Poort, and M. Wolfers, Efficient orderbatching methods in warehouses (1999). International Journal of Production Research. 37(7): p. 1479-1504.
  • Kuhn, H., D. Schubert, and A. Holzapfel, Integrated Order Batching and Vehicle Routing Operations in Grocery Retail–A General Adaptive Large Neighborhood Search Algorithm. European Journal of Operational Research, 2020.
  • Moons, S., et al., The value of integrating order picking and vehicle routing decisions in a B2C e-commerce environment (2019). International Journal of Production Research. 57(20): p. 6405-6423.
  • Bozer, Y.A. and J.W. Kile, Order batching in walk-and-pick order picking systems (2008). International Journal of Production Research. 46(7): p. 1887-1909.
  • Ruben, R.A. and J.F. Robert, Batch construction heuristics and storage assignment strategies for walk/ride and pick systems (1999). Management Science. 45(4): p. 575-596.
  • Tang, L., et al., A combination of Lagrangian relaxation and column generation for order batching in steelmaking and continuous‐casting production (2011). Naval Research Logistics (NRL). 58(4): p. 370-388.
  • Muter, İ. and T. Öncan, An exact solution approach for the order batching problem (2015). IIE Transactions. 47(7): p. 728-738.
  • Valle, C.A., J.E. Beasley, and A.S. da Cunha, Optimally solving the joint order batching and picker routing problem (2017). European Journal of Operational Research. 262(3): p. 817-834.
  • Clarke, G. and J.W. Wright, Scheduling of vehicles from a central depot to a number of delivery points (1964). Operations research. 12(4): p. 568-581.
  • Tsai, C.Y., J. Liou, J H, and T.M. Huang, Using a multiple-GA method to solve the batch picking problem: considering travel distance and order due time (2008). International Journal of Production Research. 46(22): p. 6533-6555.
  • Chirici, L. and K.-S. Wang, Tackling the storage problem through genetic algorithms (2014). Advances in Manufacturing. 2(3): p. 203-211.
  • Zhang, J., X. Wang, and K. Huang, Integrated on-line scheduling of order batching and delivery under B2C e-commerce (2016). Computers & Industrial Engineering. 94: p. 280-289.
  • Koch, S. and G. Wäscher, A grouping genetic algorithm for the Order Batching Problem in distribution warehouses (2016). Journal of Business Economics. 86(1-2): p. 131-153.
  • Menéndez, B., et al., Variable Neighborhood Search strategies for the Order Batching Problem (2016). Computers & Operations Research.
  • Žulj, I., S. Kramer, and M. Schneider, A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem (2018). European Journal of Operational Research. 264(2): p. 653-664.
  • Cergibozan, Ç. and A.S. Tasan, Genetic algorithm based approaches to solve the order batching problem and a case study in a distribution center (2020). Journal of Intelligent Manufacturing: p. 1-13.
  • Henn, S., Order batching and sequencing for the minimization of the total tardiness in picker-to-part warehouses (2015). Flexible Services and Manufacturing Journal. 27(1): p. 86-114.
  • Scholz, A., D. Schubert, and G. Wäscher, Order picking with multiple pickers and due dates–Simultaneous solution of Order Batching, Batch Assignment and Sequencing, and Picker Routing Problems (2017). European Journal of Operational Research 263(2) 461-478.
  • Van Gils, T., et al., Increasing order picking efficiency by integrating storage, batching, zone picking, and routing policy decisions (2018). International Journal of Production Economics. 197: p. 243-261.
  • Ardjmand, E., O.S. Bajgiran, and E. Youssef, Using list-based simulated annealing and genetic algorithm for order batching and picker routing in put wall based picking systems (2019). Applied Soft Computing. 75: p. 106-119.
  • Cano, J.A., A.A. Correa-Espinal, and R.A. Gómez-Montoya, Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems (2020). Journal of King Saud University-Engineering Sciences. 32(3): p. 219-228.
  • Pferschy, U. and J. Schauer, Order batching and routing in a non-standard warehouse (2018). Electronic Notes in Discrete Mathematics. 69: p. 125-132.
  • Kübler, P., C.H. Glock, and T. Bauernhansl, A new iterative method for solving the joint dynamic storage location assignment, order batching and picker routing problem in manual picker-to-parts warehouses (2020). Computers & Industrial Engineering. 147: p. 106645.
  • خدابنده, م., س.ر. حجازی, و م. راستی-برزکی, یک الگوریتم ژنتیک برای مسأله زمانبندی یکپارچه تولید و توزیع با درنظر گرفتن مسیریابی در زنجیره تامین. نشریه پژوهش های مهندسی صنایع در سیستم های تولید, 2013. 1(2): 167-181.
  • Zhang, J., et al., On-line order batching and sequencing problem with multiple pickers: A hybrid rule-based algorithm (2017). Applied Mathematical Modelling 45:. 271-284.
  • Schubert, D., A. Scholz, and G. Wäscher, Integrated order picking and vehicle routing with due dates (2018). OR Spectrum. 40(4): p. 1109-1139.
  • Baker, K.R. and J. Bertrand, An investigation of due-date assignment rules with constrained tightness (1981). Journal of Operations Management. 1(3): p. 109-120.
  • Brah, S.A., A comparative analysis of due date based job sequencing rules in a flow shop with multiple processors (1996). Production Planning & Control. 7(4): p. 362-373.
  • et al. The online integrated order picking and delivery considering pickers’ learning effects for an O2O community supermarket, Transp. Res. E (2019)
  • Van GilsT. et al. Formulating and solving the integrated batching, routing, and pickeer scheduling problem in a real-life spare parts warehouse European J. Oper. Res. (2019)
  • et al. An efficient and general approach for the joint order batching and picker routing problem European J. Oper. Res. (2020)
  • A. et al. Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems J. King Saud Univ., Eng. Sci.(2020)
  • شفائی،­ا.، اکبری جوکار،­م. ر.، رفیعی، م. (1400). بررسی اثرات استفاده از مدل VRP بر کاهش هزینه­های توزیع قطعات یدکی بین خودروهای امدادی. نشریه پژوهش­های مهندسی صنایع در سیستم‌های تولید, 1400. 18(1): صفحه 125-111.

جعفرخان، ف. و س. یعقوبی، (1395). ارائه مدل ریاضی استوار و الگوریتم حل ابتکاری برای مسأله یکپارچه تولید-مسیریابی-موجودی محصولات فاسد شدنی با انتقال جانبی. نشریه پژوهش‌های مهندسی صنایع در سیستم‌های تولید، جلد 4، شماره 2، صفحه 195-211.

Journal of Industrial Engineering Research in Production Systems
Volume 10, Issue 20
January 0
Pages 153-169