2000 character limit reached
The Intractability of the Picker Routing Problem (2312.01857v1)
Published 4 Dec 2023 in cs.DS, cs.CC, and math.OC
Abstract: The Picker Routing Problem (PRP), which consists in finding a minimum-length tour between a set of storage locations in a warehouse, is one of the most important problems in the warehousing logistics literature. Despite its popularity, the tractability of the PRP in conventional multi-block warehouses remains an open question. This technical note aims to fill this research gap by establishing that the PRP is strongly NP-hard.
- An efficient and general approach for the joint order batching and picker routing problem. European Journal of Operational Research, 285(2):497–512.
- Fixed-parameter algorithms for rectilinear Steiner tree and rectilinear traveling salesman problem in the plane. European Journal of Operational Research, 270(2):419–429.
- Design and control of warehouse order picking: A literature review. European Journal of Operational Research, 182(2):481–501.
- Computers and intractability: a guide to the theory of NP-completeness. A series of books in the mathematical sciences. W.H. Freeman and Company, New York [u.a], 27. print edition.
- Research on warehouse operation: A comprehensive review. European Journal of Operational Research, 177(1):1–21.
- A note on the linearity of Ratliff and Rosenthal’s algorithm for optimal picker routing. Operations Research Letters, 50(2):155–159.
- Hamilton Paths in Grid Graphs. SIAM Journal on Computing, 11(4):676–686.
- Karp, R. M. (1972). Reducibility among Combinatorial Problems. In Miller, R. E., Thatcher, J. W., and Bohlinger, J. D., editors, Complexity of Computer Computations: Proceedings of a symposium on the Complexity of Computer Computations, held March 20–22, 1972, at the IBM Thomas J. Watson Research Center, Yorktown Heights, New York, and sponsored by the Office of Naval Research, Mathematics Program, IBM World Trade Corporation, and the IBM Research Mathematical Sciences Department, The IBM Research Symposia Series, pages 85–103. Springer US, Boston, MA.
- Order picker routing in warehouses: A systematic literature review. International Journal of Production Economics, 224:107564.
- Exact algorithms for the order picking problem. Computers & Operations Research, 100:117–127.
- Prim, R. C. (1957). Shortest Connection Networks And Some Generalizations. Bell System Technical Journal, 36(6):1389–1401.
- Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem. Operations Research, 31(3):507–521.
- Routing order pickers in a warehouse with a middle aisle. European Journal of Operational Research, 133(1):32–43.
- Optimal Picking Policies in E-Commerce Warehouses. Management Science, page mnsc.2021.4275.
- A new mathematical programming formulation for the Single-Picker Routing Problem. European Journal of Operational Research, 253(1):68–84.
- Facilities planning. J. Wiley, Hoboken, NJ, 4th ed edition.
- Designing efficient order picking systems by combining planning problems: State-of-the-art classification and review. European Journal of Operational Research, 267(1):1–15.
- Order picking in parallel-aisle warehouses with multiple blocks: complexity and a graph theory-based heuristic. International Journal of Production Research, 57(3):888–906. Publisher: Taylor & Francis _eprint: https://doi.org/10.1080/00207543.2018.1489154.
- Order picking under random and turnover-based storage policies in fishbone aisle warehouses. IIE Transactions, 46(3):283–300.