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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
