期刊
COMPUTERS & INDUSTRIAL ENGINEERING
卷 147, 期 -, 页码 -出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cie.2020.106645
关键词
Order picking; Dynamic order pattern; Picker routing; Order batching; Storage location assignment; Particle swarm optimization
Short and reliable delivery lead times are crucial for many buying decisions, making efficiently operated order picking systems a critical contributor to a company's competitiveness. To pick orders fast and with minimal effort, three planning problems need to be solved, namely the assignment of items to storage locations, the consolidation of orders in batches and the routing of the order pickers through the warehouse. Even though the problems are strongly interdependent, they have so far largely been solved separately, leading to losses in efficiency. Recent research has shown that a joint solution can lead to significant performance improvements as compared to individual solutions. Up to now, no method is available that solves all three problems jointly. This work contributes to closing this research gap by proposing an iterative heuristic method that solves the problems jointly and that takes account of future dynamics in customer demand and their influence on the three planning problems. The performance of the method is illustrated in numerical experiments. The results of our studies indicate that the method may lead to significant savings in travel distance.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据