| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 715195 | IFAC Proceedings Volumes | 2013 | 6 Pages |
Abstract
In this work we introduce Mixed Integer Linear Programming (MILP) formulations for the Order Batching Problem considering traversal and return routing policies. The proposed MILP formulations have been tested on randomly generated instances and compared with the well-known savings algorithm. According to our extensive computational experiments we can say that the proposed MILP formulations are quite useful to yield good upper bounds and hence, they can be used for benchmarking purposes.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
