Branch-Price-and-Cut-Based Solution of Order Batching Problems

References

• 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. Comput. Oper. Res. 129(May):105168.Crossref, Google Scholar
• Anily S, Bramel J, Simchi-Levi D (1994) Worst-case analysis of heuristics for the bin packing problem with general cost structures. Oper. Res. 42(2):287–298.Link, Google Scholar
• Archetti C, Bouchard M, Desaulniers G (2011) Enhanced branch and price and cut for vehicle routing with split deliveries and time windows. Transportation Sci. 45(3):285–298.Link, Google Scholar
• Azadeh K, Koster RD, Roy D (2019) Robotized and automated warehouse systems: Review and recent developments. Transportation Sci. 53(4):917–945.Link, Google Scholar
• Bahçeci U, Öncan T (2022) An evaluation of several combinations of routing and storage location assignment policies for the order batching problem. Internat. J. Production Res. 60(19):5892–5911.Crossref, Google Scholar
• Baldacci R, Christofides N, Mingozzi A (2007) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Programming 115(2):351–385.Crossref, Google Scholar
• Baldacci R, Mingozzi A, Roberti R (2011) New route relaxation and pricing strategies for the vehicle routing problem. Oper. Res. 59(5):1269–1283.Link, Google Scholar
• Barnhart C, Johnson E, Nemhauser G, Savelsbergh M, Vance P (1998) Branch-and-price: Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.Link, Google Scholar
• Boysen N, de Koster R, Weidinger F (2019) Warehousing in the e-commerce era: A survey. Eur. J. Oper. Res. 277(2):396–411.Crossref, Google Scholar
• Cano JA, Correa-Espinal AA, Gómez-Montoya RA (2020) Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems. J. King Saud Univ. Engrg. Sci. 32(3):219–228.Google Scholar
• Caron F, Marchet G, Perego A (2000) Optimal layout in low-level picker-to-part systems. Internat. J. Production Res. 38(1):101–117.Crossref, Google Scholar
• Çelik M, Süral H (2014) Order picking under random and turnover-based storage policies in fishbone aisle warehouses. IIE Trans. 46(3):283–300.Crossref, Google Scholar
• de Koster R, Le-Duc T, Roodbergen KJ (2007) Design and control of warehouse order picking: A literature review. Eur. J. Oper. Res. 182(2):481–501.Crossref, Google Scholar
• de Koster R, Roodbergen KJ, van Voorden R (1999) Reduction of walking time in the distribution center of De Bijenkorf. Speranza MG, Stähly P, eds. New Trends in Distribution Logistics (Springer, Berlin), 215–234.Crossref, Google Scholar
• de Koster MBM, van der Poort E, Wolters M (1999) Efficient orderbatching methods in warehouses. Internat. J. Production Res. 37(7):1479–1504.Crossref, Google Scholar
• Establish Inc. (2013) Establish Davis logistics costs and service 2013. Presentation, CSCMPS Annual Global Conference, October 20–23, Denver.Google Scholar
• Frazelle E (2001) World-Class Warehousing and Material Handling (McGraw-Hill, New York).Google Scholar
• Gademann N, van de Velde S (2005) Order batching to minimize total travel time in a parallel-aisle warehouse. IIE Trans. 37(1):63–75.Crossref, Google Scholar
• Gademann N, van den Berg J, van der Hoff H (2001) An order batching algorithm for wave picking in a parallel-aisle warehouse. IIE Trans. 33(5):385–398.Crossref, Google Scholar
• Goeke D, Schneider M (2021) Modeling single-picker routing problems in classical and modern warehouses. INFORMS J. Comput. 33(2):436–451.Abstract, Google Scholar
• Goetschalckx M, Ratliff HD (1988) Order picking in an aisle. IIE Trans. 20(1):53–62.Crossref, Google Scholar
• Grosse EH, Glock CH, Ballester-Ripoll R (2014) A simulated annealing approach for the joint order batching and order picker routing problem with weight restrictions. Internat. J. Oper. Quant. Management 20(2):65–83.Google Scholar
• Gschwind T, Bianchessi N, Irnich S (2019) Stabilized branch-price-and-cut for the commodity-constrained split delivery vehicle routing problem. Eur. J. Oper. Res. 278(1):91–104.Crossref, Google Scholar
• Gu J, Goetschalckx M, McGinnis LF (2010) Research on warehouse design and performance evaluation: A comprehensive review. Eur. J. Oper. Res. 203(3):539–549.Crossref, Google Scholar
• Hall RW (1993) Distance approximations for routing manual pickers in a warehouse. IIE Trans. 25(4):76–87.Crossref, Google Scholar
• Henn S, Wäscher G (2012) Tabu search heuristics for the order batching problem in manual order picking systems. Eur. J. Oper. Res. 222(3):484–494.Crossref, Google Scholar
• Henn S, Koch S, Wäscher G (2012) Order batching in order picking warehouses: A survey of solution approaches. Manzini R, ed. Warehousing in the Global Supply Chain (Springer, London), 105–137.Crossref, Google Scholar
• Heßler K, Irnich S (2021) A branch-and-cut algorithm for the soft-clustered vehicle-routing problem. Discrete Appl. Math. 288(January):218–234.Crossref, Google Scholar
• Heßler K, Irnich S (2022) A note on the linearity of Ratliff and Rosenthal’s algorithm for optimal picker routing. Oper. Res. Lett. 50(2):155–159.Crossref, Google Scholar
• Heßler K, Gschwind T, Irnich S (2018) Stabilized branch-and-price algorithms for vector packing problems. Eur. J. Oper. Res. 271(2):401–419.Crossref, Google Scholar
• Hintsch T, Irnich S (2020) Exact solution of the soft-clustered vehicle-routing problem. Eur. J. Oper. Res. 280(1):164–178.Crossref, Google Scholar
• Hong S, Johnson AL, Peters BA (2012) Large-scale order batching in parallel-aisle picking systems. IIE Trans. 44(2):88–106.Crossref, Google Scholar
• Hu Q, Wei L, Lim A (2018) The two-dimensional vector packing problem with general costs. Omega 74(January):59–69.Crossref, Google Scholar
• Hwang H, Kim DG (2005) Order-batching heuristics based on cluster analysis in a low-level picker-to-part warehousing system. Internat. J. Production Res. 43(17):3657–3670.Crossref, Google Scholar
• Hwang H, Oh YH, Lee YK (2004) An evaluation of routing policies for order-picking operations in low-level picker-to-part system. Internat. J. Production Res. 42(18):3873–3889.Crossref, Google Scholar
• Irnich S, Desaulniers G (2005) Shortest path problems with resource constraints. Desaulniers G, Desrosiers J, Solomon MM, eds. Column Generation (Springer-Verlag, Boston), 33–65.Crossref, Google Scholar
• Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper. Res. 56(2):497–511.Link, Google Scholar
• Lübbecke M, Desrosiers J (2005) Selected topics in column generation. Oper. Res. 53(6):1007–1023.Link, Google Scholar
• Marchet G, Melacini M, Perotti S (2015) Investigating order picking system adoption: A case-study-based approach. Internat. J. Logist. Res. Appl. 18(1):82–98.Crossref, Google Scholar
• Martinelli R, Poggi M, Subramanian A (2013) Improved bounds for large scale capacitated arc routing problem. Comput. Oper. Res. 40(8):2145–2160.Crossref, Google Scholar
• Michel R (2016) 2016 Warehouse/DC Operations Survey: Ready to confront complexity. Supply Chain Management Rev. (November 8), https://www.scmr.com/article/2016_warehouse_dc_operations_survey_ready_to_confront_complexity.Google Scholar
• Muter İ, Öncan T (2015) An exact solution approach for the order batching problem. IIE Trans. 47(7):728–738.Crossref, Google Scholar
• Öncan T (2015) MILP formulations and an iterated local search algorithm with tabu thresholding for the order batching problem. Eur. J. Oper. Res. 243(1):142–155.Crossref, Google Scholar
• Pansart L, Catusse N, Cambazard H (2018) Exact algorithms for the order picking problem. Comput. Oper. Res. 100(December):117–127.Crossref, Google Scholar
• Petersen C (1995) Routeing and storage policy interaction in order picking operations. Decision Sci. Inst. Proc. 3:1614–1616.Google Scholar
• Petersen CG (1997) An evaluation of order picking routeing policies. Internat. J. Oper. Production Management 17(11):1098–1111.Crossref, Google Scholar
• Petersen CG, Aase G (2004) A comparison of picking, storage, and routing policies in manual order picking. Internat. J. Production Econom. 92(1):11–19.Crossref, Google Scholar
• Ratliff HD, Rosenthal AS (1983) Order-picking in a rectangular warehouse: A solvable case of the traveling salesman problem. Oper. Res. 31(3):507–521.Link, Google Scholar
• Richards G (2014) Warehouse Management: A Complete Guide to Improving Efficiency and Minimizing Costs in the Modern Warehouse, 2nd ed. (Kogan Page, London).Google Scholar
• Roodbergen KJ (2001) Layout and routing methods for warehouses. PhD thesis, Erasmus University Rotterdam, Rotterdam, Netherlands.Google Scholar
• Roodbergen KJ, de Koster R (2001a) Routing methods for warehouses with multiple cross aisles. Internat. J. Production Res. 39(9):1865–1883.Crossref, Google Scholar
• Roodbergen KJ, de Koster R (2001b) Routing order pickers in a warehouse with a middle aisle. Eur. J. Oper. Res. 133(1):32–43.Crossref, Google Scholar
• Tang CS, Denardo EV (1988) Models arising from a flexible manufacturing machine, part II: Minimization of the number of switching instants. Oper. Res. 36(5):778–784.Link, Google Scholar
• Thia F (2008) MySQL Foodmart Database. Pentaho Wiki (May 8), http://pentaho.dlpage.phi-integration.com/mondrian/mysql-foodmart-database.Google Scholar
• Tompkins JA, White JA, Bozer YA, Tanchoco JMA (2010) Facilities Planning, 4th ed. (John Wiley & Sons, Hoboken, NJ).Google Scholar
• Valle CA, Beasley JE, da Cunha AS (2016) Modelling and solving the joint order batching and picker routing problem in inventories. Cerulli R, Fujishige S, Mahjoub A, eds. Combinatorial Optimization, Lecture Notes in Computer Science, vol. 9849 (Springer International Publishing, Cham, Switzerland), 81–97.Crossref, Google Scholar
• Valle CA, Beasley JE, da Cunha AS (2017) Optimally solving the joint order batching and picker routing problem. Eur. J. Oper. Res. 262(3):817–834.Crossref, Google Scholar
• van Gils T, Caris A, Ramaekers K, Braekers K (2019) Formulating and solving the integrated batching, routing, and picker scheduling problem in a real-life spare parts warehouse. Eur. J. Oper. Res. 277(3):814–830.Crossref, Google Scholar
• Žulj I, Kramer S, Schneider M (2018) A hybrid of adaptive large neighborhood search and tabu search for the order-batching problem. Eur. J. Oper. Res. 264(2):653–664.Crossref, Google Scholar