[1] 周林,康燕,宋寒,等.送提一体与终端共享下的最后一公里配送选址-路径问题[J].计算机集成制造系统,2019,25(7):1855-1864. [2] DAGANZO C F, ERERA A L. On planning and design of logistics systems for uncertain environments[J]. Lecture Notes in Economics and Mathematical Systems, 1999, 480: 3-21. [3] 刘兴,贺国光,高文伟.一种有时间约束的多车辆协作路径模型及算法[J].系统工程,2005(4):108-112. [4] 刘长石,赖明勇.基于模糊聚类与车辆协作策略的随机车辆路径问题[J].管理工程学报,2010,24(2):75-78,67. [5] 许争争,唐加福.基于顾客点协作的车辆路径问题的两阶段算法[J].工业工程与管理,2014,19(3):1-7,25. [6] 葛显龙,徐玖平,王伟鑫.交通限行条件下基于车辆协作的城市物流换乘联运问题研究[J].中国管理科学,2017,25(10):130-139. [7] HA Q M, DEVILE Y, PHAM Q D, et al. On the min-cost traveling salesman problem with drone[J]. Transportation Research Part C: Emerging Technologies, 2018, 86: 597-621. [8] AGATZ N, BOUMAN P, SCHMIDT M. Optimization approaches for the traveling salesman problem with drone[J]. Transportation Science, 2018, 52(4): 965-981. [9] ROBERTI R, RUTHMAIR M. Exact methods for the traveling salesman problem with drone[J]. Transportation Science, 2021, 55(2): 315-335. [10] 彭勇,黎元钧.考虑疫情影响的卡车无人机协同配送路径优化[J].中国公路学报,2020,33(11):77-86. [11] MACRINA G, PUGLIESE L, GUERRIERO F, et al. Crowd-shipping with time windows and transshipment nodes[J]. Computers & Operations Research, 2020, 113: 104806. [12] ARCHETTI C, SAVELSBERGH M, SPERANZA M G. The vehicle routing problem with occasional drivers[J]. European Journal of Operational Research, 2016, 254(2): 472-480. [13] MACRINA G, PUGLIESE L D P, GUERRIERO F, et al. The vehicle routing problem with occasional driversand time windows[C]//Optimization and Decision Science: Methodologies and Applications: ODS, September 4-7, 2017, Sorrento, Italy. Springer International Publishing, 2017: 577-587. [14] ARSLAN A M, AGTZ N, KROON L, et al. Crowdsourced delivery—A dynamic pickup and delivery problem with ad hoc drivers[J]. Transportation Science, 2019, 53(1): 222-235. [15] GLOVER F. Heuristics for integer programming using surrogate constraints[J]. Decision Science,1977, 8(7): 156-166. [16] SOLOMON M M. Algorithms for the vehicle routing and scheduling problems with time window constraints[J]. Operations Research, 1987, 35(2): 254-265. |