도시 물류 활성화를 위한 협력적 배송문제의 최적화 모형과 해법 연구
Optimization Model and Solution to Collaborative Delivery Problems for Urban Logistics
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
본 연구는 클라우드 기반의 협력적 배송에서 협력적 배송을 통한 이동거리 단축 효과를극대화하는 배달원-수요자 매칭 문제를 다루고 있다. 정수계획법 기반의 최적화 모형을 제시하였으며 배달원-수요자 매칭 문제의 계산복잡도가 NP-hard에 속하는 문제임을 증명하였다. 또한, 문제 구조가 특수한 경우(K=2)에 한하여 최대매칭문제(maximal matching problem) 로 변환이 가능하며 탐욕(greedy) 해법으로 다항시간안에 최적해를 구할 수 있음을 보였다. 본 연구결과는 클라우드 기반의 협력적 배송 플랫폼 운영자가 배달원과 수요자를 매칭하는문제에서 실무적으로 의미있는 시사점을 줄 수 있으며 향후 연구에서는 배달원-수요자 매칭문제의 일반적인 경우(K≥3)에 대한 효과적인 휴리스틱 개발과 성능분석이 진행될 필요가있다.
Abstract
This study addresses the problem of delivery man-consumer matching, which maximizes the effect of shortening the travel distance through cooperative delivery in cloud sourced delivery. An optimization model based on integer programming was presented and proved that the computational complexity of the delivery man-consumer matching problem belongs to NP-hard. In addition, it was shown that the problem structure can be converted into a maximal matching problem in special cases (K=2), and the optimal solution can be obtained in a polynomial time by the greedy heuristic method. The results of this study can have practical implications for the problem of cloud sourced delivery platform operators and in future studies, effective heuristic development and performance analysis of the general case of delivery person-consumer matching problem (K≥3) need to be carried out.
참고문헌 (14)
- "일반인 배송 플랫폼 ‘부릉 프렌즈’ 경인지역으로 확장" (2021)[URL]
- 이승원, "라스트마일 물류는 어떻게 다른가?", IE 매거진, 27(3), pp.30~35 (2020)
- Afonso, S, "Delivery systems with crowd-sourced drivers: A pickup and delivery problem with transfers", Networks, 76, pp.232~255 (2020)
- Ahuja, R, "Network Flows: Theory, Algorithms, and Applications" (1993), Prentice Hall
- Aymeric, P, "Modeling the acceptability of crowdsourced goods deliveries:Role of context and experience effects", Transportation Research Part E, 105, pp.18~38 (2017)
- Balas, E, "The prize collecting traveling salesman problem", Networks, 19, pp.621~636 (1989)
- Baris, Y, "Service and capacity planning in crowd-sourced delivery", Transportation Research Part C: Emerging Technologies, 100, pp.177~199 (2019)
- Blokh, D, "Maximizing traveling salesman problem for special matrices", Discrete Applied Mathematics, 56(1), pp.83~86 (1995)
- Hakim, A, "Building a collaborative solution in dense urban city settings to enhance parcel delivery: An effective crowd model in Paris", Transportation Research Part E, 119, pp.223~233 (2018)
- Harri, P, "Transport reduction by crowdsourced deliveries : a library case in Finland", Journal of Cleaner Production, 132, pp.240~251 (2016)
- Kafle, N, "Design and modeling of a crowdsource-enabled system for urban parcel relay and delivery", Transportation Research Part B, 99, pp.62~82 (2017)
- Moritz, B, "The integration of item-sharing and crowdshipping: Can collaborative consumption be pushed by delivering through the crowd?", Transportation Research Part B, 111, pp.227~243
- Tho, V, "Crowd-shipping services for last mile delivery:Analysis from American survey data", Transportation Research Interdisciplinary Perspectives, 1, pp.100008~ (2019)
- Wang, Y, "Towards enhancing the last-mile delivery: An effective crowd-tasking model with scalable solutions", Transportation Research Part E, 93, pp.279~293 (2016)