V2V(Vehicle to Vehicle) 집화 및 배송체계의 간선차량 순환노선 설정문제
Cyclic Trunk Line Routing Problem in V2V(Vehicle to Vehicle) Pickup and Delivery System
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
전자상거래 제품의 집화/배달 속도와 효율성은 고객 선택에 있어 중요해졌다. 최근 기존 택배나 P2P(포인트 투 포인트) 배송 서비스보다 저렴한 비용으로 당일 배송을 보장하는 업체가 차량 대 차량(V2V) 집화/배송 시스템을 제안했다. V2V 시스템은 차량이 지속적으로 간선 노선을 순환하며 상품의 배송에 있어서 상대적으로 적은 인프라 투자로 운영될 수 있다. 본 연구는 순환 간선 경로 문제(CTLRP)를 공식화하여 순환 경로를 생성하는 방법을 제안한다. 혼합 정수계획법이 사용되었으며 해당 문제를 CPLEX를 통해 해결한다. 다음으로, 이 연구는 대한민국의 일부 주요 도시에 적용된 사례를 보여준다. 사례 연구를 분석한 결과, V2V 시스템은 P2P 시스템에 비해 품목당 필요한 배송 거리(시간)를 크게 줄일 수 있는 것으로 나타났다.
Abstract
The speed and efficiency of pickup and delivery of e-commerce products have become important in customers’ choice. Recently, a vehicle to vehicle (V2V) pickup and delivery system was suggested by a company that guarantees same-day delivery at a lower rate than the conventional courier service or point to point (P2P) delivery service. The V2V system may operate on relatively small infrastructural investments as the products are transferred from vehicle to vehicle that are continuously circulating trunk line routes. This study proposes a way of creating the circulating routes by formalizing the cyclic trunk line routing problem (CTLRP). A mixed integer programming approach is provided, and the model is solved using CPLEX. Then, the study provides examples of implementation on some major cities in South Korea. The analysis on the case studies shows that the V2V system can significantly reduce the delivery distance (time) required per an item compared to the P2P system.
참고문헌 (33)
- Agrawal, J., "Transit Route Network Design Using Parallel Genetic Algorithm", Journal of Computing in Civil Engineering, 18(3), pp.248~256 (2004)[DOI]
- Alfonso, V., "Online appendix - E-commerce in the pandemic and beyond", BIS Bulletin, (36) (2021)
- Bazrafshan, R., "Comparison of the sub-tour elimination methods for the asymmetric traveling salesman problem applying the SECA method", Axioms, 10(1), pp.1~14 (2021)[DOI]
- Belgin, O., "Two-echelon vehicle routing problem with simultaneous pickup and delivery : Mathematical model and heuristic approach", Computers and Industrial Engineering, 115, pp.1~16 (2018)[DOI]
- Bozer, Y. A., "Tandem Configurations for Automated Guided Vehicle Systems and the Analysis of Single Vehicle Loops", IIE Transactions(Institute of Industrial Engineers), 23(1), pp.72~82 (1991)[DOI]
- Bozer, Y. A., "Tandem AGV systems : A partitioning algorithm and performance comparison with conventional AGV systems", European Journal of Operational Research, 63(2), pp.173~191 (1992)[DOI]
- Carlos E. Andrade, "Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem", GECCO ’13: Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, pp.463~471 (2013)
- "One-stop logistics solution" (2022)[URL]
- "We building the future of commerce" (2022)[URL]
- Crainic, T. G., "Models for Evaluating and Planning City Logistics Systems", Transportation Science, 43(4), pp.432~454 (2009)[DOI]
- Dubois, D., "A Set of Methods in Transportation Network Synthesis and Analysis", Journal of the Operational Research Society, 30(9), pp.797~808 (1979)[DOI]
- ElMekkawy, T. Y., "A new memetic algorithm for optimizing the partitioning problem of tandem AGV systems", International Journal of Production Economics, 118(2), pp.508~520 (2009)[DOI]
- Flood, M. M., "The Traveling-Salesman Problem", Operations Research, 4(1), pp.61~75 (1956)[DOI]
- "Graphhopper Routing Engine" (2022)[URL]
- Hasselstrom, D., "Public Transporation Planning: A Mathematical Programming Approach", Doctor, pp.1981
- "A Flow Formulation for Steiner Tree Problem" (2018)[URL]
- "There is no delivery app or restaurant left...Where did all that delivery money go?" (2022)[URL]
- Khuller, S., "On strongly connected digraphs with bounded cycle length", Discrete Applied Mathematics, 69(3), pp.281~289 (1996)[DOI]
- Kim, M., "A transit route network design problem considering equity", Sustainability(Switzerland), 11(13) (2019)[DOI]
- "Trends in online shopping in December 2021 and annually" (2021)[URL]
- "Incheon Metropolitan Government has demonstrated that “one-day delivery based on shared logistics network”" (2022)[URL]
- Laporte, G., "The Vehicle Routing Problem : An overview of exact and approximate algorithms", European Journal of Operational Research, 59(3), pp.345~358 (1992)[DOI]
- "The same-day delivery network without a logistics center created by Incheon City in Yeonsu-gu" (2022)[URL]
- "Same-day delivery for Olive Young without worrying about delivery" (2022)[URL]
- Öncan, T., "A comparative analysis of several asymmetric traveling salesman problem formulations", Computers and Operations Research, 36(3), pp.637~654 (2009)[DOI]
- "Setting up a local copy of the OpenStreetMap database" (2015)[URL]
- "The Age of Micro Fulfillment _ Progressive Grocer" (2021)[URL]
- "What is the expected pain and exit of the fast-growing delivery industry due to COVID-19?" (2021)[URL]
- Taha Benslimane, M., "Exact method for the multi-region vehicle routing problem in large quantities by a heterogeneous fleet of vehicles", 2014 International Conference on Logistics Operations Management (2014)
- "A real one-day delivery for everyone today" (2022)[URL]
- "Technology required to reduce delivery time" (2022)[URL]
- Yang, Z., "A Parallel Ant Colony Algorithm for Bus Network Optimization", Computer-Aided Civil and Infrastructure Engineering, 22(1), pp.44~55 (2007)[DOI]
- Yu, B., "Transit route network design-maximizing direct and transfer demand density", Transportation Research Part C : Emerging Technologies, 22, pp.58~75 (2012)[DOI]