Modeling Single-Picker Routing Problems in Classical and Modern Warehouses

DOI10.1287/ijoc.2020.1040OpenAlexW3152506438MaRDI QIDQ4995081

Dominik Goeke, Michael Schneider

Publication date: 23 June 2021

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.13344

zbMATH Keywords

decouplingwarehouse managementpicker routingscattered storagemultiple end depots

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Related Items (3)

Picker Routing in AGV-Assisted Order Picking Systems ⋮ Arc routing based compact formulations for picker routing in single and two block parallel aisle warehouses ⋮ Cost-neutral reduction of infection risk in picker-to-parts warehousing systems

Cites Work

• A new mathematical programming formulation for the single-picker routing problem
• A model for warehouse order picking
• Picker routing in the mixed-shelves warehouses of e-commerce retailers
• Picker routing in rectangular mixed shelves warehouses
• Optimally solving the joint order batching and picker routing problem
• Warehousing in the e-commerce era: a survey
• Exact algorithms for the order picking problem
• Integer Programming Formulation of Traveling Salesman Problems
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem
• Routing order pickers in a warehouse with a middle aisle

This page was built for publication: Modeling Single-Picker Routing Problems in Classical and Modern Warehouses