AGV支援型混合棚倉庫における統合オーダーバッチングと経路計画の定式化と解法
Formulating and solving integrated order batching and routing in multi-depot AGV-assisted mixed-shelves warehouses
混合棚保管とAGV搬送を組み合わせた倉庫で、注文のバッチングとAGV経路を同時に最適化する問題を定式化し、変数近傍探索で効率的に解く手法を提案した。
著者: Lin Xie, Hanyi Li, Laurin Luttmann
分類: math.OC, cs.AI, cs.RO
原文アブストラクト
Different retail and e-commerce companies are facing the challenge of assembling large numbers of time-critical picking orders that include both small-line and multi-line orders. To reduce unproductive picker working time as in traditional picker-to-parts warehousing systems, different solutions are proposed in the literature and in practice. For example, in a mixed-shelves storage policy, items of the same stock keeping unit are spread over several shelves in a warehouse; or automated guided vehicles (AGVs) are used to transport the picked items from the storage area to packing stations instead of human pickers. This is the first paper to combine both solutions, creating what we call AGV-assisted mixed-shelves picking systems. We model the new integrated order batching and routing problem in such systems as an extended multi-depot vehicle routing problem with both three-index and two-commodity network flow formulations. Due to the complexity of the integrated problem, we develop a novel variable neighborhood search algorithm to solve the integrated problem more efficiently. We test our methods with different sizes of instances, and conclude that the mixed-shelves storage policy is more suitable than the usual storage policy in AGV-assisted mixed-shelves systems for orders with different sizes of order lines (saving up to 62% on driving distances for AGVs). Our variable neighborhood search algorithm provides optimal solutions within an acceptable computational time.
