| 제목 | 정시배송가능 시간대(time window) 제시를 위한 다중정류소(multi-depot) 다회전 (multi-trip) 차량경로문제: 온라인 할당 및 오프라인 재할당 접근법 |
|---|---|
| Title | Multi-depot Multi-trip Vehicle Routing Problemfor Offering Available Delivery Time Windows: Online Assignment and Offline Reassignment Approach |
| 저자 |
이기주 (한국항공대학교 항공교통물류학과) 정동진 (한국항공대학교 항공교통물류학과) 채준재* (한국항공대학교 항공교통물류학과) |
| Author |
Keyju Lee(School of Air Transport, Transportation and Logistics, Korea Aerospace University) Dongjin Jeong(School of Air Transport, Transportation and Logistics, Korea Aerospace University) Junjae Chae†(School of Air Transport, Transportation and Logistics, Korea Aerospace University) |
| Bibliography | Journal of Logistics Science & Technology, 3(2),1~17, 2022, |
| DOI | |
| Key Words | On-demand Delivery, Vehicle Routing, Vehicle Assignment, Vehicle Reassignment |
| Abstract | The last mile delivery efficiency is becoming prominent, as its demand is boosting. As the last mile delivery provider and customer are both interested in differentiated services, on-demand delivery and time-reserved delivery services are receiving attention. This research characterizes the probleminto multi-depot multi-trip vehicle routing problem for offering available delivery time windows(MD&T VRPOTW). A mathematical formulation for the problem that includes previous schedule constraints and current-time constraints is provided. A strategy for reducing complexity is suggested. The problems were solved using CPLEX, and the complexity reduction was proven effective in online assignments. The experiments on offline re-assignment showed that over 10% of delivery distance (time) can be reduced when the schedules were re-assigned or re-optimized after about 10 delivery scheduled had been accumulated. This research and directed future research should contribute to the improvement of on-demand delivery and time-reserved delivery services. |
| PDF download | JM_3[2]-P1~17[3].pdf |