Abstract
ABSTRACTThis article studies the storage assignment and order batching problem in the Kiva mobile fulfilment system. The storage assignment model aims to decide which product to put in which pod to maximize the product similarity and the order batching model aims to minimize the number of visits of pods. To solve the order batching problem, a heuristic is proposed, where a batch schedule is initialized with the objective of maximizing the order association or minimizing order alienation and improved by variable neighbourhood search. Computational experiments are conducted to verify the performance of the proposed model and algorithm.
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.
