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

DOI10.1287/IJOC.2022.0173MaRDI QIDQ6202326zbMATH OpenFDO

Authors Stefan Bock, Nils Boysen

Publication date 26 March 2024

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

Full work available at URL https://doi.org/10.1287/IJOC.2022.0173

zbMATH Keywords

branch-and-boundroutingscattered storagewarehousing

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Combinatorial optimization (90C27)

Recommendations

• Modeling Single-Picker Routing Problems in Classical and Modern Warehouses
• The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies
• Picker routing in rectangular mixed shelves warehouses
• Inventory routing in a warehouse: the storage replenishment routing problem

Cited in

(7)

• Modeling Single-Picker Routing Problems in Classical and Modern Warehouses
• The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies
• Integrated scattered storage and picker routing in picker-to-parts warehouses
• Stow \& pick: optimizing combined stowing and picking tours in scattered storage warehouses
• A survey on the traveling salesman problem and its variants in a warehousing context
• Due date-oriented picker routing, an efficient exact solution algorithm, and its application to pick-from-store omnichannel retailing
• A note on the complexity of the picker routing problem in multi-block warehouses and related problems

This page was built for publication: Routing Replenishment Workers: The Prize Collecting Traveling Salesman Problem in Scattered Storage Warehouses

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