Title
Optimally solving the joint order batching and picker routing problem.
Abstract
•We propose a novel exact algorithm for order picking and batching in warehouses.•We introduce several new inequalities that greatly improve computational results.•The inequalities prevent many solutions that violate subtour breaking constraints.•The formulation is general for warehouses with any number of blocks.•The method improves on assignment heuristics for very large instances.
Year
DOI
Venue
2017
10.1016/j.ejor.2017.03.069
European Journal of Operational Research
Keywords
DocType
Volume
Integer programming,Inventory management,Order batching,Order picking,Picker routing
Journal
262
Issue
ISSN
Citations 
3
0377-2217
9
PageRank 
References 
Authors
0.52
25
3
Name
Order
Citations
PageRank
Cristiano Arbex Valle1404.90
J. E. Beasley231520.29
Alexandre Salles da Cunha324222.32