A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse |
| |
Authors: | Marek Matusiak,René de Koster,Leo Kroon,Jari Saarinen |
| |
Affiliation: | 1. Finnish Centre of Excellence in Generic Intelligent Machines Research, Aalto University, P.O. Box 15500, 00076 Aalto, Finland;2. Department of Management of Technology and Innovation, Rotterdam School of Management, Erasmus University, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands;3. Department of Decision and Information Sciences, Rotterdam School of Management, Erasmus University, P.O. Box 1738, 3000 DR Rotterdam, The Netherlands |
| |
Abstract: | Batching customer orders in a warehouse can result in considerable savings in order pickers’ travel distances. Many picker-to-parts warehouses have precedence constraints in picking a customer order. In this paper a joint order-batching and picker routing method is introduced to solve this combined precedence-constrained routing and order-batching problem. It consists of two sub-algorithms: an optimal A∗-algorithm for the routing; and a simulated annealing algorithm for the batching which estimates the savings gained from batching more than two customer orders to avoid unnecessary routing. For batches of three customer orders, the introduced algorithm produces results with an error of less than 1.2% compared to the optimal solution. It also compares well to other heuristics from literature. A data set from a large Finnish order picking warehouse is rerouted and rebatched resulting in savings of over 5000 kilometres or 16% in travel distance in 3 months compared to the current method. |
| |
Keywords: | Heuristics Logistics Order picking Batching Precedence |
本文献已被 ScienceDirect 等数据库收录! |
|