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)

zbMATH Keywords

routingbranch-and-boundwarehousingscattered storage

Mathematics Subject Classification ID

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

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

(1)

• The single picker routing problem with scattered storage: modeling and evaluation of routing and storage policies

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)