Exact Solution of the Single-Picker Routing Problem with Scattered Storage

References

• Ahuja R, Magnanti T, Orlin J (1993) Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ).Google Scholar
• Applegate DL, Bixby RE, Chvatal V, Cook WJ (2003) concorde-03.12.19. Accessed October 1, 2023, https://www.math.uwaterloo.ca/tsp/concorde/index.html.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
• Çelk 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
• Corberán Á, Laporte G, eds. (2014) Arc Routing (Society for Industrial and Applied Mathematics, Philadelphia).Google Scholar
• Daniels RL, Rummel JL, Schantz R (1998) A model for warehouse order picking. Eur. J. Oper. Res. 105(1):1–17.Crossref, Google Scholar
• de Koster R, van der Poort E (1998) Routing orderpickers in a warehouse: A comparison between optimal and heuristic solutions. IIE Trans. 30(5):469–480.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 Lima VL, Iori M, Miyazawa FK (2023) Exact solution of network flow models with strong relaxations. Math. Programming 197:813–846.Crossref, Google Scholar
• Drury J (1988) Toward more efficient order picking. Technical report, The Institute of Materials Management, Cranfield, UK.Google Scholar
• Fischetti M, Salazar-Gonzalez JJ, Toth P (2002) The generalized traveling salesman and orienteering problems. Gutin G, Punnen A, eds. The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol. 12 (Kluwer, Dordrecht, Netherlands), 609–662.Google Scholar
• Frazelle E (2002) World-Class Warehousing and Material Handling (McGraw-Hill, New York).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
• Gu J, Goetschalckx M, McGinnis LF (2007) Research on warehouse operation: A comprehensive review. Eur. J. Oper. Res. 177(1):1–21.Crossref, Google Scholar
• Gue KR, Meller RD (2009) Aisle configurations for unit-load warehouses. IIE Trans. 41(3):171–182.Crossref, Google Scholar
• Gutin G, Punnen A, eds. (2002) The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol. 12 (Kluwer, Dordrecht, Netherlands).Google Scholar
• Hall RW (1993) Distance approximations for routing manual pickers in a warehouse. IIE Trans. 25(4):76–87.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
• Korbacher L, Heßler K, Irnich S (2023) The single picker routing problem with scattered storage: Modeling and evaluation of routing and storage policies. Technical Report LM-2023-01, Chair of Logistics Management, Gutenberg School of Management and Economics, Johannes Gutenberg University Mainz, Mainz, Germany.Google Scholar
• Löffler M, Boysen N, Schneider M (2022) Picker routing in AGV-assisted order picking systems. INFORMS J. Comput. 34(1):440–462.Link, Google Scholar
• Masae M, Glock CH, Grosse EH (2020a) Order picker routing in warehouses: A systematic literature review. Internat. J. Production Econom. 224:107564.Crossref, Google Scholar
• Masae M, Glock CH, Vichitkunakorn P (2019) Optimal order picker routing in the Chevron warehouse. IISE Trans. 52(6):665–687.Crossref, Google Scholar
• Masae M, Glock CH, Vichitkunakorn P (2020b) Optimal order picker routing in a conventional warehouse with two blocks and arbitrary starting and ending points of a tour. Internat. J. Production Res. 58(17):5337–5358.Crossref, Google Scholar
• Masae M, Glock CH, Vichitkunakorn P (2021) A method for efficiently routing order pickers in the leaf warehouse. Internat. J. Production Econom. 234:108069.Crossref, Google Scholar
• Menéndez B, Bustillo M, Pardo EG, Duarte A (2017) General variable neighborhood search for the order batching and sequencing problem. Eur. J. Oper. Res. 263(1):82–93.Crossref, Google Scholar
• Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulations and traveling salesman problems. J. Assoc. Comput. Machinery 7:326–329.Crossref, Google Scholar
• Öztürkoğlu O, Hoser D (2019) A discrete cross aisle design model for order-picking warehouses. Eur. J. Oper. Res. 275(2):411–430.Crossref, Google Scholar
• Öztürkoğlu O, Gue KR, Meller RD (2012) Optimal unit-load warehouse designs for single-command operations. IIE Trans. 44(6):459–475.Crossref, Google Scholar
• Pansart L, Catusse N, Cambazard H (2018) Exact algorithms for the order picking problem. Comput. Oper. Res. 100:117–127.Google Scholar
• Petersen CG (1997) An evaluation of order picking routeing policies. Internat. J. Oper. Prod. Management 17(11):1098–1111.Crossref, Google Scholar
• Petersen CG, Schmenner RW (1999) An evaluation of routing and volume-based storage policies in an order picking operation. Decision Sci. 30(2):481–501.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
• 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
• Santini A (2022) Fork of the Concorde TSP solver with an easier build procedure. https://github.com/alberto-santini/concorde-easy-build.Google Scholar
• Saylam S, Çelik M, Süral H (2023) Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses. Eur. J. Oper. Res. 313(1):225–240.Crossref, Google Scholar
• Scholz A, Wäscher G (2017) Order batching and picker routing in manual order picking systems: The benefits of integrated routing. Central Eur. J. Oper. Res. 25(2):491–520.Crossref, Google Scholar
• Su Y, Zhu X, Yuan J, Teo KL, Li M, Li C (2023) An extensible multi-block layout warehouse routing optimization model. Eur. J. Oper. Res. 305(1):222–239.Crossref, Google Scholar
• Theys C, Bräysy O, Dullaert W, Raa B (2010) Using a TSP heuristic for routing order pickers in warehouses. Eur. J. Oper. Res. 200(3):755–763.Crossref, Google Scholar
• Tompkins J, White J, Bozer Y, Frazelle E, Tanchoco J (2003) Facilities Planning (John Wiley & Sons, Hoboken, NJ).Google Scholar
• van Gils T, Ramaekers K, Caris A, de Koster RB (2018) Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review. Eur. J. Oper. Res. 267(1):1–15.Crossref, Google Scholar
• Wahlen J, Gschwind T (2023) Branch-price-and-cut-based solution of order batching problems. Transportation Sci. 57(3):756–777.Link, Google Scholar
• Weidinger F (2018) Picker routing in rectangular mixed shelves warehouses. Comput. Oper. Res. 95:139–150.Crossref, Google Scholar
• Weidinger F, Boysen N, Schneider M (2019) Picker routing in the mixed-shelves warehouses of e-commerce retailers. Eur. J. Oper. Res. 274(2):501–515.Crossref, Google Scholar