Routing Replenishment Workers: The Prize Collecting Traveling Salesman Problem in Scattered Storage Warehouses

References

• Archer A, Bateni M, Hajiaghayi M, Karloff H (2011) Improved approximation algorithms for prize-collecting Steiner tree and TSP. SIAM J. Comput. 40(2):309–332.Crossref, Google Scholar
• Awerbuch B, Azar Y, Blum A, Vempala S (1998) New approximation guarantees for minimum-weight k-trees and prize-collecting salesmen. SIAM J. Comput. 28(1):254–262.Crossref, Google Scholar
• Azadeh K, De Koster R, Roy D (2019) Robotized and automated warehouse systems: Review and recent developments. Transportation Sci. 53(4):917–945.Link, Google Scholar
• Balas E (1989) The prize collecting traveling salesman problem. Networks 19(6):621–636.Crossref, Google Scholar
• Ballestín F, Pérez Á, Quintanilla S (2020) A multistage heuristic for storage and retrieval problems in a warehouse with random storage. Internat. Trans. Oper. Res. 27(3):1699–1728.Crossref, Google Scholar
• Bérubé JF, Gendreau M, Potvin JY (2009) A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem. Networks 54(1):56–67.Crossref, Google Scholar
• Bienstock D, Goemans MX, Simchi-Levi D, Williamson D (1993) A note on the prize collecting traveling salesman problem. Math. Programming 59(1):413–420.Crossref, 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
• Cambazard H, Catusse N (2018) Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane. Eur. J. Oper. Res. 270(2):419–429.Crossref, Google Scholar
• Chen L, Langevin A, Riopel D (2011) A tabu search algorithm for the relocation problem in a warehousing system. Internat. J. Production Econom. 129(1):147–156.Crossref, Google Scholar
• Christofides N, Colloff I (1973) The rearrangement of items in a warehouse. Oper. Res. 21(2):577–589.Link, 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
• Feillet D, Dejax P, Gendreau M (2005) Traveling salesman problems with profits. Transportation Sci. 39(2):188–205.Link, Google Scholar
• Fischetti M, Toth P (1988) An additive approach for the optimal solution of the prize collecting traveling salesman problem. Vehicle Routing Methods Studies 231:319–343.Google Scholar
• Frederickson GN (1993) An optimal algorithm for selection in a min-heap. Inform. Comput. 104(2):197–214.Crossref, Google Scholar
• Gunawan A, Lau HC, Vansteenwegen P (2016) Orienteering problem: A survey of recent variants, solution approaches and applications. Eur. J. Oper. Res. 255(2):315–332.Crossref, Google Scholar
• Kuhn HW (1955) The Hungarian method for the assignment problem. Naval Res. Logist. Quart. 2(1–2):83–97.Crossref, Google Scholar
• Löffler M, Boysen N, Schneider M (2021) Picker routing in AGV-assisted order picking systems. INFORMS J. Comput. 34(1):440–462.Link, Google Scholar
• Manne A (1960) On the job-shop scheduling problem. Oper. Res. 8(2):219–223.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 (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 (2020c) Optimal order picker routing in the chevron warehouse. IISE Trans. 52(6):665–687.Crossref, Google Scholar
• Morrison DR, Jacobson SH, Sauppe JJ, Sewell EC (2016) Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning. Discrete Optim. 19:79–102.Crossref, Google Scholar
• Pansart L, Catusse N, Cambazard H (2018) Exact algorithms for the order picking problem. Comput. Oper. Res. 100:117–127.Crossref, Google Scholar
• Pazour JA, Carlo HJ (2015) Warehouse reshuffling: Insights and optimization. Transportation Res. Part E Logist. Trans. Rev. 73:207–226.Crossref, Google Scholar
• Pisinger D (2005) Where are the hard knapsack problems? Comput. Oper. Res. 32(9):2271–2284.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 (2001) Routing order pickers in a warehouse with a middle aisle. Eur. J. Oper. Res. 133(1):32–43.Crossref, Google Scholar
• Schiffer M, Boysen N, Klein P, Laporte G, Pavone M (2022) Optimal picking policies in e-commerce warehouses. Management Sci. 68(10):7497–7517.Link, Google Scholar
• Vansteenwegen P, Gunawan A (2019) Orienteering Problems: Models and Algorithms for Vehicle Routing Problems with Profits (Springer Nature, Cham, Switzerland).Crossref, Google Scholar
• Vansteenwegen P, Souffriau W, Van Oudheusden D (2011) The orienteering problem: A survey. Eur. J. Oper. Res. 209(1):1–10.Crossref, Google Scholar
• Weidinger F, Boysen N (2018) Scattered storage: How to distribute stock keeping units all around a mixed-shelves warehouse. Transportation Sci. 52(6):1412–1427.Link, 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
• Wruck S, Vis IF, Boter J (2013) Time-restricted batching models and solution approaches for integrated forward and return product flow handling in warehouses. J. Oper. Res. Soc. 64(10):1505–1516.Crossref, Google Scholar
• Yang P, Zhao Z, Guo H (2020) Order batch picking optimization under different storage scenarios for e-commerce warehouses. Transportation Res. Part E Logist. Trans. Rev. 136:101897.Crossref, Google Scholar