[1] Yang X, Straussy A K, Curriez C, et al. Choice-based demand management and vehicle routing in e-fullment[J]. Transportation Science,2014, 50(2):473-488. [2] Wang Xuping, Zhan Linmin, Ruan Junhu, et al. How to choose "Last Mile" delivery modes for e-fulfillment[EB/OL]. http://dx.doi.org/10.1155/2014/417129,2014. [3] 张锦, 陈义友. 物流"最后一公里"问题研究综述[J]. 中国流通经济,2015, (4):23-32. [4] 国家邮政局. 国家邮政局公布2019年邮政行业运行情况[EB/OL]. http://www.mot.gov.cn/tongjishuju/youzheng/202001/t20200116_3325044.html,2020. [5] 陈玉光, 陈志祥. 基于准时送货和最小耗油的配送车辆路径问题研究[J]. 中国管理科学,2015,23(S1):156-164. [6] 赵泉午, 赵军平, 林娅. 基于O2O的大型零售企业城市配送网络优化研究[J]. 中国管理科学,2017, 25(9):159-167. [7] 葛显龙, 徐玖平, 王伟鑫. 交通限行条件下基于车辆协作的城市物流换乘联运问题研究[J]. 中国管理科学,2017, 25(10):130-139. [8] 陈淮莉, 卫亚运, 李景瑜. 交付期约束下的网络零售配送多时隙选项定价[J]. 系统工程学报,2016, 31(4):515-525. [9] 陈义友, 张锦, 罗建强. 顾客选择行为对自提点选址的影响研究[J]. 中国管理科学,2017, 25(5):135-144. [10] 许茂增, 余国印. 城市配送研究的新进展[J]. 中国流通经济,2014, (11):29-36. [11] Agatz N, Campbell A, Fleischmann M, et al. Time slot schedule design for e-fulllment[R]. Working Paper, Netherlands:RSM Erasmus University, 2007. [12] Agatz N, Campbell A, Fleischmann M, et al. Time slot management in attended home delivery[J]. Transportation Science,2011, 45(3):435-449. [13] Bent R W, Hentenryck P V. Scenario-based planning for partially dynamic vehicle routing with stochastic customers[J]. Operations Research,2004, 52(6):977-987. [14] Campbell A M, Savelsbergh M W P. Decision support for consumer direct grocery initiatives[J]. Transportation Science,2005, 39(3):313-327. [15] Ehmke J F, Campbell A M. Customer acceptance mechanisms for home deliveries in metropolitan areas[J]. European Journal of Operational Research,2014, 233(1):193-207. [16] Punakivi M, Saranen J. Identifying the success factors in e-grocery home delivery[J]. International Journal of Retail & Distribution Management,2001, 29(4):156-163. [17] Campbell A M, Savelsbergh M. Incentive schemes for attended home delivery services[J]. Transportation Science,2006, 40(3):327-341. [18] Solomon M M. Algorithms for the vehicle routing and scheduling problems with time window constraints[J]. Operations Research,1987, 35(2):254-265. |