Name
Abstract | ||
|---|---|---|
•We propose a formulation for order batching that approximates routing distance.•We extend our formulation for warehouses with multiple blocks.•We introduce new constraints for breaking symmetry and improving LP lower bounds.•We propose a partial integer optimisation heuristic based on our formulation.•Our results are competitive with previous approaches, in lower computation times. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.ejor.2020.01.022 | European Journal of Operational Research |
Keywords | Field | DocType |
Integer programming,Inventory management,Order batching,Order picking,Partial integer optimisation,Picker routing | Integer,Mathematical optimization,Distance approximation,Heuristic (computer science),Grocery shopping,Linear programming relaxation,Grid,Mathematics | Journal |
Volume | Issue | ISSN |
284 | 2 | 0377-2217 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Cristiano Arbex Valle | 1 | 40 | 4.90 |
| J. E. Beasley | 2 | 315 | 20.29 |