물류센터 수작업 오더 피킹 문제에서의 오더 배칭 방법과 라우팅 정책 연구

초록

This paper reports on effect of order-picking performance and order batching methods with S-shape, Largest gap and Combine routing policies under random storage policy and CBS (Class-Based Storage) policy. A new batching method, based on Seed algorithms, is proposed. In addition, this paper compares the performance of different order batching methods using a computer simulation and applying stochastic parameters, which applies diverse demand conditions that each order has particular number of SKU, and each SKU has a particular quantity. The results shows that under CBS policy, Total order-picking Travel Distance (TTD) becomes significantly shorter than under random storage policy. Regarding routing policy, Combined policy performs better than other routing policies regardless of storage policy. The proposed batching method presented in this paper is an intermediate form of two distance metrics: one measures the essential distance or time between two orders, the other uses an approximate distance metric. In general, the proposed batching method performs better than other batching methods.