考虑随机行程时间的电商同城快递取派联合优化模型
Joint Optimization Model for Pickup and Delivery of E-Commerce Intra-City Express Delivery Considering Random Travel Time
摘要: 随着电商订单即时配送需求的激增,城市交通波动会削弱同城快递取派调度的可行性与服务可靠性,在行程时间随机的场景下电商订单延误风险更为突出。在行程时间不确定条件下兼顾电商平台运营成本与订单履约时效,生成稳健的订单分配与配送车路径方案。针对电商末端配送场景,构建了基于蒙特卡洛采样评估随机行程时间的取派调度模型,并设计了变邻域搜索与模拟退火融合的VNS-SA启发式算法进行求解。基于Solomon VRPTW C类基准算例,结合电商订单特征改造生成快递订单与配送车初始位置。实现电商订单全覆盖,启用9辆配送车,总成本2044.04,总里程336.18 km,总订单在途时间833.65 min,时间窗违规值4.05 min。
Abstract: With the surge in demand for instant delivery of e-commerce orders, urban traffic fluctuations undermine the feasibility and service reliability of urban courier pickup-and-delivery dispatch, making the risk of e-commerce order delays more pronounced under stochastic travel time conditions. To balance e-commerce platform operational costs and order fulfillment timeliness under travel time uncertainty, generating robust order assignment and delivery vehicle routing plans. Targeting the e-commerce last-mile delivery scenario, a courier pickup-and-delivery scheduling model was developed that evaluates stochastic travel times via Monte Carlo sampling, and a hybrid Variable Neighborhood Search combined with Simulated Annealing (VNS-SA) heuristic algorithm was designed for solution. Courier orders and initial delivery vehicle locations were generated based on modified Solomon VRPTW C-class benchmark instances, incorporating e-commerce order characteristics. Full e-commerce order coverage was achieved using 9 delivery vehicles, with a total cost of 2044.04, a total travel distance of 336.18 km, a total in-transit time of 833.65 min, and a total time-window violation of 4.05 min.
文章引用:潘旭, 袁鹏程. 考虑随机行程时间的电商同城快递取派联合优化模型[J]. 电子商务评论, 2026, 15(6): 878-887. https://doi.org/10.12677/ecl.2026.156706

参考文献

[1] Baldacci, R., Bartolini, E. and Mingozzi, A. (2011) An Exact Algorithm for the Pickup and Delivery Problem with Time Windows. Operations Research, 59, 414-426. [Google Scholar] [CrossRef
[2] Karami, F., Vancroonenburg, W. and Vanden Berghe, G. (2020) A Periodic Optimization Approach to Dynamic Pickup and Delivery Problems with Time Windows. Journal of Scheduling, 23, 711-731. [Google Scholar] [CrossRef
[3] Ando, N. and Taniguchi, E. (2006) Travel Time Reliability in Vehicle Routing and Scheduling with Time Windows. Networks and Spatial Economics, 6, 293-311. [Google Scholar] [CrossRef
[4] Li, X., Tian, P. and Leung, S.C.H. (2010) Vehicle Routing Problems with Time Windows and Stochastic Travel and Service Times: Models and Algorithm. International Journal of Production Economics, 125, 137-145. [Google Scholar] [CrossRef
[5] Taş, D., Dellaert, N., van Woensel, T. and de Kok, T. (2013) Vehicle Routing Problem with Stochastic Travel Times Including Soft Time Windows and Service Costs. Computers & Operations Research, 40, 214-224. [Google Scholar] [CrossRef
[6] Adulyasak, Y. and Jaillet, P. (2016) Models and Algorithms for Stochastic and Robust Vehicle Routing with Deadlines. Transportation Science, 50, 608-626. [Google Scholar] [CrossRef
[7] Wang, Z., Dessouky, M., Van Woensel, T. and Ioannou, P. (2023) Pickup and Delivery Problem with Hard Time Windows Considering Stochastic and Time-Dependent Travel Times. EURO Journal on Transportation and Logistics, 12, Article ID: 100099. [Google Scholar] [CrossRef
[8] Rajabi-Bahaabadi, M., Shariat-Mohaymany, A., Babaei, M. and Vigo, D. (2021) Reliable Vehicle Routing Problem in Stochastic Networks with Correlated Travel Times. Operational Research, 21, 299-330. [Google Scholar] [CrossRef
[9] Klapp, M.A., Erera, A.L. and Toriello, A. (2018) The Dynamic Dispatch Waves Problem for Same-Day Delivery. European Journal of Operational Research, 271, 519-534. [Google Scholar] [CrossRef
[10] Côté, J., Alves de Queiroz, T., Gallesi, F. and Iori, M. (2023) A Branch-And-Regret Algorithm for the Same-Day Delivery Problem. Transportation Research Part E: Logistics and Transportation Review, 177, Article ID: 103226. [Google Scholar] [CrossRef
[11] Mahmoudi, N., Sadegheih, A., Hosseini-Nasab, H. and Zare, H.K. (2023) Routing and Scheduling Decisions for a Single-Hub Same-Day Delivery Network. Journal of Engineering Research, 11, 198-211. [Google Scholar] [CrossRef