A DATA-DRIVEN APPROACH TO THE CITY LAST-MILE DELIVERY PROBLEM TOWARDS THE APPLICATION OF SHARED DELIVERY TERMINALS

被引:1
作者
Zhang, Shuzhu [1 ]
Liu, Xiaoqin [1 ]
Tian, Jinyue [1 ]
机构
[1] Zhejiang Univ Finance & Econ, Sch Management, Hangzhou, Peoples R China
来源
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE | 2024年 / 31卷 / 06期
关键词
Last-Mile Delivery; Shared Delivery Terminals; Data-Driven Approach; Predictive Optimization; Support Vector Regression; Adaptive Large Neighborhood Search; ROUTING PROBLEM; PARCEL LOCKERS; TIME WINDOWS; LOCATION;
D O I
10.23055/ijietap.2024.31.6.10087
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
The application of shared delivery terminals is a promising trend in the development of last-mile delivery in city logistics because it can effectively improve the delivery efficiency of couriers and relax the time-window restrictions for customers to pick up their parcels. In this study, we investigated a vehicle routing problem (VRP) for the application of shared delivery terminals in last-mile delivery. In practical delivery scenarios, the random storage and retrieval behaviors of customers can affect the usage of shared delivery terminals and lead to inevitable uncertainty regarding their available capacity, thereby increasing the complexity of last-mile delivery. To address this issue, we propose a VRP with stochastic terminal capacity (VRPSTC) and design a data-driven predictive optimization approach by collecting first-hand usage data on shared delivery terminals, forecasting the available capacity and optimizing the operational delivery schedule in practice. Numerical experiments show that the proposed data-driven approach can effectively solve the proposed VRPSTC and contribute to an approximately 17%-20% reduction in the total delivery cost compared with traditional stochastic optimization. The proposed VRPSTC is expected to enrich the concept of last-mile delivery in terms of both theoretical research and practical industrial applications.
引用
收藏
页码:1274 / 1295
页数:22
相关论文
共 46 条
[1]   PARCEL LOCKERS LOCATION AND ROUTING PROBLEM: A BIBLIOMETRIC, DESCRIPTIVE, AND CONTENT ANALYSIS OF EXISTING STUDIES [J].
Akdogan, Kutay ;
Ozceylan, Eren .
INTERNATIONAL JOURNAL OF INDUSTRIAL ENGINEERING-THEORY APPLICATIONS AND PRACTICE, 2022, 29 (05) :730-757
[2]  
[Anonymous], Research, V316, P942
[3]   Improving Sales Forecasting Accuracy: A Tensor Factorization Approach with Demand Awareness [J].
Bi, Xuan ;
Adomavicius, Gediminas ;
Li, William ;
Qu, Annie .
INFORMS JOURNAL ON COMPUTING, 2022, 34 (03) :1644-1660
[4]   Last-mile delivery concepts: a survey from an operational research perspective [J].
Boysen, Nils ;
Fedtke, Stefan ;
Schwerdfeger, Stefan .
OR SPECTRUM, 2021, 43 (01) :1-58
[5]   Last mile deliveries with lockers: formulations and algorithms [J].
Buzzega, Giovanni ;
Novellani, Stefano .
SOFT COMPUTING, 2023, 27 (18) :12843-12861
[6]   The sharing economy and consumer preferences for environmentally sustainable last mile deliveries [J].
Caspersen, Elise ;
Navrud, Stale .
TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2021, 95
[7]   A Multi-Trip Split-Delivery Vehicle Routing Problem with Time Windows for Inventory Replenishment Under Stochastic Travel Times [J].
Chu, James C. ;
Yan, Shangyao ;
Huang, Han-Jheng .
NETWORKS & SPATIAL ECONOMICS, 2017, 17 (01) :41-68
[8]   An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem [J].
Dayarian, Iman ;
Crainic, Teodor Gabriel ;
Gendreau, Michel ;
Rei, Walter .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2016, 95 :95-123
[9]   An adaptive large neighborhood search heuristic for the Pollution-Routing Problem [J].
Demir, Emrah ;
Bektas, Tolga ;
Laporte, Gilbert .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 223 (02) :346-359
[10]   Analytics for an Online Retailer: Demand Forecasting and Price Optimization [J].
Ferreira, Kris Johnson ;
Lee, Bin Hong Alex ;
Simchi-Levi, David .
M&SOM-MANUFACTURING & SERVICE OPERATIONS MANAGEMENT, 2016, 18 (01) :69-88