복수포장대 좁은통로 피킹시스템의 주문묶음 알고리즘
Order batching algorithms for a narrow-aisle order picking system with two depots
- 문서 유형
- 연구출판물 · 학술지 논문
- 등재
- KCI
- 저널
- 한국SCM학회지18(2) · pp.105 · 2018
- 피인용
- KCI 2
- ISSN
- 1598-382X
저자
- 김정환제1저자LG, KO
- 응웬투이모부산대학교, 공과대학, 산업공학과, KO
- 헤녹 열니아스 피브리안토부산대학교, 공과대학, 산업공학과, KO
- 김영주한국철도기술연구원, KO
- 홍순도교신저자부산대학교, 공과대학, 산업공학과, KO
초록
This study proposes a joint order batching and depot selecting model (JOBDS) in narrow-aisle order picking systems (OPSs). The two depots in a hypothetical narrow-aisle OPS distribute the operational burden imposed by inspectidon and packaging. We build an order batching model and develop a mixed integer programming (MIP) algorithm considering the travel distance to each depot’s location for a 48-order and a 72-order case. We also develop large-scale heuristic algorithms: Seed and Saving algorithms. A comparison to order batching model with single depot (OBSD) shows that the proposed algorithms shorten the travel distance on average 4.19 ~ 13.38%. We provide additional simulation studies to analyze total travel time by walk speed, order size, inspection and packaging times, number of pickers, and location of depots. Consistently, travel time in JOBDS is operationally advantageous compared to OBSD.
키워드
Facility logisticsOrder pickingOrder batching and depot selectionMixed Integer Programming.
식별자
- KCI
- ART002398612



로그인
연구물 목록으로