Abstract
Because of time and cost constraints, item picking plays a major role in warehouse operations. Considering diversified orders and a constant warehouse design, deciding how to combine each batch and picker route effectively is a challenge in warehouse management. In this study, we focus on the evaluation of order-batching strategies for a single picker facing multiple orders with the objective of minimizing the total traveling distance. We propose two-stage simulated annealing and variable neighborhood search algorithms to solve the combined problem. The orders are first merged into batches, followed by determining the sequence in each batch. The computational analysis revealed that the best-fit-decreasing (BFD) batch ordering strategy in the two-stage algorithms, the variable neighborhood search algorithm, obtained superior solutions to those of the simulated annealing algorithm.
Subject
Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science
Reference54 articles.
1. Tompkins, J.A., White, J.A., Bozer, Y.A., and Tanchoco, J.M.A. Facilities Planning, 2003.
2. An efficient hybrid algorithm for integrated order batching, sequencing and routing problem;Chen;Int. J. Prod. Econ.,2015
3. Joint order batching and picker routing in single and multiple-cross-aisle warehouses using cluster-based tabu search algorithms;Kulak;Flex. Serv. Manuf. J.,2012
4. A throughput model for carousel/VLM pods;Meller;IIE Trans.,2004
5. Innovative application of an integrated multi-level conveying device to a mobile storage system;Chang;Int. J. Adv. Manuf. Technol.,2006