Modeling Single-Picker Routing Problems in Classical and Modern Warehouses

DOI10.1287/IJOC.2020.1040MaRDI QIDQ4995081zbMATH OpenOpenAlexFDO

Authors 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

decouplingmultiple end depotspicker routingscattered storagewarehouse management

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Recommendations

• The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies
• A new mathematical programming formulation for the single-picker routing problem
• Routing Replenishment Workers: The Prize Collecting Traveling Salesman Problem in Scattered Storage Warehouses
• scientific article; zbMATH DE number 1189262

Cites work

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

Cited in

(16)

• An extensible multi-block layout warehouse routing optimization model
• 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
• Energy minimizing order picker forklift routing problem
• Routing Replenishment Workers: The Prize Collecting Traveling Salesman Problem in Scattered Storage Warehouses
• Locating charging stations and routing drones for efficient automated stocktaking
• A new policy for scattered storage assignment to minimize picking travel distances
• Human-and-cost-centric storage assignment optimization in picker-to-parts warehouses
• The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies
• A polynomial-time dynamic programming algorithm for an optimal picking problem in automated warehouses
• Integrated scattered storage and picker routing in picker-to-parts warehouses
• A survey on the traveling salesman problem and its variants in a warehousing context
• Picker routing in scattered storage warehouses: an evaluation of solution methods based on TSP transformations
• Solving the multi-block order batching problem with branch-price-and-cut
• A linear-size model for the single picker routing problem with scattered storage

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4995081)